Cover Image

Exploring the generalizability of the optimal 0.234 acceptance rate in random-walk Metropolis and parallel tempering algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Aidan, Wang, Liyan, Dou, Tianye, Rosenthal, Jeffrey S.
Format:	Preprint
Published:	2024
Subjects:	Computation
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Scalable couplings for the random walk Metropolis algorithm
by: Papp, Tamás P., et al.
Published: (2022)

A note on diffusive/random-walk behaviour in Metropolis--Hastings algorithms
by: Liu, Yuxin, et al.
Published: (2026)

Convergence rates of Metropolis–Hastings algorithms
by: Austin Brown, et al.
Published: (2024)

Estimating MCMC convergence rates using common random number simulation
by: Sixta, Sabrina, et al.
Published: (2023)

On randomized step sizes in Metropolis-Hastings algorithms
by: Grazzi, Sebastiano, et al.
Published: (2026)

Adaptive Importance Tempering: A flexible approach to improve computational efficiency of Metropolis Coupled Markov Chain Monte Carlo algorithms on binary spaces
by: Valencia-Sanchez, Alexander, et al.
Published: (2026)

On the optimal relaxation rate for the Metropolis algorithm in one dimension
by: Patrón, A., et al.
Published: (2024)

Faster parallel MCMC: Metropolis adjustment is best served warm
by: Robnik, Jakob, et al.
Published: (2026)

The FEM approach to the 2D Poisson equation in 'meshes' optimized with the Metropolis algorithm
by: Kosinska, Ilona Dominika
Published: (2010)

A categorical account of the Metropolis-Hastings algorithm
by: Cornish, Rob, et al.
Published: (2026)

autoMALA: Locally adaptive Metropolis-adjusted Langevin algorithm
by: Biron-Lattes, Miguel, et al.
Published: (2023)

A parallel evolutionary algorithm to optimize dynamic memory managers in embedded systems
by: Risco-Martín, José L., et al.
Published: (2024)

Hipster random walks, random series-parallel graph and random homogeneous systems
by: Chen, Xinxing, et al.
Published: (2025)

Metropolis Monte Carlo sampling: convergence, localization transition and optimality
by: Chepelianskii, Alexei D., et al.
Published: (2022)

Feature splitting parallel algorithm for Dantzig selectors
by: Wu, Xiaofei, et al.
Published: (2025)

Variance bounds and robust tuning for pseudo-marginal Metropolis--Hastings algorithms
by: Sherlock, Chris
Published: (2024)

When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?
by: Chen, Yuansi, et al.
Published: (2023)

Adaptive tempered reversible jump algorithm for Bayesian curve fitting
by: Tian, Zhiyao, et al.
Published: (2024)

Ocean Primary Productivity at OPPWG_0234
by: Karl, David Michael
Published: (2003)

Positive autocorrelation at unit lag for stationary random walk Metropolis-Hastings in ${\mathbb R}^d$
by: Fill, James Allen, et al.
Published: (2026)

Stereographic Multiple-Try Metropolis
by: Wang, Zhihao, et al.
Published: (2025)

Metropolis Sampling
by: Martino, Luca, et al.
Published: (2017)

InDeed: Interpretable image deep decomposition with guaranteed generalizability
by: Wang, Sihan, et al.
Published: (2025)

The random walk of an electrostatic field using parallel infinite charged planes
by: R. Aldana
Published: (2015)

SmokeBench: Evaluating Multimodal Large Language Models for Wildfire Smoke Detection
by: Qi, Tianye, et al.
Published: (2025)

A stochastic algorithm approach for the elephant random walk with applications
by: Zhang, Li-Xin
Published: (2024)

Quantum Metropolis-Hastings algorithm
by: Moussa, Jonathan E.
Published: (2025)

An improvement on the Louvain algorithm using random walks
by: Do, Duy Hieu, et al.
Published: (2024)

A parallel framework for graphical optimal transport
by: Fan, Jiaojiao, et al.
Published: (2024)

Stream parallel skeleton optimization
by: Aldinucci, Marco, et al.
Published: (2024)

ODTFormer: Efficient Obstacle Detection and Tracking with Stereo Cameras Based on Transformer
by: Ding, Tianye, et al.
Published: (2024)

Oceanography at CTD/bottle station IFREMER_0234
by: IFREMER
Published: (2001)

Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
by: Srinivasan, Vishwak, et al.
Published: (2023)

An efficient implementation of parallel simulated annealing algorithm in GPUs
by: Ferreiro, A. M., et al.
Published: (2024)

Large deviations for Independent Metropolis Hastings and Metropolis-adjusted Langevin algorithm
by: Milinanni, Federica, et al.
Published: (2024)

Supervising the search process produces reliable and generalizable information-seeking agents
by: Xiong, Guangzhi, et al.
Published: (2025)

Canonization of a random circulant graph by counting walks
by: Verbitsky, Oleg, et al.
Published: (2023)

A multimodal vision foundation model for generalizable knee pathology
by: Yu, Kang, et al.
Published: (2026)

nnMIL: A generalizable multiple instance learning framework for computational pathology
by: Luo, Xiangde, et al.
Published: (2025)

Accurate and generalizable protein-ligand binding affinity prediction with geometric deep learning
by: Li, Krinos, et al.
Published: (2025)