{"total":111,"rows":[{"id":"2202.06386","title":"Improved analysis for a proximal algorithm for sampling","created":"2022-02-13","cited_by_count":73,"area":null},{"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":"2307.02037","title":"Reverse Diffusion Monte Carlo","created":"2023-07-05","cited_by_count":41,"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":"2202.01908","title":"Sampling with Riemannian Hamiltonian Monte Carlo in a Constrained Space","created":"2022-02-03","cited_by_count":28,"area":null},{"id":"2402.10758","title":"Stochastic Localization via Iterative Posterior Sampling","created":"2024-02-16","cited_by_count":28,"area":null},{"id":"2110.04597","title":"A Proximal Algorithm for Sampling from Non-smooth Potentials","created":"2021-10-09","cited_by_count":24,"area":null},{"id":"2202.13975","title":"A Proximal Algorithm for Sampling","created":"2022-02-28","cited_by_count":22,"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":"2305.15349","title":"On the Convergence of Black-Box Variational Inference","created":"2023-05-24","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":"2206.00508","title":"Convergence of Stein Variational Gradient Descent under a Weaker Smoothness Condition","created":"2022-06-01","cited_by_count":16,"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":"2305.19473","title":"Chain of Log-Concave Markov Chains","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2106.04769","title":"Submodular + Concave","created":"2021-06-09","cited_by_count":13,"area":null},{"id":"2202.06891","title":"Counterfactual inference in sequential experiments","created":"2022-02-14","cited_by_count":13,"area":null},{"id":"2410.00858","title":"Entropy contraction of the Gibbs sampler under log-concavity","created":"2024-10-01","cited_by_count":13,"area":null},{"id":"2110.01827","title":"When is the Convergence Time of Langevin Algorithms Dimension Independent? A Composite Optimization Viewpoint","created":"2021-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":"2401.09016","title":"Fast parallel sampling under isoperimetry","created":"2024-01-17","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":"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":"2208.00040","title":"Enhanced gradient-based MCMC in discrete spaces","created":"2022-07-29","cited_by_count":10,"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":"2306.08494","title":"Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited","created":"2023-06-14","cited_by_count":10,"area":null},{"id":"2307.14642","title":"Linear Convergence of Black-Box Variational Inference: Should We Stick the Landing?","created":"2023-07-27","cited_by_count":10,"area":null},{"id":"2310.04006","title":"Accelerating optimization over the space of probability measures","created":"2023-10-06","cited_by_count":10,"area":null},{"id":"2504.08916","title":"Improving the evaluation of samplers on multi-modal targets","created":"2025-04-11","cited_by_count":9,"area":null},{"id":"2108.12107","title":"An Introduction to Hamiltonian Monte Carlo Method for Sampling","created":"2021-08-27","cited_by_count":8,"area":null},{"id":"2111.04089","title":"Sampling from Log-Concave Distributions with Infinity-Distance Guarantees","created":"2021-11-07","cited_by_count":8,"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":"2304.04095","title":"A Simple Proof of the Mixing of Metropolis-Adjusted Langevin Algorithm under Smoothness and Isoperimetry","created":"2023-04-08","cited_by_count":7,"area":null},{"id":"2308.14945","title":"Noise-Free Sampling Algorithms via Regularized Wasserstein Proximals","created":"2023-08-28","cited_by_count":7,"area":null},{"id":"2311.15587","title":"Quantum Langevin Dynamics for Optimization","created":"2023-11-27","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":"2212.13597","title":"Optimal Regularization for a Data Source","created":"2022-12-27","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":"2107.12521","title":"Restricted Boltzmann Machine and Deep Belief Network: Tutorial and Survey","created":"2021-07-26","cited_by_count":5,"area":null},{"id":"2112.03152","title":"Bounding Wasserstein distance with couplings","created":"2021-12-06","cited_by_count":5,"area":null},{"id":"2211.11613","title":"Improving multiple-try Metropolis with local balancing","created":"2022-11-21","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":"2110.11181","title":"Sensing Cox Processes via Posterior Sampling and Positive Bases","created":"2021-10-21","cited_by_count":4,"area":null},{"id":"2206.07528","title":"Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization","created":"2022-06-15","cited_by_count":4,"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":"2303.04622","title":"ELF: Federated Langevin Algorithms with Primal, Dual and Bidirectional Compression","created":"2023-03-08","cited_by_count":4,"area":null},{"id":"2305.05529","title":"Accelerate Langevin Sampling with Birth-Death Process and Exploration Component","created":"2023-05-06","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":"2310.14661","title":"Tractable MCMC for Private Learning with Pure and Gaussian Differential Privacy","created":"2023-10-23","cited_by_count":4,"area":null},{"id":"2401.15645","title":"Ensemble-Based Annealed Importance Sampling","created":"2024-01-28","cited_by_count":4,"area":null},{"id":"2403.09416","title":"Scalability of Metropolis-within-Gibbs schemes for high-dimensional Bayesian models","created":"2024-03-14","cited_by_count":4,"area":null},{"id":"2405.19553","title":"Convergence Bounds for Sequential Monte Carlo on Multimodal Distributions using Soft Decomposition","created":"2024-05-29","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":"2512.24152","title":"Fast Score-Based Sampling via Log-Concave Reductions","created":"2025-12-30","cited_by_count":4,"area":null},{"id":"2208.06672","title":"Finite Sample Complexity of Sequential Monte Carlo Estimators on Multimodal Target Distributions","created":"2022-08-13","cited_by_count":3,"area":null},{"id":"2306.09778","title":"Gradient is All You Need? How Consensus-Based Optimization can be Interpreted as a Stochastic Relaxation of Gradient Descent","created":"2023-06-16","cited_by_count":3,"area":null},{"id":"2311.11934","title":"Estimation of entropy-regularized optimal transport maps between non-compactly supported measures","created":"2023-11-20","cited_by_count":3,"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":"2509.19455","title":"Anchored Langevin Algorithms","created":"2025-09-23","cited_by_count":3,"area":null},{"id":"2311.03242","title":"Approximating Langevin Monte Carlo with ResNet-like Neural Network architectures","created":"2023-11-06","cited_by_count":2,"area":null},{"id":"2401.05716","title":"Kernelized Normalizing Constant Estimation: Bridging Bayesian Quadrature and Bayesian Optimization","created":"2024-01-11","cited_by_count":2,"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":"2102.04279","title":"Constrained Ensemble Langevin Monte Carlo","created":"2021-02-08","cited_by_count":1,"area":null},{"id":"2203.09142","title":"Covid19 Reproduction Number: Credibility Intervals by Blockwise Proximal Monte Carlo Samplers","created":"2022-03-17","cited_by_count":1,"area":null},{"id":"2206.09384","title":"Sampling from Log-Concave Distributions over Polytopes via a Soft-Threshold Dikin Walk","created":"2022-06-19","cited_by_count":1,"area":null},{"id":"2212.02250","title":"Multielement polynomial chaos Kriging-based metamodelling for Bayesian inference of non-smooth systems","created":"2022-12-05","cited_by_count":1,"area":null},{"id":"2402.11736","title":"Monte Carlo with kernel-based Gibbs measures: Guarantees for probabilistic herding","created":"2024-02-18","cited_by_count":1,"area":null},{"id":"2410.08423","title":"A phase transition in sampling from Restricted Boltzmann Machines","created":"2024-10-10","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":"2510.06028","title":"Generalization of Gibbs and Langevin Monte Carlo Algorithms in the Interpolation Regime","created":"2025-10-07","cited_by_count":1,"area":null},{"id":"2601.20888","title":"Latent-IMH: Efficient Bayesian Inference for Inverse Problems with Approximate Operators","created":"2026-01-28","cited_by_count":1,"area":null},{"id":"2603.19633","title":"Alternating Diffusion for Proximal Sampling with Zeroth Order Queries","created":"2026-03-20","cited_by_count":1,"area":null},{"id":"2604.10373","title":"Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD","created":"2026-04-11","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":"2606.27564","title":"Fast-Mixing Markov Chains without Gradients","created":"2026-06-25","cited_by_count":1,"area":null},{"id":"2607.28413","title":"Windowed thinning and query complexity for the bouncy particle and Zigzag samplers","created":"2026-07-30","cited_by_count":1,"area":null},{"id":"2101.06453","title":"An MCMC Method to Sample from Lattice Distributions","created":"2021-01-16","cited_by_count":0,"area":null},{"id":"2102.13068","title":"Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo","created":"2021-02-25","cited_by_count":0,"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":"2205.08098","title":"Can We Do Better Than Random Start? The Power of Data Outsourcing","created":"2022-05-17","cited_by_count":0,"area":null},{"id":"2210.16189","title":"Preferential Subsampling for Stochastic Gradient Langevin Dynamics","created":"2022-10-28","cited_by_count":0,"area":null},{"id":"2302.11971","title":"Efficiently handling constraints with Metropolis-adjusted Langevin algorithm","created":"2023-02-23","cited_by_count":0,"area":null},{"id":"2306.05583","title":"Gibbs-Based Information Criteria and the Over-Parameterized Regime","created":"2023-06-08","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":"2401.13530","title":"Continuous-time Riemannian SGD and SVRG Flows on Wasserstein Probabilistic Space","created":"2024-01-24","cited_by_count":0,"area":null},{"id":"2403.06183","title":"An Improved Analysis of Langevin Algorithms with Prior Diffusion for Non-Log-Concave Sampling","created":"2024-03-10","cited_by_count":0,"area":null},{"id":"2407.04264","title":"Langevin Dynamics: A Unified Perspective on Optimization via Lyapunov Potentials","created":"2024-07-05","cited_by_count":0,"area":null},{"id":"2412.03058","title":"Revisiting Energy-Based Model for Out-of-Distribution Detection","created":"2024-12-04","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":"2506.01685","title":"Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts","created":"2025-06-02","cited_by_count":0,"area":null},{"id":"2508.01392","title":"Quenched large deviations for Monte Carlo integration with Coulomb gases","created":"2025-08-02","cited_by_count":0,"area":null},{"id":"2509.13267","title":"Learning discrete Bayesian networks with hierarchical Dirichlet shrinkage","created":"2025-09-16","cited_by_count":0,"area":null},{"id":"2509.26175","title":"Spectral gap of Metropolis-within-Gibbs under log-concavity","created":"2025-09-30","cited_by_count":0,"area":null}],"next_cursor":"100"}