Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Safe squeezing for antisparse coding   Spreading the information over all coefficients of a representation is a
desirable property in many applications such as digital communication or
machine learning. This so-called antisparse representation can be obtained by
solving a convex program involving an $\ell_\infty$-norm penalty combined with
a quadratic discrepancy. In this paper, we propose a new methodology, dubbed
safe squeezing, to accelerate the computation of antisparse representation. We
describe a test that allows to detect saturated entries in the solution of the
optimization problem. The contribution of these entries is compacted into a
single vector, thus operating a form of dimensionality reduction. We propose
two algorithms to solve the resulting lower dimensional problem. Numerical
experiments show the effectiveness of the proposed method to detect the
saturated components of the solution and illustrates the induced computational
gains in the resolution of the antisparse problem.

20
The categories of this paper are: acc-phys
0
The categories of this paper are: hep-ph
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
13
The categories of this paper are: quant-ph
34
The categories of this paper are: chem-ph
15
The categories of this paper are: nucl-ex
10
The categories of this paper are: q-bio
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
2
The categories of this paper are: math
26
The categories of this paper are: bayes-an
35
The categories of this paper are: mtrl-th
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci