Metropolis–Hastings via Classification

DOI10.1080/01621459.2022.2060836arXiv2103.04177OpenAlexW3135498638MaRDI QIDQ6144768

Veronika Rockova, Tetsuya Kaji

Publication date: 8 January 2024

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

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

zbMATH Keywords

classificationMetropolis-Hastings algorithmapproximate Bayesian computationlikelihood-free inferencegenerative adversarial networks

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bayesian Synthetic Likelihood
• The pseudo-marginal approach for efficient Monte Carlo computations
• The Correlated Pseudo-Marginal Method
• A comparative review of dimension reduction methods in approximate Bayesian computation
• Bayesian estimation of the discrepancy with misspecified parametric models
• Convergence rates of posterior distributions for non iid observations
• Adapting the ABC distance function
• Likelihood-free inference via classification
• Convergence rates of posterior distributions.
• Convex models, MLE and misspecification
• Weak convergence and empirical processes. With applications to statistics
• Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
• Misspecification in infinite-dimensional Bayesian statistics
• Bayesian inference for irreducible diffusion processes using the pseudo-marginal approach
• On inference for partially observed nonlinear diffusion models using the Metropolis-Hastings algorithm
• A Theory of the Term Structure of Interest Rates
• Density Ratio Estimation in Machine Learning
• Particle Markov Chain Monte Carlo for Efficient Numerical Simulation
• Asymptotic Statistics
• Analyses of Infectious Disease Data from Household Outbreaks by Markov Chain Monte Carlo Methods
• Asymptotic properties of approximate Bayesian computation
• Learning Summary Statistic for Approximate Bayesian Computation via Deep Neural Network
• Componentwise approximate Bayesian computation via Gibbs-like steps
• Robust Approximate Bayesian Inference With Synthetic Likelihood
• Model Misspecification in Approximate Bayesian Computation: Consequences and Diagnostics
• On the convergence of the Metropolis-Hastings Markov chains
• Approximate Bayesian Computation with the Wasserstein Distance
• Approximate Bayesian Computation: A Nonparametric Perspective
• Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
• A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options
• Maximum Likelihood Estimation of Discretely Sampled Diffusions: A Closed-form Approximation Approach
• Relevant Statistics for Bayesian Model Choice

This page was built for publication: Metropolis–Hastings via Classification