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

DOI10.1007/s11222-015-9574-5zbMath1331.62017arXiv1502.01148OpenAlexW639587122WikidataQ59409805 ScholiaQ59409805MaRDI QIDQ5963784

No author found.

Publication date: 23 February 2016

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.01148

zbMATH Keywords

Bayesian analysisoptimisationABC techniquesMCMC algorithms

Mathematics Subject Classification ID

Related Items (29)

A Proximal Markov Chain Monte Carlo Method for Bayesian Inference in Imaging Inverse Problems: When Langevin Meets Moreau ⋮ Sparse Online Variational Bayesian Regression ⋮ Making Recursive Bayesian Inference Accessible ⋮ BAYESIAN ANALYSIS OF BIG DATA IN INSURANCE PREDICTIVE MODELING USING DISTRIBUTED COMPUTING ⋮ Greater than the sum of its parts: computationally flexible Bayesian hierarchical modeling ⋮ Multilevel rejection sampling for approximate Bayesian computation ⋮ Geometric ergodicity of the bouncy particle sampler ⋮ Weighted Bayesian bootstrap for scalable posterior distributions ⋮ Rao–Blackwellisation in the Markov Chain Monte Carlo Era ⋮ ABC of the future ⋮ Non-reversible guided Metropolis kernel ⋮ Efficient Bayesian Computation for Low-Photon Imaging Problems ⋮ Vector operations for accelerating expensive Bayesian computations - a tutorial guide ⋮ Multimodal, high-dimensional, model-based, Bayesian inverse problems with applications in biomechanics ⋮ A framework for adaptive MCMC targeting multimodal distributions ⋮ Maximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach Part I: Methodology and Experiments ⋮ Parallel Local Approximation MCMC for Expensive Models ⋮ Langevin Diffusion for Population Based Sampling with an Application in Bayesian Inference for Pharmacodynamics ⋮ Marginalized approximate filtering of state‐space models ⋮ Approximate Bayesian computational methods for the inference of unknown parameters ⋮ Efficient Bayesian Computation by Proximal Markov Chain Monte Carlo: When Langevin Meets Moreau ⋮ Proximal algorithms in statistics and machine learning ⋮ Efficient Adaptive MCMC Through Precision Estimation ⋮ Adaptive kernels in approximate filtering of state‐space models ⋮ Scalable Bayesian Nonparametric Clustering and Classification ⋮ The emergence of gravitational wave science: 100 years of development of mathematical theory, detectors, numerical algorithms, and data analysis tools ⋮ Solving inverse problems using data-driven models ⋮ Proximal nested sampling for high-dimensional Bayesian model selection ⋮ Maximum-a-Posteriori Estimation with Bayesian Confidence Regions

Uses Software

• MapReduce
• UNLocBoX
• MrBayes
• BayesTree
• Hadoop
• Stan
• ramcmc
• DIYABC
• BartPy

Cites Work

