Bayesian computation: a summary of the current state, and samples backwards and forwards
From MaRDI portal
Publication:5963784
Abstract: The past decades have seen enormous improvements in computational inference based on statistical models, with continual enhancement in a wide range of computational tools, in competition. In Bayesian inference, first and foremost, MCMC techniques continue to evolve, moving from random walk proposals to Langevin drift, to Hamiltonian Monte Carlo, and so on, with both theoretical and algorithmic inputs opening wider access to practitioners. However, this impressive evolution in capacity is confronted by an even steeper increase in the complexity of the models and datasets to be addressed. The difficulties of modelling and then handling ever more complex datasets most likely call for a new type of tool for computational inference that dramatically reduce the dimension and size of the raw data while capturing its essential aspects. Approximate models and algorithms may thus be at the core of the next computational revolution.
Recommendations
Cites work
- scientific article; zbMATH DE number 3423418 (Why is no real title available?)
- scientific article; zbMATH DE number 3841285 (Why is no real title available?)
- scientific article; zbMATH DE number 54145 (Why is no real title available?)
- scientific article; zbMATH DE number 472922 (Why is no real title available?)
- scientific article; zbMATH DE number 597901 (Why is no real title available?)
- scientific article; zbMATH DE number 646825 (Why is no real title available?)
- scientific article; zbMATH DE number 1069282 (Why is no real title available?)
- scientific article; zbMATH DE number 1085980 (Why is no real title available?)
- scientific article; zbMATH DE number 837912 (Why is no real title available?)
- scientific article; zbMATH DE number 849922 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- scientific article; zbMATH DE number 3076589 (Why is no real title available?)
- A Bayesian Reassessment of Nearest-Neighbor Classification
- A brief survey of modern optimization for statisticians
- A comparative review of dimension reduction methods in approximate Bayesian computation
- A general framework for the parametrization of hierarchical models
- A general metric for Riemannian manifold Hamiltonian Monte Carlo
- A generalized forward-backward splitting
- A note on Metropolis-Hastings kernels for general state spaces
- A parallel inertial proximal optimization method
- A primer on disease mapping and ecological regression using \({\mathtt{INLA}}\)
- A proximal decomposition method for solving convex variational inverse problems
- A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data
- A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms
- Adaptive Gibbs samplers and related MCMC methods
- Adaptive Markov Chain Monte Carlo through Regeneration
- Adaptive sampling for Bayesian variable selection
- Adaptive total variation image deblurring: a majorization-minimization approach
- An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
- An adaptive Metropolis algorithm
- An adaptive approach to Langevin MCMC
- An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
- An algorithm for total variation minimization and applications
- An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants
- An introduction to variational methods for graphical models
- Antithetic coupling of two Gibbs sampler chains.
- Applications of a Method for the Efficient Computation of Posterior Distributions
- Approximate Bayesian computation: a nonparametric perspective
- Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations (with discussion)
- BART: Bayesian additive regression trees
- Bayesian Inference for Non-Gaussian Ornstein–Uhlenbeck Stochastic Volatility Processes
- Bayesian analysis of mixture models with an unknown number of components\,--\,an alternative to reversible jump methods.
- Bayesian computation and stochastic systems. With comments and reply.
- Bayesian learning for neural networks
- Bayesianly justifiable and relevant frequency calculations for the applied statistician
- Computational and statistical tradeoffs via convex relaxation
- Consistency and fluctuations for stochastic gradient Langevin dynamics
- Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation. With discussion and authors' reply
- Convergence and refinement of the Wang-Landau algorithm
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
- Convex analysis and monotone operator theory in Hilbert spaces
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- Cuts in Bayesian graphical models
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficient MCMC for climate model parameter estimation: parallel adaptive chains and early rejection
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
- Efficient parallelisation of Metropolis-Hastings algorithms using a prefetching approach
- Empirical likelihood
- Equation of state calculations by fast computing machines
- Equi-energy sampler with applications in statistical inference and statistical mechanics
- Exact and Computationally Efficient Likelihood-Based Estimation for Discretely Observed Diffusion Processes (with Discussion)
- Expectation propagation for likelihood-free inference
- Exponential convergence of Langevin distributions and their discrete approximations
- Fixed-form variational posterior approximation through stochastic linear regression
- General state space Markov chains and MCMC algorithms
- Geometric Numerical Integration
- Geometric bounds for eigenvalues of Markov chains
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Hierarchical Bayesian Analysis of Changepoint Problems
- Inference and Model Choice for Sequentially Ordered Hidden Markov Models
- Introductory lectures on convex optimization. A basic course.
- Langevin diffusions and Metropolis-Hastings algorithms
- Langevin diffusions and the Metropolis-adjusted Langevin algorithm
- Langevin-type models II: Self-targeting candidates for MCMC algorithms
- Langevin-type models. I: Diffusions with given stationary distributions and their discretizations
- Learn from thy neighbor: parallel-chain and regional adaptive MCMC
- Likelihood-free estimation of model evidence
- MCMC methods for functions: modifying old algorithms to make them faster
- MCMC using Hamiltonian dynamics
- Markov Chains and Stochastic Stability
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Minimising MCMC variance via diffusion limits, with an application to simulated tempering
- Monotone Operators and the Proximal Point Algorithm
- Monte Carlo sampling methods using Markov chains and their applications
- Multiprocess parallel antithetic coupling for backward and forward Markov chain Monte Carlo
- New insights into approximate Bayesian computation
- Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels
- Nonasymptotic mixing of the MALA algorithm
- On Russian roulette estimates for Bayesian inference with doubly-intractable likelihoods
- On adaptive Markov chain Monte Carlo algorithms
- On inference for partially observed nonlinear diffusion models using the Metropolis-Hastings algorithm
- On the containment condition for adaptive Markov chain Monte Carlo algorithms
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- On the ergodicity properties of some adaptive MCMC algorithms
- On the stability of some controlled Markov chains and its applications to stochastic approximation with Markovian dynamic
- On-Line Inference for Hidden Markov Models via Particle Filters
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Optimal metropolis algorithms for product measures on the vertices of a hypercube
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Optimal scaling for the pseudo-marginal random walk Metropolis: insensitivity to the noise generating mechanism
- Optimal scaling for the transient phase of Metropolis Hastings algorithms: the longtime behavior
- Optimal scaling for the transient phase of the random walk Metropolis algorithm: the mean-field limit
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scaling of random walk Metropolis algorithms with discontinuous target densities
- Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Optimal tuning of the hybrid Monte Carlo algorithm
- Optimum Monte-Carlo sampling using Markov chains
- Particle Gibbs with ancestor sampling
- Particle Markov Chain Monte Carlo Methods
- Perturbation theory for Markov chains via Wasserstein distance
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Proximal Markov chain Monte Carlo algorithms
- Proximal splitting methods in signal processing
- Rates of convergence of the Hastings and Metropolis algorithms
- Relevant statistics for Bayesian model choice
- Reversible Jump, Birth-and-Death and More General Continuous Time Markov Chain Monte Carlo Samplers
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
- Robust adaptive Metropolis algorithm with coerced acceptance rate
- Robust and scalable Bayes via a median of subset posterior measures
- Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
- Scaling analysis of delayed rejection MCMC methods
- Scaling analysis of multiple-try MCMC methods
- Sequential Monte Carlo Samplers
- Sequential Monte Carlo methods for Bayesian elliptic inverse problems
- Simulating events of unknown probabilities via reverse time martingales
- Speeding Up MCMC by Efficient Data Subsampling
- Stability of noisy Metropolis-Hastings
- Stable signal recovery from incomplete and inaccurate measurements
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Stochastic modelling for systems biology.
- Stochastic models for phylogenetic trees on higher-order taxa
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- The BUGS book. A practical introduction to Bayesian analysis
- The Calculation of Posterior Distributions by Data Augmentation
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The Wang-Landau algorithm in general state spaces: applications and convergence analysis
- The Wang-Landau algorithm reaches the flat histogram criterion in finite time
- The containment condition and AdapFail algorithms
- The convex geometry of linear inverse problems
- The geometric foundations of Hamiltonian Monte Carlo
- The implementation of the bayesian paradigm
- The pseudo-marginal approach for efficient Monte Carlo computations
- The rate of convergence for approximate Bayesian computation
- Time-reversible diffusions
- Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo
- Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
- \(\mathrm{SMC}^2\): an efficient algorithm for sequential analysis of state space models
Cited in
(38)- Maximum likelihood estimation of regularization parameters in high-dimensional inverse problems: an empirical Bayesian approach. I: Methodology and experiments
- Efficient Bayesian Computation for Low-Photon Imaging Problems
- A proximal Markov chain Monte Carlo method for Bayesian inference in imaging inverse problems: when Langevin meets Moreau
- Sparse Online Variational Bayesian Regression
- Approximate Bayesian computational methods for the inference of unknown parameters
- Greater than the sum of its parts: computationally flexible Bayesian hierarchical modeling
- Multilevel rejection sampling for approximate Bayesian computation
- Bayesian hierarchical models for the combination of spatially misaligned data: a comparison of melding and downscaler approaches using INLA and SPDE
- Multimodal, high-dimensional, model-based, Bayesian inverse problems with applications in biomechanics
- Proximal nested sampling for high-dimensional Bayesian model selection
- Scalable Bayesian Nonparametric Clustering and Classification
- Insufficient Gibbs sampling
- Non-reversible guided Metropolis kernel
- A framework for adaptive MCMC targeting multimodal distributions
- Marginalized approximate filtering of state‐space models
- Solving inverse problems using data-driven models
- Rao–Blackwellisation in the Markov Chain Monte Carlo Era
- Geometric ergodicity of the bouncy particle sampler
- Adaptive kernels in approximate filtering of state-space models
- The emergence of gravitational wave science: 100 years of development of mathematical theory, detectors, numerical algorithms, and data analysis tools
- Dimension-free mixing times of Gibbs samplers for Bayesian hierarchical models
- Efficient Adaptive MCMC Through Precision Estimation
- Langevin diffusion for population based sampling with an application in Bayesian inference for pharmacodynamics
- Patterns of scalable Bayesian inference
- Approximating Bayes in the 21st century
- Computing Bayes: from then `til now
- Computational advances for and from Bayesian analysis
- Maximum-a-posteriori estimation with Bayesian confidence regions
- Weak neural variational inference for solving Bayesian inverse problems \textit{without} forward models: applications in elastography
- Vector operations for accelerating expensive Bayesian computations - a tutorial guide
- Making Recursive Bayesian Inference Accessible
- Bayesian analysis of big data in insurance predictive modeling using distributed computing
- Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau
- Weighted Bayesian bootstrap for scalable posterior distributions
- Parallel local approximation MCMC for expensive models
- Proximal algorithms in statistics and machine learning
- ABC of the future
- Comment: A brief survey of the current state of play for Bayesian computation in data science at big-data scale
Describes a project that uses
Uses Software
This page was built for publication: Bayesian computation: a summary of the current state, and samples backwards and forwards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963784)
