Sciweavers

84 search results - page 8 / 17
» Gradient-Based Methods for Sparse Recovery
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Simultaneous image transformation and sparse representation recovery
Sparse representation in compressive sensing is gaining increasing attention due to its success in various applications. As we demonstrate in this paper, however, image sparse rep...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
JMLR
2012
11 years 10 months ago
Sparse Higher-Order Principal Components Analysis
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
Genevera Allen
TSP
2008
151views more  TSP 2008»
13 years 7 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
HPDC
2011
IEEE
12 years 11 months ago
Algorithm-based recovery for iterative methods without checkpointing
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...
Zizhong Chen
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...