{"total":53,"rows":[{"id":"2302.10249","title":"Faster high-accuracy log-concave sampling via algorithmic warm starts","created":"2023-02-20","cited_by_count":45,"area":null},{"id":"2109.13055","title":"Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling","created":"2021-09-27","cited_by_count":44,"area":null},{"id":"2303.03589","title":"Towards a Complete Analysis of Langevin Monte Carlo: Beyond Poincar\\'e Inequality","created":"2023-03-07","cited_by_count":31,"area":null},{"id":"2302.10081","title":"Improved dimension dependence of a proximal algorithm for sampling","created":"2023-02-20","cited_by_count":30,"area":null},{"id":"2109.03839","title":"Sqrt(d) Dimension Dependence of Langevin Monte Carlo","created":"2021-09-08","cited_by_count":25,"area":null},{"id":"2210.08448","title":"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling","created":"2022-10-16","cited_by_count":22,"area":null},{"id":"2302.04763","title":"On Sampling with Approximate Transport Maps","created":"2023-02-09","cited_by_count":21,"area":null},{"id":"2106.05480","title":"Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributions","created":"2021-06-10","cited_by_count":19,"area":null},{"id":"2207.08074","title":"Mean-field Variational Inference via Wasserstein Gradient Flow","created":"2022-07-17","cited_by_count":19,"area":null},{"id":"2105.00887","title":"Mixing Time Guarantees for Unadjusted Hamiltonian Monte Carlo","created":"2021-05-03","cited_by_count":18,"area":null},{"id":"2105.14163","title":"The query complexity of sampling from strongly log-concave distributions in one dimension","created":"2021-05-29","cited_by_count":18,"area":null},{"id":"2304.04724","title":"When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?","created":"2023-04-10","cited_by_count":15,"area":null},{"id":"2210.02482","title":"Fisher information lower bounds for sampling","created":"2022-10-05","cited_by_count":12,"area":null},{"id":"2304.02599","title":"Query lower bounds for log-concave sampling","created":"2023-04-05","cited_by_count":12,"area":null},{"id":"2502.05623","title":"Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality","created":"2025-02-08","cited_by_count":12,"area":null},{"id":"2108.00682","title":"Asymptotic bias of inexact Markov Chain Monte Carlo methods in high dimension","created":"2021-08-02","cited_by_count":11,"area":null},{"id":"2312.08823","title":"Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm","created":"2023-12-14","cited_by_count":11,"area":null},{"id":"2210.07219","title":"Condition-number-independent convergence rate of Riemannian Hamiltonian Monte Carlo with numerical integrators","created":"2022-10-13","cited_by_count":10,"area":null},{"id":"2302.06085","title":"Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler","created":"2023-02-13","cited_by_count":10,"area":null},{"id":"2303.03237","title":"Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation","created":"2023-03-06","cited_by_count":10,"area":null},{"id":"2209.12771","title":"Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps","created":"2022-09-26","cited_by_count":8,"area":null},{"id":"2210.06539","title":"Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants","created":"2022-10-12","cited_by_count":8,"area":null},{"id":"2303.18059","title":"Inferring networks from time series: a neural approach","created":"2023-03-30","cited_by_count":7,"area":null},{"id":"2402.07355","title":"Sampling from the Mean-Field Stationary Distribution","created":"2024-02-12","cited_by_count":7,"area":null},{"id":"2201.08349","title":"Heavy-tailed Sampling via Transformed Unadjusted Langevin Algorithm","created":"2022-01-20","cited_by_count":6,"area":null},{"id":"2209.02001","title":"On free energy barriers in Gaussian priors and failure of cold start MCMC for high-dimensional unimodal distributions","created":"2022-09-05","cited_by_count":6,"area":null},{"id":"2405.16736","title":"A Separation in Heavy-Tailed Sampling: Gaussian vs. Stable Oracles for Proximal Samplers","created":"2024-05-27","cited_by_count":6,"area":null},{"id":"2410.06978","title":"Mixing of the No-U-Turn Sampler and the Geometry of Gaussian Concentration","created":"2024-10-09","cited_by_count":5,"area":null},{"id":"2502.06200","title":"On the query complexity of sampling from non-log-concave distributions","created":"2025-02-10","cited_by_count":5,"area":null},{"id":"2303.00570","title":"Mean-Square Analysis of Discretized It\\^o Diffusions for Heavy-tailed Sampling","created":"2023-03-01","cited_by_count":4,"area":null},{"id":"2305.15988","title":"Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithms","created":"2023-05-25","cited_by_count":4,"area":null},{"id":"2408.13115","title":"Convergence of Unadjusted Langevin in High Dimensions: Delocalization of Bias","created":"2024-08-20","cited_by_count":4,"area":null},{"id":"2404.03867","title":"Dimension-free Relaxation Times of Informed MCMC Samplers on Discrete Spaces","created":"2024-04-05","cited_by_count":3,"area":null},{"id":"2407.12967","title":"R\\'enyi-infinity constrained sampling with $d^3$ membership queries","created":"2024-07-17","cited_by_count":3,"area":null},{"id":"2412.07999","title":"Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regression","created":"2024-12-11","cited_by_count":3,"area":null},{"id":"2502.00550","title":"Active Learning with Bayesian Multi-Fidelity Laplace Neural Operators for Oscillatory Parametric PDEs","created":"2025-02-01","cited_by_count":2,"area":null},{"id":"2602.14342","title":"High-accuracy log-concave sampling with stochastic queries","created":"2026-02-15","cited_by_count":2,"area":null},{"id":"2609.06905","title":"Accelerated High-Accuracy Sampling from a Warm Start via the Proximal Bouncy Particle Sampler","created":"2026-09-07","cited_by_count":2,"area":null},{"id":"2411.15220","title":"Sampling with Adaptive Variance for Multimodal Distributions","created":"2024-11-20","cited_by_count":1,"area":null},{"id":"2505.05301","title":"Operator-Level Quantum Acceleration of Non-Logconcave Sampling","created":"2025-05-08","cited_by_count":1,"area":null},{"id":"2505.15059","title":"Restricted Spectral Gap Decomposition for Simulated Tempering Targeting Mixture Distributions","created":"2025-05-21","cited_by_count":1,"area":null},{"id":"2508.15069","title":"Sampling by averaging: A multiscale approach to score estimation","created":"2025-08-20","cited_by_count":1,"area":null},{"id":"2509.25630","title":"When Langevin Monte Carlo Meets Randomization: New Sampling Algorithms with Non-asymptotic Error Bounds beyond Log-Concavity and Gradient Lipschitzness","created":"2025-09-30","cited_by_count":1,"area":null},{"id":"2605.12461","title":"A proximal gradient algorithm for composite log-concave sampling","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2112.00565","title":"On Mixing Times of Metropolized Algorithm With Optimization Step (MAO) : A New Framework","created":"2021-12-01","cited_by_count":0,"area":null},{"id":"2308.13731","title":"Learning variational autoencoders via MCMC speed measures","created":"2023-08-26","cited_by_count":0,"area":null},{"id":"2405.02783","title":"Linear Noise Approximation Assisted Bayesian Inference on Mechanistic Model of Partially Observed Stochastic Reaction Network","created":"2024-05-05","cited_by_count":0,"area":null},{"id":"2501.17323","title":"Exploring Non-Convex Discrete Energy Landscapes: An Efficient Langevin-Like Sampler with Replica Exchange","created":"2025-01-28","cited_by_count":0,"area":null},{"id":"2503.02983","title":"BLADE: Bayesian Langevin Active Discovery with Replica Exchange for Identification of Complex Systems","created":"2025-03-04","cited_by_count":0,"area":null},{"id":"2511.00708","title":"Polynomial Mixing Times of Simulated Tempering for Mixture Targets by Conductance Decomposition","created":"2025-11-01","cited_by_count":0,"area":null},{"id":"2604.02920","title":"Efficient Logistic Regression with Mixture of Sigmoids","created":"2026-04-03","cited_by_count":0,"area":null},{"id":"2606.03033","title":"Local and Global Contraction Principles for MCMC Mixing","created":"2026-06-02","cited_by_count":0,"area":null},{"id":"2606.14854","title":"Event Generation with Parallel Langevin Sampling and Learned Stein Diagnostics","created":"2026-06-12","cited_by_count":0,"area":null}],"next_cursor":null}