Sciweavers

30 search results - page 1 / 6
» Coresets, sparse greedy approximation, and the Frank-Wolfe a...
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 5 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
CORR
2011
Springer
168views Education» more  CORR 2011»
12 years 10 months 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
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
12 years 10 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
IJCNN
2006
IEEE
13 years 9 months ago
Greedy forward selection algorithms to Sparse Gaussian Process Regression
Abstract— This paper considers the basis vector selection issue invloved in forward selection algorithms to sparse Gaussian Process Regression (GPR). Firstly, we re-examine a pre...
Ping Sun, Xin Yao
ICIP
2007
IEEE
13 years 10 months ago
Locally Competitive Algorithms for Sparse Approximation
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
Christopher J. Rozell, Don H. Johnson, Richard G. ...