Research map / Learning theory and algorithms / Prediction and decision losses
Rapidly Mixing Multiple-try Metropolis Algorithms for Model Selection Problems
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Optimal Scaling for Locally Balanced Proposals in Discrete Spaces (NeurIPS 2022 · similarity 0.88)
- Asymptotically Optimal Exact Minibatch Metropolis-Hastings (NeurIPS 2020 · similarity 0.87)
- Multi-Marginal Couplings for Metropolis--Hastings (NeurIPS 2026 · similarity 0.85)
- AutoStep: Locally adaptive involutive MCMC (ICML 2025 · similarity 0.84)
- Data Mixture Optimization: A Multi-fidelity Multi-scale Bayesian Framework (NeurIPS 2025 · similarity 0.84)
- Test-time Alignment of Diffusion Models without Reward Over-optimization (ICLR 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.