Proximal Markov chain Monte Carlo algorithms
From MaRDI portal
Publication:2628880
DOI10.1007/s11222-015-9567-4zbMath1505.62315arXiv1306.0187OpenAlexW1558572410WikidataQ59474863 ScholiaQ59474863MaRDI QIDQ2628880
Publication date: 19 July 2016
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.0187
Markov chain Monte Carlosignal processingBayesian inferenceconvex analysishigh-dimensional statisticsproximal algorithms
Computational methods for problems pertaining to statistics (62-08) Estimation in multivariate analysis (62H12) Bayesian inference (62F15) Convex programming (90C25) Monte Carlo methods (65C05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (32)
A Proximal Markov Chain Monte Carlo Method for Bayesian Inference in Imaging Inverse Problems: When Langevin Meets Moreau ⋮ Oracle lower bounds for stochastic gradient sampling algorithms ⋮ Proximal Markov chain Monte Carlo algorithms ⋮ Sparse Online Variational Bayesian Regression ⋮ Asymptotically Exact Data Augmentation: Models, Properties, and Algorithms ⋮ Unnamed Item ⋮ Bayesian Imaging Using Plug & Play Priors: When Langevin Meets Tweedie ⋮ Solving Inverse Problems by Joint Posterior Maximization with Autoencoding Prior ⋮ PAC-Bayesian risk bounds for group-analysis sparse regression by exponential weighting ⋮ Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions ⋮ Gradient-Based Markov Chain Monte Carlo for Bayesian Inference With Non-differentiable Priors ⋮ Bayesian Inference and Uncertainty Quantification for Medical Image Reconstruction with Poisson Data ⋮ The Split Gibbs Sampler Revisited: Improvements to Its Algorithmic Structure and Augmented Target Distribution ⋮ Efficient Bayesian Computation for Low-Photon Imaging Problems ⋮ The forward-backward envelope for sampling with the overdamped Langevin algorithm ⋮ Bayesian Trend Filtering via Proximal Markov Chain Monte Carlo ⋮ Fast exact Bayesian inference for sparse signals in the normal sequence model ⋮ Weak approximation of transformed stochastic gradient MCMC ⋮ Accelerating Proximal Markov Chain Monte Carlo by Using an Explicit Stabilized Method ⋮ Maximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach Part I: Methodology and Experiments ⋮ Unnamed Item ⋮ Efficient Bayesian Computation by Proximal Markov Chain Monte Carlo: When Langevin Meets Moreau ⋮ Proximal algorithms in statistics and machine learning ⋮ Bayesian computation: a summary of the current state, and samples backwards and forwards ⋮ Sparse reconstructions from few noisy data: analysis of hierarchical Bayesian models with generalized gamma hyperpriors ⋮ Sampling from non-smooth distributions through Langevin diffusion ⋮ Geometric adaptive Monte Carlo in random environment ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ Proximal nested sampling for high-dimensional Bayesian model selection ⋮ Unnamed Item ⋮ Nonparametric Bayesian inference for reversible multidimensional diffusions ⋮ Maximum-a-Posteriori Estimation with Bayesian Confidence Regions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Latent variable graphical model selection via convex optimization
- Stability of partially implicit Langevin schemes and their MCMC variants
- Markov chains and stochastic stability
- Fast global convergence of gradient methods for high-dimensional statistical recovery
- Adaptive total variation image deblurring: a majorization-minimization approach
- Exponential convergence of Langevin distributions and their discrete approximations
- Langevin diffusions and Metropolis-Hastings algorithms
- An algorithm for total variation minimization and applications
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Langevin-type models. I: Diffusions with given stationary distributions and their discretizations
- Langevin-type models II: Self-targeting candidates for MCMC algorithms
- Diffusion limit for the random walk Metropolis algorithm out of stationarity
- An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
- Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise.
- Proximal Markov chain Monte Carlo algorithms
- Proximal Splitting Methods in Signal Processing
- Robust principal component analysis?
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Rank-Sparsity Incoherence for Matrix Decomposition
- Practical Markov Chain Monte Carlo
- Deblurring Images
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- The Bayesian Lasso
- Monotone Operators and the Proximal Point Algorithm
- Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
- Strong Convergence of Euler-Type Methods for Nonlinear Stochastic Differential Equations
- Majorize–Minimize Adapted Metropolis–Hastings Algorithm
- Computational and statistical tradeoffs via convex relaxation
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Proximal Markov chain Monte Carlo algorithms
