log-concave sampling

Fast Score-Based Sampling via Log-Concave Reductions COLT 2026 High-Accuracy Log-Concave Sampling with Stochastic Queries COLT 2026 Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel ICLR 2025 Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models ICML 2025 Proximal Interacting Particle Langevin Algorithms UAI 2025 Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers ICLR 2024 Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling COLT 2024 Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk NeurIPS 2024 Provable Posterior Sampling with Denoising Oracles via Tilted Transport NeurIPS 2024 Reverse Transition Kernel: A Flexible Framework to Accelerate Diffusion Inference NeurIPS 2024 Sampling from the Mean-Field Stationary Distribution COLT 2024 Improved dimension dependence of a proximal algorithm for sampling COLT 2023 Improved analysis for a proximal algorithm for sampling COLT 2022 Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling JMLR 2022 Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants NeurIPS 2022 High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm JMLR 2021 Implicit Langevin Algorithms for Sampling From Log-concave Densities JMLR 2021 Structured Logconcave Sampling with a Restricted Gaussian Oracle COLT 2021 Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin Algorithm NeurIPS 2020 Wasserstein Control of Mirror Langevin Monte Carlo COLT 2020 Log-concave sampling: Metropolis-Hastings algorithms are fast JMLR 2019 The Randomized Midpoint Method for Log-Concave Sampling NeurIPS 2019 Log-concave sampling: Metropolis-Hastings algorithms are fast! COLT 2018 Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions COLT 2015