• Monotone Operators and the Proximal Point Algorithm
• Time-reversible diffusions
• Optimal Scaling of Discrete Approximations to Langevin Diffusions
• Optimal metropolis algorithms for product measures on the vertices of a hypercube
• Adaptive Markov Chain Monte Carlo through Regeneration
• Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
• Particle Markov Chain Monte Carlo Methods
• Constructing Summary Statistics for Approximate Bayesian Computation: Semi-Automatic Approximate Bayesian Computation
• Robust and Scalable Bayes via a Median of Subset Posterior Measures
• Bayesian Inference for Non-Gaussian Ornstein–Uhlenbeck Stochastic Volatility Processes
• On-Line Inference for Hidden Markov Models via Particle Filters
• Reversible Jump, Birth-and-Death and More General Continuous Time Markov Chain Monte Carlo Samplers
• Hierarchical Bayesian Analysis of Changepoint Problems
• Nonasymptotic mixing of the MALA algorithm
• A Brief Survey of Modern Optimization for Statisticians
• Expectation Propagation for Likelihood-Free Inference
• Computational and statistical tradeoffs via convex relaxation
• Simulating events of unknown probabilities via reverse time martingales
• Equation of State Calculations by Fast Computing Machines
• Speeding Up MCMC by Efficient Data Subsampling
• Approximate Bayesian Computation: A Nonparametric Perspective
• A Bayesian Reassessment of Nearest-Neighbor Classification
• Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
• An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
• A General Metric for Riemannian Manifold Hamiltonian Monte Carlo
• Inference and Model Choice for Sequentially Ordered Hidden Markov Models
• Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
• Geometric Numerical Integration
• Stable signal recovery from incomplete and inaccurate measurements
• Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
• An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants
• Monte Carlo sampling methods using Markov chains and their applications
• SMC2: An Efficient Algorithm for Sequential Analysis of State Space Models
• Relevant Statistics for Bayesian Model Choice
• Convex analysis and monotone operator theory in Hilbert spaces
• An adaptive Metropolis algorithm
• Cuts in Bayesian graphical models
• Sequential Monte Carlo methods for Bayesian elliptic inverse problems
• MCMC methods for functions: modifying old algorithms to make them faster
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• BART: Bayesian additive regression trees
• Robust adaptive Metropolis algorithm with coerced acceptance rate
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
• The pseudo-marginal approach for efficient Monte Carlo computations
• A comparative review of dimension reduction methods in approximate Bayesian computation
• Optimal scaling for the pseudo-marginal random walk Metropolis: insensitivity to the noise generating mechanism
• Stability of noisy Metropolis-Hastings
• A general framework for the parametrization of hierarchical models
• Equi-energy sampler with applications in statistical inference and statistical mechanics
• Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• Optimal scaling for the transient phase of Metropolis Hastings algorithms: the longtime behavior
• On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
• A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data
• Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo
• Optimal scaling of random walk Metropolis algorithms with discontinuous target densities
• An adaptive approach to Langevin MCMC
• Convergence and refinement of the Wang-Landau algorithm
• Bayesianly justifiable and relevant frequency calculations for the applied statistician
• Scaling analysis of multiple-try MCMC methods
• Geometric bounds for eigenvalues of Markov chains
• On adaptive Markov chain Monte Carlo algorithms
• On the ergodicity properties of some adaptive MCMC algorithms
• Fixed-form variational posterior approximation through stochastic linear regression
• Stochastic models for phylogenetic trees on higher-order taxa
• General state space Markov chains and MCMC algorithms
• Adaptive total variation image deblurring: a majorization-minimization approach
• A note on Metropolis-Hastings kernels for general state spaces
• Exponential convergence of Langevin distributions and their discrete approximations
• Weak convergence and optimal scaling of random walk Metropolis algorithms
• Langevin diffusions and Metropolis-Hastings algorithms
• Introductory lectures on convex optimization. A basic course.
• An algorithm for total variation minimization and applications
• Optimal scaling for various Metropolis-Hastings algorithms.
• Bayesian computation and stochastic systems. With comments and reply.
• Perturbation theory for Markov chains via Wasserstein distance
• On Russian roulette estimates for Bayesian inference with doubly-intractable likelihoods
• Bayesian analysis of mixture models with an unknown number of components\,--\,an alternative to reversible jump methods.
• Antithetic coupling of two Gibbs sampler chains.
• Bayesian learning for neural networks
• Rates of convergence of the Hastings and Metropolis algorithms
• The convex geometry of linear inverse problems
• Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
• Adaptive Gibbs samplers and related MCMC methods
• Langevin-type models. I: Diffusions with given stationary distributions and their discretizations
• Langevin-type models II: Self-targeting candidates for MCMC algorithms
• An introduction to variational methods for graphical models
• On the stability of some controlled Markov chains and its applications to stochastic approximation with Markovian dynamic
• The rate of convergence for approximate Bayesian computation
• New insights into approximate Bayesian computation
• On the efficiency of pseudo-marginal random walk Metropolis algorithms
• Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
• Optimal scaling for the transient phase of the random walk Metropolis algorithm: the mean-field limit
• Multiprocess parallel antithetic coupling for backward and forward Markov chain Monte Carlo
• Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
• The geometric foundations of Hamiltonian Monte Carlo
• A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms
• An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
• Optimal tuning of the hybrid Monte Carlo algorithm
• The Wang-Landau algorithm reaches the flat histogram criterion in finite time
• Minimising MCMC variance via diffusion limits, with an application to simulated tempering
• Efficient parallelisation of Metropolis-Hastings algorithms using a prefetching approach
• Langevin diffusions and the Metropolis-adjusted Langevin algorithm
• Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
• A primer on disease mapping and ecological regression using \({\mathtt{INLA}}\)
• Scaling analysis of delayed rejection MCMC methods
• Proximal Markov chain Monte Carlo algorithms
• Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels
• Efficient MCMC for climate model parameter estimation: parallel adaptive chains and early rejection
• Likelihood-free estimation of model evidence
• On inference for partially observed nonlinear diffusion models using the Metropolis-Hastings algorithm
• A Generalized Forward-Backward Splitting
• Proximal Splitting Methods in Signal Processing
• Approximate Bayesian Inference for Latent Gaussian models by using Integrated Nested Laplace Approximations
• Learn From Thy Neighbor: Parallel-Chain and Regional Adaptive MCMC
• Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
• Optimum Monte-Carlo sampling using Markov chains
• Exact and Computationally Efficient Likelihood-Based Estimation for Discretely Observed Diffusion Processes (with Discussion)
• Sequential Monte Carlo Samplers
• Adaptive sampling for Bayesian variable selection
• A proximal decomposition method for solving convex variational inverse problems
• Markov Chains and Stochastic Stability
• Applications of a Method for the Efficient Computation of Posterior Distributions
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• The implementation of the bayesian paradigm
• The Calculation of Posterior Distributions by Data Augmentation
• Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms

This page was built for publication: Bayesian computation: a summary of the current state, and samples backwards and forwards