Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Blended Matching Pursuit   Matching pursuit algorithms are an important class of algorithms in signal
processing and machine learning. We present a blended matching pursuit
algorithm, combining coordinate descent-like steps with stronger gradient
descent steps, for minimizing a smooth convex function over a linear space
spanned by a set of atoms. We derive sublinear to linear convergence rates
according to the smoothness and sharpness orders of the function and
demonstrate computational superiority of our approach. In particular, we derive
linear rates for a wide class of non-strongly convex functions, and we
demonstrate in experiments that our algorithm enjoys very fast rates of
convergence and wall-clock speed while maintaining a sparsity of iterates very
comparable to that of the (much slower) orthogonal matching pursuit.

7
The categories of this paper are: hep-th
3
The categories of this paper are: physics
21
The categories of this paper are: adap-org
34
The categories of this paper are: chem-ph
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
22
The categories of this paper are: chao-dyn
31
The categories of this paper are: ao-sci
8
The categories of this paper are: hep-ex