{"total":17,"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":"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":"2403.00278","title":"Shifted Interpolation for Differential Privacy","created":"2024-03-01","cited_by_count":13,"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":"2410.10699","title":"Fast Convergence of $\\Phi$-Divergence Along the Unadjusted Langevin Algorithm and Proximal Sampler","created":"2024-10-14","cited_by_count":11,"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":"2410.01068","title":"Convergent Privacy Loss of Noisy-SGD without Convexity and Smoothness","created":"2024-10-01","cited_by_count":8,"area":null},{"id":"2212.12629","title":"Concentration of the Langevin Algorithm's Stationary Distribution","created":"2022-12-24","cited_by_count":5,"area":null},{"id":"2402.17067","title":"Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $\\Phi$-Mutual Information","created":"2024-02-26","cited_by_count":5,"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":"2411.15220","title":"Sampling with Adaptive Variance for Multimodal Distributions","created":"2024-11-20","cited_by_count":1,"area":null},{"id":"2606.13576","title":"Learning with Simulators: No Regret in a Computationally Bounded World","created":"2026-06-11","cited_by_count":1,"area":null},{"id":"2501.04134","title":"Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity","created":"2025-01-07","cited_by_count":0,"area":null},{"id":"2506.00158","title":"Privacy Amplification in Differentially Private Zeroth-Order Optimization with Hidden States","created":"2025-05-30","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}],"next_cursor":null}