{"total":48,"rows":[{"id":"2205.13710","title":"Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss","created":"2022-05-27","cited_by_count":61,"area":null},{"id":"2203.00263","title":"Private Convex Optimization via Exponential Mechanism","created":"2022-03-01","cited_by_count":49,"area":null},{"id":"2106.08929","title":"KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint Support","created":"2021-06-16","cited_by_count":37,"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":"2106.03076","title":"A Convergence Theory for SVGD in the Population Limit under Talagrand's Inequality T1","created":"2021-06-06","cited_by_count":21,"area":null},{"id":"2405.01425","title":"In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies","created":"2024-05-02","cited_by_count":19,"area":null},{"id":"2102.03803","title":"Lazy OCO: Online Convex Optimization on a Switching Budget","created":"2021-02-07","cited_by_count":14,"area":null},{"id":"2403.00278","title":"Shifted Interpolation for Differential Privacy","created":"2024-03-01","cited_by_count":13,"area":null},{"id":"2110.03960","title":"Mixability made efficient: Fast online multiclass logistic regression","created":"2021-10-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":"2411.00568","title":"Constrained Sampling with Primal-Dual Langevin Monte Carlo","created":"2024-11-01","cited_by_count":10,"area":null},{"id":"2202.07574","title":"Damped Online Newton Step for Portfolio Selection","created":"2022-02-15","cited_by_count":9,"area":null},{"id":"2205.03246","title":"What Makes A Good Fisherman? Linear Regression under Self-Selection Bias","created":"2022-05-06","cited_by_count":7,"area":null},{"id":"2207.04387","title":"Bregman Proximal Langevin Monte Carlo via Bregman--Moreau Envelopes","created":"2022-07-10","cited_by_count":7,"area":null},{"id":"2405.07839","title":"Constrained Exploration via Reflected Replica Exchange Stochastic Gradient Langevin Dynamics","created":"2024-05-13","cited_by_count":7,"area":null},{"id":"2501.11743","title":"Non-Reversible Langevin Algorithms for Constrained Sampling","created":"2025-01-20","cited_by_count":7,"area":null},{"id":"2205.14192","title":"Constrained Langevin Algorithms with L-mixing External Random Variables","created":"2022-05-27","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":"2512.07150","title":"FlowLPS: Langevin-Proximal Sampling for Flow-based Inverse Problem Solvers","created":"2025-12-08","cited_by_count":6,"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":"2503.19066","title":"Accelerating Langevin Monte Carlo Sampling: A Large Deviations Analysis","created":"2025-03-24","cited_by_count":4,"area":null},{"id":"2103.02740","title":"Contrastive learning of strong-mixing continuous-time stochastic processes","created":"2021-03-03","cited_by_count":3,"area":null},{"id":"2203.10215","title":"Convergence Error Analysis of Reflected Gradient Langevin Dynamics for Globally Optimizing Non-Convex Constrained Problems","created":"2022-03-19","cited_by_count":3,"area":null},{"id":"2204.01585","title":"Differentially Private Sampling from Rashomon Sets, and the Universality of Langevin Diffusion for Convex Optimization","created":"2022-04-04","cited_by_count":3,"area":null},{"id":"2510.02983","title":"Oracle-based Uniform Sampling from Convex Bodies","created":"2025-10-03","cited_by_count":3,"area":null},{"id":"2512.23190","title":"A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization","created":"2025-12-29","cited_by_count":3,"area":null},{"id":"2210.13867","title":"A Dynamical System View of Langevin-Based Non-Convex Sampling","created":"2022-10-25","cited_by_count":2,"area":null},{"id":"2405.15379","title":"Randomized Midpoint Method for Log-Concave Sampling under Constraints","created":"2024-05-24","cited_by_count":2,"area":null},{"id":"2504.19446","title":"Learning High-dimensional Gaussians from Censored Data","created":"2025-04-28","cited_by_count":2,"area":null},{"id":"2506.07816","title":"Accelerating Constrained Sampling: A Large Deviations Approach","created":"2025-06-09","cited_by_count":2,"area":null},{"id":"2605.00723","title":"Decentralized Proximal Stochastic Gradient Langevin Dynamics","created":"2026-05-01","cited_by_count":2,"area":null},{"id":"2605.31413","title":"Improved Guarantees for Langevin Monte Carlo with Average Smoothness","created":"2026-05-29","cited_by_count":2,"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.12338","title":"Manifold Sampling via Entropy Maximization","created":"2026-05-12","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":"2102.13068","title":"Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo","created":"2021-02-25","cited_by_count":0,"area":null},{"id":"2107.04652","title":"The Effects of Invertibility on the Representational Complexity of Encoders in Variational Autoencoders","created":"2021-07-09","cited_by_count":0,"area":null},{"id":"2306.16738","title":"Towards Optimal Randomized Strategies in Adversarial Example Game","created":"2023-06-29","cited_by_count":0,"area":null},{"id":"2410.06397","title":"Provable Accuracy Bounds for Hybrid Dynamical Optimization and Sampling","created":"2024-10-08","cited_by_count":0,"area":null},{"id":"2410.23170","title":"Functional Gradient Flows for Constrained Sampling","created":"2024-10-30","cited_by_count":0,"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":"2512.22153","title":"Sampling with Shielded Langevin Monte Carlo Using Navigation Potentials","created":"2025-12-15","cited_by_count":0,"area":null},{"id":"2602.23341","title":"Mean Estimation from Coarse Data: Characterizations and Efficient Algorithms","created":"2026-02-26","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.01655","title":"MINTS: Minimalist Thompson Sampling","created":"2026-06-01","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":"2608.25706","title":"Fast rates in Bayesian online learning with approximate posteriors","created":"2026-08-26","cited_by_count":0,"area":null}],"next_cursor":null}