A survey of stochastic simulation and optimization methods in signal processing

M Pereyra, P Schniter, E Chouzenoux… - IEEE Journal of …, 2015 - ieeexplore.ieee.org
Modern signal processing (SP) methods rely very heavily on probability and statistics to
solve challenging SP problems. SP methods are now expected to deal with ever more …

Theoretical guarantees for approximate sampling from smooth and log-concave densities

AS Dalalyan - Journal of the Royal Statistical Society Series B …, 2017 - academic.oup.com
Sampling from various kinds of distribution is an issue of paramount importance in statistics
since it is often the key ingredient for constructing estimators, test procedures or confidence …

Bayesian linear regression with sparse priors

I Castillo, J Schmidt-Hieber, A Van der Vaart - The Annals of Statistics, 2015 - JSTOR
We study full Bayesian procedures for high-dimensional linear regression under sparsity
constraints. The prior is a mixture of point masses at zero and continuous distributions …

Bayesian approaches to variable selection: a comparative study from practical perspectives

Z Lu, W Lou - The International Journal of Biostatistics, 2022 - degruyter.com
In many clinical studies, researchers are interested in parsimonious models that
simultaneously achieve consistent variable selection and optimal prediction. The resulting …

Bayesian computation: a summary of the current state, and samples backwards and forwards

PJ Green, K Łatuszyński, M Pereyra, CP Robert - Statistics and Computing, 2015 - Springer
Recent decades have seen enormous improvements in computational inference for
statistical models; there have been competitive continual enhancements in a wide range of …

On the computational complexity of high-dimensional Bayesian variable selection

Y Yang, MJ Wainwright, MI Jordan - 2016 - projecteuclid.org
On the computational complexity of high-dimensional Bayesian variable selection Page 1 The
Annals of Statistics 2016, Vol. 44, No. 6, 2497–2532 DOI: 10.1214/15-AOS1417 © Institute of …

Proximal markov chain monte carlo algorithms

M Pereyra - Statistics and Computing, 2016 - Springer
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 …

Monge, bregman and occam: Interpretable optimal transport in high-dimensions with feature-sparse maps

M Cuturi, M Klein, P Ablin - arxiv preprint arxiv:2302.04065, 2023 - arxiv.org
Optimal transport (OT) theory focuses, among all maps $ T:\mathbb {R}^ d\rightarrow\mathbb
{R}^ d $ that can morph a probability measure onto another, on those that are the``thriftiest'' …

Provably efficient posterior sampling for sparse linear regression via measure decomposition

A Montanari, Y Wu - arxiv preprint arxiv:2406.19550, 2024 - arxiv.org
We consider the problem of sampling from the posterior distribution of a $ d $-dimensional
coefficient vector $\boldsymbol {\theta} $, given linear observations $\boldsymbol …

[HTML][HTML] Gradient-based adaptive importance samplers

V Elvira, E Chouzenoux, ÖD Akyildiz… - Journal of the Franklin …, 2023 - Elsevier
Importance sampling (IS) is a powerful Monte Carlo methodology for the approximation of
intractable integrals, very often involving a target probability distribution. The performance of …