Geometric adaptive Monte Carlo in random environment
type: Item
instance of: scholarly article
title: Geometric adaptive Monte Carlo in random environment
zbMATH Open document ID: 1490.65003
author: T. Papamarkou
author: Alexey Lindo
author: Eric B. Ford
published in: Foundations of Data Science
publication date: 2022-01-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1608.07986
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 65C40
Mathematics Subject Classification ID: 65F99
Mathematics Subject Classification ID: 62F15
Mathematics Subject Classification ID: 60J22
Mathematics Subject Classification ID: 60K37
Mathematics Subject Classification ID: 62-08
zbMATH DE Number: 7464705
zbMATH Keywords: non-Markovian processes
zbMATH Keywords: Markov chain Monte Carlo
zbMATH Keywords: random environment
zbMATH Keywords: random measure
zbMATH Keywords: computational complexity
zbMATH Keywords: sampling efficiency
zbMATH Keywords: Bayesian inference
describes a project that uses: ramcmc
describes a project that uses: ForwardDiff
MaRDI profile type: Publication
OpenAlex ID: W3166165895
arXiv ID: 1608.07986
cites work: On the ergodicity properties of some adaptive MCMC algorithms
cites work: Q3017807
cites work: A General Metric for Riemannian Manifold Hamiltonian Monte Carlo
cites work: Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
cites work: Improved bound for complexity of matrix multiplication
cites work: Powers of tensors and fast matrix multiplication
cites work: Practical Markov Chain Monte Carlo
cites work: Methods for Modifying Matrix Factorizations
cites work: Evaluating Derivatives
cites work: On adaptive Metropolis-Hastings methods
cites work: An adaptive Metropolis algorithm
cites work: Computing the nearest correlation matrix--a problem from finance
cites work: Computing a nearest symmetric positive semidefinite matrix
cites work: Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
cites work: Random Measures, Theory and Applications
cites work: Optimization by Simulated Annealing
cites work: Adaptive step size selection for Hessian-based manifold Langevin samplers
cites work: Emulation of higher-order tensors in manifold Monte Carlo methods for Bayesian inverse problems
cites work: Information-geometric Markov chain Monte Carlo methods using diffusions
cites work: Simulated annealing algorithms for continuous global optimization: Convergence conditions
cites work: Bayesian learning for neural networks
cites work: Q5509984
cites work: A comparison of simulated annealing cooling strategies
cites work: Proximal Markov chain Monte Carlo algorithms
cites work: Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
cites work: Optimal Scaling of Discrete Approximations to Langevin Diffusions
cites work: Langevin diffusions and Metropolis-Hastings algorithms
cites work: Exponential convergence of Langevin distributions and their discrete approximations
cites work: On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
cites work: Robust adaptive Metropolis algorithm with coerced acceptance rate
cites work: Modern Error Analysis
cites work: Langevin diffusions and the Metropolis-adjusted Langevin algorithm
DOI: 10.3934/FODS.2021014
Recommended article: Geometrical Monte Carlo method and its modifications
Recommended article: Geometric integrators and the Hamiltonian Monte Carlo method
Recommended article: A framework for adaptive Monte Carlo procedures
Recommended article: Adaptive dimension reduction to accelerate infinite-dimensional geometric Markov chain Monte Carlo
Recommended article: Q5097117
Recommended article: Geodesic Monte Carlo on embedded manifolds
Recommended article: Adaptive schemes for piecewise deterministic Monte Carlo algorithms
Recommended article: A geometric approach to transdimensional markov chain monte carlo
Recommended article: Adaptive Multilevel Monte Carlo for Probabilities
description: scientific article