Fetching the paper…
Reading the bibliography…
This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems.
L. Onsager, Electric Moments of Molecules in Liquids , J. Amer. Chem. Soc. 58
1936
Earlier work this paper cites.
D. J. Thouless, P. W. Anderson, and R. G. Palmer, Solution of ‘Solvable model of a spin glass’ , Phil. Mag. 35
1977
Earlier work this paper cites.
M. Mézard, G. Parisi, and M. A. Virasoro, Spin glass theory and beyond , World Scientific, Singapore, 1987
1987
Earlier work this paper cites.
J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference , Morgan Kaufmann, San Francisco, 1988
1988
Earlier work this paper cites.
D. Williams, Probability with Martingales , Cambridge University Press, Cambridge, 1991
1991
Earlier work this paper cites.
R. Affentranger and R. Schneider, Random projections of regular simplices , Discr. and Comput. Geometry 7
1992
Earlier work this paper cites.
D.L. Donoho, I.M. Johnstone, J.C. Hoch, and A.S. Stern, Maximum entropy and the nearly black object , Journal of the Royal Statistical Society, Series B (Methodological) 54
1992
Earlier work this paper cites.
D. L. Donoho and I. M. Johnstone, Ideal spatial adaptation via wavelet shrinkage , Biometrika 81
1994
Earlier work this paper cites.
P. Billingsley, Probability and Measure , Wiley, USA, 1995
1995
Earlier work this paper cites.
S.S. Chen and D.L. Donoho, Examples of basis pursuit , Proceedings of Wavelet Applications in Signal and Image Processing III (San Diego, CA), 1995
1995
Earlier work this paper cites.
R. Tibshirani, Regression shrinkage and selection with the lasso , J. Royal. Statist. Soc B 58
1996
Earlier work this paper cites.
M. Jordan (ed.), Learning in graphical models , MIT Press, Boston, 1998
1998
Earlier work this paper cites.
E.L. Lehmann and G. Casella, Theory of Point Estimation , Springer-Verlag, New York, 1998
1998
Earlier work this paper cites.
A.W. van der Vaart, Asymptotic Statistics , Cambridge University Press, Cambridge, 2000
2000
Earlier work this paper cites.
R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde, Model-Based Compressive Sensing , IEEE Trans. on Inform. Theory 56
2001
Earlier work this paper cites.
M. Ledoux, The concentration of measure phenomenon , American Mathematical Society, Berlin, 2001
2001
Earlier work this paper cites.
I. Johnstone, Function Estimation and Gaussian Sequence Models , Draft of a book, available at http://www-stat.stanford.edu/ ∼ \sim imj/based.pdf
2002
Earlier work this paper cites.
T. Tanaka, A Statistical-Mechanics Approach to Large-System Analysis of CDMA Multiuser Detectors , IEEE Trans. on Inform. Theory 48
2002
Earlier work this paper cites.
D. Aldous and J. M. Steele, The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence , Probability on discrete structures (H. Kesten, ed.), Springer Verlag, 2003, pp. 1–72
2003
Earlier work this paper cites.
M.A.T. Figueiredo and R.D. Nowak, An EM algorithm for wavelet-based image restoration , IEEE Trans. on Image Proc. 12
2003
Earlier work this paper cites.
T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning , Springer-Verlag, New York, 2003
2003
Earlier work this paper cites.
G. Cormode and S. Muthukrishnan, Improved data streams summaries: The count-min sketch and its aplications , Latin (Buenos Aires), 2004, pp. 29–38
2004
Earlier work this paper cites.
D. L. Donoho and J. Tanner, Neighborliness of randomly-projected simplices in high dimensions , Proceedings of the National Academy of Sciences 102
2005
Earlier work this paper cites.
D. Weitz, Combinatorial criteria for uniqueness of Gibbs measures , Rand. Struct. Alg. 27
2005
Earlier work this paper cites.
E. Candes, J. K. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements , Communications on Pure and Applied Mathematics 59
2006
Earlier work this paper cites.
D. Donoho, High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension , Discr. and Comput. Geometry 35
2006
Cited alongside, same era.
A. Montanari and D. Tse, Analysis of belief propagation for non-linear problems: the example of CDMA (or: how to prove Tanaka’s formula) , Proceedings of IEEE Inform. Theory Workshop (Punta de l’Este, Uruguay), 2006
2006
Cited alongside, same era.
2006
Cited alongside, same era.
G. Andrew and G. Jianfeng, Scalable training of l 1 l^{1} -regularized log-linear models , Proceedings of the 24th international conference on Machine learning, 2007, pp. 33–40
2007
Cited alongside, same era.
E. Candes and T. Tao, The Dantzig selector: statistical estimation when p is much larger than n , Annals of Statistics 35
Y. Kabashima, T. Wadayama, and T. Tanaka, A typical reconstruction limit for compressed sensing based on lp-norm minimization , J.Stat. Mech. (2009), L09003
2009
Later among the works it cites.
M. Mézard and A. Montanari, Information, Physics and Computation , Oxford University Press, Oxford, 2009
2009
Later among the works it cites.
2009
Later among the works it cites.
S. Rangan, A. K. Fletcher, and V. K. Goyal, Asymptotic analysis of map estimation via the replica method and applications to compressed sensing , PUT NIPS REF, 2009
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2007
Cited alongside, same era.
D. Gamarnik and D. Katz, Correlation decay and deterministic FPTAS for counting list-colorings of a graph , 18th annual ACM-SIAM Symposium On Discrete Algorithm (New Orleans), 2007, pp. 1245–1254
2007
Cited alongside, same era.
Y. Lu, A. Montanari, and B. Prabhakar, Detailed Network Measurements Using Sparse Graph Counters: The Theory , 45th Annual Allerton Conference (Monticello, IL), September 2007
2007
Cited alongside, same era.
C. Moallemi and B. Van Roy, Convergence of the min-sum algorithm for convex optimization , 45th Annual Allerton Conference (Monticello, IL), September 2007
2007
Cited alongside, same era.
W. Xu and B. Hassibi, Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , Proceedings of IEEE Inform. Theory Workshop (Tahoe City, CA), 2007
2007
Cited alongside, same era.
R. Berinde, A. C. Gilbert, P. Indyk, H. Karloff, and M. J. Strauss, Combining Geometry and Combinatorics: A Unified Approach to Sparse Signal Recovery , 46th Annual Allerton Conference (Monticello, IL), September 2008
2008
Cited alongside, same era.
V. Cevher, Learning with compressible priors , Neural Information Processing Systems (Vancouver), December 2008
2008
Cited alongside, same era.
V. Cevher, C. Hegde, M. F. Duarte, and R. G. Baraniuk, Sparse Signal Recovery Using Markov Random Fields , Neural Information Processing Systems (Vancouver), December 2008
2008
Cited alongside, same era.
2009
Later among the works it cites.
M. Bayati and A. Montanari, Approximate message passing algorithms for generalized linear models , in preparation, 2010
2010
Closest in time.
V. Cevher, P. Indyk, L. Carin, and R.G. Baraniuk, Sparse Signal Recovery and Acquisition with Graphical Models , IEEE Signal Processing Magazine 27
2010
Closest in time.
V. Chandar, D. Shah, and G. W. Wornell, A simple message-passing algorithm for compressed sensing , Proceedings of IEEE International Symposium on Inform. Theory (ISIT) (Austin), 2010
2010
Closest in time.
D. Donoho and A. Montanari, Approximate message passing for reconstruction of block-sparse signals , in preparation, 2010
2010
Closest in time.
2010
Closest in time.
M. Grant and S. Boyd, CVX: Matlab software for disciplined convex programming, version 1.21 , http://cvxr.com/cvx
2010
Closest in time.
D. Guo and S. Verdu, Randomly Spread CDMA: Asymptotics via Statistical Physics , IEEE Trans. on Inform. Theory 51
2010
Closest in time.
R. H. Keshavan and A. Montanari, Fast algorithms for matrix completion , In preparation, 2010
2010
Closest in time.
2010
Closest in time.
2010
Closest in time.
A. Maleki and D. L. Donoho, Optimally tuned iterative thresholding algorithm for compressed sensing , IEEE Journal of Selected Topics in Signal Processing 4
2010
Closest in time.
2010
Closest in time.
S. Sarvotham, D. Baron, and R. Baraniuk, Bayesian Compressive Sensing via Belief Propagation , IEEE Trans. on Signal Processing 58
2010
Closest in time.
P. Schniter, Turbo Reconstruction of Structured Sparse Signals , Proceedings of the Conference on Information Sciences and Systems (Princeton), 2010
2010
Closest in time.
S. Som, L. C. Potter, and P. Schniter, Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior , Proc. Asilomar Conf. on Signals, Systems, and Computers, November 2010
2010
Closest in time.
L.C. Potter S. Som and P. Schniter, On Approximate Message Passing for Reconstruction of Non-Uniformly Sparse Signals , Proceedings of the National Aereospace and Electronics Conference (Dayton, OH), 2010
2010
Closest in time.
J. A. Tropp, J. N. Laska, M. F. Duarte, J. K. Romberg, and R. G. Baraniuk, Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals , IEEE Trans. on Inform. Theory 56
2010
Closest in time.
T. Tanaka and J. Raymond, Optimal incorporation of sparsity information bt weighted L 1 L_{1} optimization , Proceedings of IEEE International Symposium on Inform. Theory (ISIT) (Austin), 2010
2010
Closest in time.
M. Bayati, J. Bento, and A. Montanari, Universality in sparse reconstruction: A comparison between theories and empirical results , in preparation, 2011
2011
Closest in time.