Sciweavers

14 search results - page 2 / 3
» Online performance guarantees for sparse recovery
Sort
View
ICCV
2009
IEEE
13 years 2 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
CORR
2010
Springer
207views Education» more  CORR 2010»
13 years 4 months ago
Collaborative Hierarchical Sparse Modeling
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an 1-regularized linear regression prob...
Pablo Sprechmann, Ignacio Ramírez, Guillerm...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 4 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 4 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang
COLT
2010
Springer
13 years 2 months ago
Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...
John Duchi, Elad Hazan, Yoram Singer