Sciweavers

Share
51 search results - page 1 / 11
» Phase Transitions for Greedy Sparse Approximation Algorithms
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
11 years 5 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
11 years 7 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
NIPS
2001
11 years 7 months ago
A General Greedy Approximation Algorithm with Applications
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
T. Zhang
CORR
2011
Springer
168views Education» more  CORR 2011»
11 years 3 days ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
ECML
2007
Springer
11 years 11 months ago
On Phase Transitions in Learning Sparse Networks
In this paper we study the identiļ¬cation of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...
Goele Hollanders, Geert Jan Bex, Marc Gyssens, Ron...
books