Asymptotically exact data augmentation: models, properties and algorithms
Not on the map. Why?
Abstract (arXiv)
Data augmentation, by the introduction of auxiliary variables, has become an ubiquitous technique to improve convergence properties, simplify the implementation or reduce the computational time of inference methods such as Markov chain Monte Carlo ones. Nonetheless, introducing appropriate auxiliary variables while preserving the initial target probability distribution and offering a computationally efficient inference cannot be conducted in a systematic way. To deal with such issues, this paper studies a unified framework, coined asymptotically exact data augmentation (AXDA), which encompasses both well-established and more recent approximate augmented models. In a broader perspective, this paper shows that AXDA models can benefit from interesting statistical properties and yield efficient inference algorithms. In non-asymptotic settings, the quality of the proposed approximation is assessed with several theoretical results. The latter are illustrated on standard statistical problems. Supplementary materials including computer code for this paper are available online.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Feb 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 3; 2025: 0; 2026: 1.
8 papers.
- 2023Plug-and-Play split Gibbs sampler: embedding deep generative priors in Bayesian inferencecited by 41
- 2024Repulsive Latent Score Distillation for Solving Inverse Problemscited by 15
- 2021DG-LMC: A Turn-key and Scalable Synchronous Distributed MCMC Algorithm via Langevin Monte Carlo within Gibbscited by 11
- 2024Regularization by denoising: Bayesian model and Langevin-within-split Gibbs samplingcited by 9
- 2023Machine Learning and the Future of Bayesian Computationcited by 4
- 2022Federated Averaging Langevin Dynamics: Toward a unified theory and new algorithmscited by 2
- 2024Scalable Vertical Federated Learning via Data Augmentation and Amortized Inferencecited by 2
- 2026Bridging data-driven priors via the score function for posterior sampling -- Comparative review and experimental studycited by 0
- 2026Bridging data-driven priors via the score function for posterior sampling -- Comparative review and experimental study11 Jun 2026
- 2024Repulsive Latent Score Distillation for Solving Inverse Problems24 Jun 2024
- 2024Scalable Vertical Federated Learning via Data Augmentation and Amortized Inference7 May 2024
- 2024Regularization by denoising: Bayesian model and Langevin-within-split Gibbs sampling19 Feb 2024
- 2023Machine Learning and the Future of Bayesian Computation21 Apr 2023
- 2023Plug-and-Play split Gibbs sampler: embedding deep generative priors in Bayesian inference21 Apr 2023
- 2022Federated Averaging Langevin Dynamics: Toward a unified theory and new algorithms31 Oct 2022
- 2021DG-LMC: A Turn-key and Scalable Synchronous Distributed MCMC Algorithm via Langevin Monte Carlo within Gibbs11 Jun 2021