Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fast and Faster: A Comparison of Two Streamed Matrix Decomposition
  Algorithms   With the explosion of the size of digital dataset, the limiting factor for
decomposition algorithms is the \emph{number of passes} over the input, as the
input is often stored out-of-core or even off-site. Moreover, we're only
interested in algorithms that operate in \emph{constant memory} w.r.t. to the
input size, so that arbitrarily large input can be processed. In this paper, we
present a practical comparison of two such algorithms: a distributed method
that operates in a single pass over the input vs. a streamed two-pass
stochastic algorithm. The experiments track the effect of distributed
computing, oversampling and memory trade-offs on the accuracy and performance
of the two algorithms. To ensure meaningful results, we choose the input to be
a real dataset, namely the whole of the English Wikipedia, in the application
settings of Latent Semantic Analysis.

33
The categories of this paper are: plasm-ph
30
The categories of this paper are: q-alg
31
The categories of this paper are: ao-sci
16
The categories of this paper are: stat
18
The categories of this paper are: econ
35
The categories of this paper are: mtrl-th
13
The categories of this paper are: quant-ph
34
The categories of this paper are: chem-ph
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
27
The categories of this paper are: comp-gas
29
The categories of this paper are: funct-an