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

scientific article; zbMATH DE number 6544525

Language	Label	Description	Also known as
English	Bayesian computation: a summary of the current state, and samples backwards and forwards	scientific article; zbMATH DE number 6544525

Statements

instance of

scholarly article

0 references

title

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

0 references

zbMATH Open document ID

1331.62017

0 references

DOI

10.1007/s11222-015-9574-5

0 references

published in

Statistics and Computing

0 references

publication date

23 February 2016

0 references

full work available at URL

https://arxiv.org/abs/1502.01148

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Bayesian analysis

0 references

MCMC algorithms

0 references

ABC techniques

0 references

optimisation

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

0 references

0 references

0 references

An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems

0 references

Stochastic models for phylogenetic trees on higher-order taxa

0 references

Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels

0 references

Particle Markov Chain Monte Carlo Methods

0 references

On the ergodicity properties of some adaptive MCMC algorithms

0 references

The pseudo-marginal approach for efficient Monte Carlo computations

0 references

On the stability of some controlled Markov chains and its applications to stochastic approximation with Markovian dynamic

0 references

Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms

0 references

Robust adaptive Metropolis algorithm with coerced acceptance rate

0 references

An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift

0 references

On adaptive Markov chain Monte Carlo algorithms

0 references

Q3405563

0 references

Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo

0 references

Q3017807

0 references

The rate of convergence for approximate Bayesian computation

0 references

Expectation Propagation for Likelihood-Free Inference

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Weak convergence of Metropolis algorithms for non-I.I.D. target distributions

0 references

Scaling analysis of multiple-try MCMC methods

0 references

Scaling analysis of delayed rejection MCMC methods

0 references

Q4272783

0 references

Bayesian computation and stochastic systems. With comments and reply.

0 references

Q3214006

0 references

Sequential Monte Carlo methods for Bayesian elliptic inverse problems

0 references

Exact and Computationally Efficient Likelihood-Based Estimation for Discretely Observed Diffusion Processes (with Discussion)

0 references

Optimal tuning of the hybrid Monte Carlo algorithm

0 references

Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions

0 references

A General Metric for Riemannian Manifold Hamiltonian Monte Carlo

0 references

On the ergodicity of the adaptive Metropolis algorithm on unbounded domains

0 references

The geometric foundations of Hamiltonian Monte Carlo

0 references

New insights into approximate Bayesian computation

0 references

Approximate Bayesian Computation: A Nonparametric Perspective

0 references

A comparative review of dimension reduction methods in approximate Bayesian computation

0 references

Nonasymptotic mixing of the MALA algorithm

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

Weak convergence and optimal scaling of random walk Metropolis algorithms

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Reversible Jump, Birth-and-Death and More General Continuous Time Markov Chain Monte Carlo Samplers

0 references

Hierarchical Bayesian Analysis of Changepoint Problems

0 references

An algorithm for total variation minimization and applications

0 references

Computational and statistical tradeoffs via convex relaxation

0 references

The convex geometry of linear inverse problems

0 references

BART: Bayesian additive regression trees

0 references

Inference and Model Choice for Sequentially Ordered Hidden Markov Models

0 references

SMC2: An Efficient Algorithm for Sequential Analysis of State Space Models

0 references

Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms

0 references

A proximal decomposition method for solving convex variational inverse problems

0 references

Proximal Splitting Methods in Signal Processing

0 references

Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators

0 references

Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping

0 references

MCMC methods for functions: modifying old algorithms to make them faster

0 references

Learn From Thy Neighbor: Parallel-Chain and Regional Adaptive MCMC

0 references

Multiprocess parallel antithetic coupling for backward and forward Markov chain Monte Carlo

0 references

A Bayesian Reassessment of Nearest-Neighbor Classification

0 references

Sequential Monte Carlo Samplers

0 references

Bayesian Inference for Non-Gaussian Ornstein–Uhlenbeck Stochastic Volatility Processes

0 references

Geometric bounds for eigenvalues of Markov chains

0 references

Likelihood-free estimation of model evidence

0 references

Q4298912

0 references

A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms

0 references

Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator

0 references

Optimal scaling of random walk Metropolis algorithms with discontinuous target densities

0 references

On-Line Inference for Hidden Markov Models via Particle Filters

0 references

Constructing Summary Statistics for Approximate Bayesian Computation: Semi-Automatic Approximate Bayesian Computation

0 references

Convergence of adaptive and interacting Markov chain Monte Carlo algorithms

0 references

Antithetic coupling of two Gibbs sampler chains.

0 references

Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

0 references

Adaptive Markov Chain Monte Carlo through Regeneration

0 references

Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods

0 references

On Russian roulette estimates for Bayesian inference with doubly-intractable likelihoods

0 references

Reversible jump Markov chain Monte Carlo computation and Bayesian model determination

0 references

Q4307745

0 references

An adaptive Metropolis algorithm

0 references

Geometric Numerical Integration

0 references

Monte Carlo sampling methods using Markov chains and their applications

0 references

The Wang-Landau algorithm reaches the flat histogram criterion in finite time

0 references

An introduction to variational methods for graphical models

0 references

Optimal scaling for the transient phase of the random walk Metropolis algorithm: the mean-field limit

0 references

Optimal scaling for the transient phase of Metropolis Hastings algorithms: the longtime behavior

0 references

Time-reversible diffusions

0 references

Q4004325

0 references

Equi-energy sampler with applications in statistical inference and statistical mechanics

0 references

A Brief Survey of Modern Optimization for Statisticians

0 references

Simulating events of unknown probabilities via reverse time martingales

0 references

Adaptive Gibbs samplers and related MCMC methods

0 references

Q5176528

0 references

Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation

0 references

Convergence and refinement of the Wang-Landau algorithm

0 references

Q3549475

0 references

Q2934079

0 references

Q2919530

0 references

Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions

0 references

Relevant Statistics for Bayesian Model Choice

0 references

An adaptive approach to Langevin MCMC

0 references

Q5618030

0 references

Stability of noisy Metropolis-Hastings

0 references

Rates of convergence of the Hastings and Metropolis algorithms

0 references

Equation of State Calculations by Fast Computing Machines

0 references

Markov Chains and Stochastic Stability

0 references

Robust and Scalable Bayes via a Median of Subset Posterior Measures

0 references

An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants

0 references

Q5728711

0 references

Exponential convergence of Langevin distributions and their discrete approximations

0 references

Applications of a Method for the Efficient Computation of Posterior Distributions

0 references

Bayesian learning for neural networks

0 references

Q3172405

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Adaptive sampling for Bayesian variable selection

0 references

Adaptive total variation image deblurring: a majorization-minimization approach

0 references

Q2756704

0 references

A general framework for the parametrization of hierarchical models

0 references

Proximal Markov chain Monte Carlo algorithms

0 references

Optimum Monte-Carlo sampling using Markov chains

0 references

Q2888008

0 references

Cuts in Bayesian graphical models

0 references

Q5815557

0 references

Speeding Up MCMC by Efficient Data Subsampling

0 references

A Generalized Forward-Backward Splitting

0 references

Q4363930

0 references

A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data

0 references

Optimal Scaling of Discrete Approximations to Langevin Diffusions

0 references

Optimal scaling for various Metropolis-Hastings algorithms.

0 references

General state space Markov chains and MCMC algorithms

0 references

Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms

0 references

Langevin diffusions and Metropolis-Hastings algorithms

0 references

Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms

0 references

Q4865936

0 references

Optimal metropolis algorithms for product measures on the vertices of a hypercube

0 references

Minimising MCMC variance via diffusion limits, with an application to simulated tempering

0 references

On inference for partially observed nonlinear diffusion models using the Metropolis-Hastings algorithm

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Bayesianly justifiable and relevant frequency calculations for the applied statistician

0 references

Q3311717

0 references

Perturbation theory for Markov chains via Wasserstein distance

0 references

Approximate Bayesian Inference for Latent Gaussian models by using Integrated Nested Laplace Approximations

0 references

Fixed-form variational posterior approximation through stochastic linear regression

0 references

Q4358811

0 references

A primer on disease mapping and ecological regression using \({\mathtt{INLA}}\)

0 references

Q4863756

0 references

Optimal scaling for the pseudo-marginal random walk Metropolis: insensitivity to the noise generating mechanism

0 references

On the efficiency of pseudo-marginal random walk Metropolis algorithms

0 references

The implementation of the bayesian paradigm

0 references

Efficient MCMC for climate model parameter estimation: parallel adaptive chains and early rejection

0 references

Bayesian analysis of mixture models with an unknown number of components\,--\,an alternative to reversible jump methods.

0 references

Langevin-type models. I: Diffusions with given stationary distributions and their discretizations

0 references

Langevin-type models II: Self-targeting candidates for MCMC algorithms

0 references

Efficient parallelisation of Metropolis-Hastings algorithms using a prefetching approach

0 references

The Calculation of Posterior Distributions by Data Augmentation

0 references

Q2810765

0 references

A note on Metropolis-Hastings kernels for general state spaces

0 references

Q5290928

0 references

Langevin diffusions and the Metropolis-adjusted Langevin algorithm

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5963784