Fetching the paper…
Reading the bibliography…
This paper presents a new Metropolis-adjusted Langevin algorithm (MALA) that uses convex analysis to simulate efficiently from high-dimensional densities that are log-concave, a class of probability distributions that is widely used in modern high-dimensional statistics and data analysis.
Moreau, J.-J. (1962), ‘Fonctions convexes duales et points proximaux dans un espace Hilbertien’,
1962
Earlier work this paper cites.
Chandrasekaran, V., Parrilo, P. A. and Willsky, A. S. (2012), ‘Latent variable graphical model selection via convex optimization’,
1967
Earlier work this paper cites.
Martinet, B. (1970), ‘Regularisation d’inéquations variationelles par approximations successives’,
1970
Earlier work this paper cites.
Rockafellar, R. T. (1976), ‘Monotone operators and the proximal point algorithm’,
1976
Earlier work this paper cites.
Geyer, C. J. (1992), ‘Practical Markov chain Monte Carlo’,
1992
Earlier work this paper cites.
Meyn, S. and Tweedie, R. (1993),
1993
Earlier work this paper cites.
Roberts, G. O. and Tweedie, R. L. (1996), ‘Exponential convergence of Langevin distributions and their discrete approximations’,
1996
Earlier work this paper cites.
Stramer, O. and Tweedie, R. L. (1999
1999
Earlier work this paper cites.
Stramer, O. and Tweedie, R. L. (1999
1999
Earlier work this paper cites.
Papadopoulo, T. and Lourakis, M. I. A. (2000), Estimating the Jacobian of the singular value decomposition: Theory and applications,
2000
Earlier work this paper cites.
Fazel, M. (2002), Matrix rank minimization with applications, PhD thesis, Ph.D. thesis, Dept. Elec. Eng., Stanford Univ
2002
Earlier work this paper cites.
Mattingly, J., Stuart, A. and Higham, D. (2002), ‘Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise’,
2002
Earlier work this paper cites.
Roberts, G. and Stramer, O. (2002), ‘Langevin diffusions and Metropolis-Hastings algorithms’,
2002
Earlier work this paper cites.
Yuan, Q. and Minka, T. P. (2002), ‘Hessian-based Markov chain Monte Carlo Algorithms’,
2002
Earlier work this paper cites.
Higham, D. J., Mao, X. and Stuart, A. M. (2003), ‘Strong convergence of Euler-type methods for nonlinear stochastic differential equations’,
2003
Earlier work this paper cites.
Chambolle, A. (2004), ‘An algorithm for total variation minimization and applications’,
2004
Earlier work this paper cites.
Robert, C. P. and Casella, G. (2004),
2004
Earlier work this paper cites.
Combettes, P. and Wajs, V. (2005), ‘Signal recovery by proximal forward-backward splitting’,
2005
Earlier work this paper cites.
Atchade, Y. (2006), ‘An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift’,
2006
Cited alongside, same era.
Hansen, P. C., Nagy, J. G. and O’Leary, D. P. (2006),
2006
Cited alongside, same era.
Candès, E. J. and Wakin, M. B. (2008), ‘An introduction to compressive sampling’,
2008
Cited alongside, same era.
Park, T. and Casella, G. (2008), ‘The Bayesian lasso’,
2008
Cited alongside, same era.
Becker, S., Bobin, J. and Candès, E. J. (2009), ‘NESTA: a fast and accurate first-order method for sparse recovery’,
2009
Cited alongside, same era.
Candès, E. J. and Plan, Y. (2009), ‘Matrix completion with noise’,
2009
Cited alongside, same era.
Zhang, Y. and Sutton, C. (2011), ‘Quasi-Newton Markov chain Monte Carlo’,
2011
Later among the works it cites.
Agarwal, A., Negahban, S. and Wainwright, J. M. (2012), ‘Fast global convergence of gradient methods for high-dimensional statistical recovery’,
2012
Later among the works it cites.
Neal, R. (2012), ‘MCMC using Hamiltonian dynamics’,
2012
Later among the works it cites.
Negahban, S. and Wainwright, M. J. (2012), ‘Restricted strong convexity and weighted matrix completion: Optimal bounds with noise’,
2012
Later among the works it cites.
Pesquet, J.-C. and Pustelnik, N. (2012), ‘A parallel inertial proximal optimization method’,
2012
Later among the works it cites.
Pillai, N. S., Stuart, A. M. and Thiéry, A. H. (2012), ‘Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions’,
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Oliveira, J., Bioucas-Dias, J. and Figueiredo, M. (2009), ‘Adaptive total variation image deblurring: A majorization-minimization approach’,
2009
Cited alongside, same era.
Rahul, M., Trevor, H. and Robert, T. (2010), ‘Spectral regularization algorithms for learning large incomplete matrices’,
2010
Cited alongside, same era.
Recht, B., Fazel, M. and Parrilo, P. A. (2010), ‘Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization’,
2010
Cited alongside, same era.
Afonso, M., Bioucas-Dias, J. and Figueiredo, M. (2011), ‘An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems’,
2011
Cited alongside, same era.
Bauschke, H. H. and Combettes, P. L. (2011),
2011
Cited alongside, same era.
Candès, E. J., Li, X., Ma, Y. and Wright, J. (2011), ‘Robust principal component analysis?’,
2011
Cited alongside, same era.
2012
Later among the works it cites.
Candès, E. J., Sing-Long, C. A. and Trzasko, J. D. (2013), ‘Unbiased risk estimates for singular value thresholding and spectral estimators’,
2013
Closest in time.
Chandrasekaran, V. and Jordan, M. I. (2013), ‘Computational and statistical tradeoffs via convex relaxation’,
2013
Closest in time.
Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A. and Rubin, D. B. (2013),
2013
Closest in time.
Pereyra, M. (2013), ‘Proximal Markov chain Monte Carlo algorithms’,
2013
Closest in time.
Schreck, A., Fort, G., Le Corff, S. and Moulines, E. (2013), ‘A shrinkage-thresholding Metropolis adjusted Langevin algorithm for Bayesian variable selection’,
2013
Closest in time.
Chaari, L., Batatia, H., Chaux, C. and Tourneret, J.-Y. (2014), ‘Sparse signal and image recovery using a proximal Bayesian algorithm’,
2014
Closest in time.
Komodakis, N. and Pesquet, J.-C. (2014), ‘Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problems’,
2014
Closest in time.
Marnissi, Y., Benazza-Benyahia, A., Chouzenoux, E. and Pesquet, J.-C. (2014), Majorize-Minimize adapted Metropolis-Hastings algorithm. Application to multichannel image recovery,
2014
Closest in time.
Ottobre, M. and Stuart, A. M. (2014), ‘Diffusion limit for the random walk Metropolis algorithm out of stationarity’,
2014
Closest in time.
Parikh, N. and Boyd, S. (2014), ‘Proximal algorithms’,
2014
Closest in time.
Candès, E. J. and Tao, T. (2009), ‘The power of convex relaxation: Near-optimal matrix completion’,
2080
Closest in time.