{"total":47,"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":"2306.08153","title":"(Amplified) Banded Matrix Factorization: A unified approach to private training","created":"2023-06-13","cited_by_count":49,"area":null},{"id":"2207.00160","title":"When Does Differentially Private Learning Not Suffer in High Dimensions?","created":"2022-07-01","cited_by_count":48,"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":"2302.09483","title":"Why Is Public Pretraining Necessary for Private Model Training?","created":"2023-02-19","cited_by_count":37,"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":"2301.00457","title":"ReSQueing Parallel and Private Stochastic Convex Optimization","created":"2023-01-01","cited_by_count":17,"area":null},{"id":"2407.13621","title":"Differential Privacy Mechanisms in Neural Tangent Kernel Regression","created":"2024-07-18","cited_by_count":14,"area":null},{"id":"2207.08347","title":"Private Convex Optimization in General Norms","created":"2022-07-18","cited_by_count":13,"area":null},{"id":"2305.13209","title":"Faster Differentially Private Convex Optimization via Second-Order Methods","created":"2023-05-22","cited_by_count":13,"area":null},{"id":"2403.00278","title":"Shifted Interpolation for Differential Privacy","created":"2024-03-01","cited_by_count":13,"area":null},{"id":"2210.02482","title":"Fisher information lower bounds for sampling","created":"2022-10-05","cited_by_count":12,"area":null},{"id":"2302.09699","title":"Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks","created":"2023-02-20","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":"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":"2305.04912","title":"On User-Level Private Convex Optimization","created":"2023-05-08","cited_by_count":8,"area":null},{"id":"2206.03792","title":"Utilising the CLT Structure in Stochastic Gradient based Sampling : Improved Analysis and Faster Algorithms","created":"2022-06-08","cited_by_count":7,"area":null},{"id":"2408.06395","title":"Fast John Ellipsoid Computation with Differential Privacy Optimization","created":"2024-08-12","cited_by_count":7,"area":null},{"id":"2301.00301","title":"Generalized PTR: User-Friendly Recipes for Data-Adaptive Algorithms with Differential Privacy","created":"2022-12-31","cited_by_count":6,"area":null},{"id":"2305.17558","title":"Provably Fast Finite Particle Variants of SVGD via Virtual Particle Stochastic Approximation","created":"2023-05-27","cited_by_count":6,"area":null},{"id":"2403.03856","title":"Public-data Assisted Private Stochastic Optimization: Power and Limitations","created":"2024-03-06","cited_by_count":6,"area":null},{"id":"2404.02239","title":"Proximal Oracles for Optimization and Sampling","created":"2024-04-02","cited_by_count":6,"area":null},{"id":"2503.10945","title":"Gaussian DP for Reporting Differential Privacy Guarantees in Machine Learning","created":"2025-03-13","cited_by_count":6,"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":"2410.05880","title":"Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization","created":"2024-10-08","cited_by_count":4,"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":"2312.11534","title":"Improved Differentially Private and Lazy Online Convex Optimization","created":"2023-12-15","cited_by_count":3,"area":null},{"id":"2406.03620","title":"Private Online Learning via Lazy Algorithms","created":"2024-06-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":"2510.02983","title":"Oracle-based Uniform Sampling from Convex Bodies","created":"2025-10-03","cited_by_count":3,"area":null},{"id":"2409.19800","title":"Differentially Private Bilevel Optimization","created":"2024-09-29","cited_by_count":2,"area":null},{"id":"2503.21071","title":"Purifying Approximate Differential Privacy with Randomized Post-processing","created":"2025-03-27","cited_by_count":2,"area":null},{"id":"2511.13999","title":"On the Gradient Complexity of Private Optimization with Private Oracles","created":"2025-11-17","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":"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":"2406.02716","title":"Optimal Rates for $O(1)$-Smooth DP-SCO with a Single Epoch and Large Batches","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2406.19040","title":"On Convex Optimization with Semi-Sensitive Features","created":"2024-06-27","cited_by_count":1,"area":null},{"id":"2505.20189","title":"Private Geometric Median in Nearly-Linear Time","created":"2025-05-26","cited_by_count":1,"area":null},{"id":"2506.12994","title":"Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates","created":"2025-06-15","cited_by_count":1,"area":null},{"id":"2311.09200","title":"Are Normalizing Flows the Key to Unlocking the Exponential Mechanism?","created":"2023-11-15","cited_by_count":0,"area":null},{"id":"2406.02156","title":"Almost linear time differentially private release of synthetic graphs","created":"2024-06-04","cited_by_count":0,"area":null},{"id":"2507.05610","title":"On the Inherent Privacy of Zeroth Order Projected Gradient Descent","created":"2025-07-08","cited_by_count":0,"area":null},{"id":"2602.03999","title":"Functional Stochastic Localization","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2609.39497","title":"The Geometry of Randomized Smoothing on Feasible Sets","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.17249","title":"Tight End-to-End Accounting for Differentially Private Synthetic Data","created":"2026-10-12","cited_by_count":0,"area":null},{"id":"2610.19573","title":"On Inherent Privacy of Posterior Sampling: A Unified R\\'enyi-Divergence Framework","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}