{"total":83,"rows":[{"id":"2204.13650","title":"Unlocking High-Accuracy Differentially Private Image Classification through Scale","created":"2022-04-28","cited_by_count":224,"area":null},{"id":"2203.00263","title":"Private Convex Optimization via Exponential Mechanism","created":"2022-03-01","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":"2106.01336","title":"Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Data","created":"2021-06-02","cited_by_count":47,"area":null},{"id":"2106.13756","title":"Private Adaptive Gradient Methods for Convex Optimization","created":"2021-06-25","cited_by_count":46,"area":null},{"id":"2107.05585","title":"Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings","created":"2021-07-12","cited_by_count":45,"area":null},{"id":"2107.11136","title":"High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data","created":"2021-07-23","cited_by_count":42,"area":null},{"id":"2206.00846","title":"Faster Rates of Convergence to Stationary Points in Differentially Private Optimization","created":"2022-06-02","cited_by_count":32,"area":null},{"id":"2106.09779","title":"Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses","created":"2021-06-17","cited_by_count":30,"area":null},{"id":"2310.09639","title":"DPZero: Private Fine-Tuning of Language Models without Backpropagation","created":"2023-10-14","cited_by_count":26,"area":null},{"id":"2106.09481","title":"Stochastic Bias-Reduced Gradient Methods","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2202.11205","title":"Constant matters: Fine-grained Complexity of Differentially Private Continual Observation","created":"2022-02-23","cited_by_count":23,"area":null},{"id":"2206.00363","title":"Bring Your Own Algorithm for Optimal Differentially Private Stochastic Minimax Optimization","created":"2022-06-01","cited_by_count":22,"area":null},{"id":"2103.15352","title":"Private Non-smooth Empirical Risk Minimization and Stochastic Convex Optimization in Subquadratic Steps","created":"2021-03-29","cited_by_count":21,"area":null},{"id":"2108.02391","title":"Adapting to Function Difficulty and Growth Conditions in Private Optimization","created":"2021-08-05","cited_by_count":20,"area":null},{"id":"2206.10713","title":"Beyond Uniform Lipschitz Condition in Differentially Private Optimization","created":"2022-06-21","cited_by_count":19,"area":null},{"id":"2104.02988","title":"Optimal Algorithms for Differentially Private Stochastic Monotone Variational Inequalities and Saddle-Point Problems","created":"2021-04-07","cited_by_count":17,"area":null},{"id":"2210.13537","title":"Private Online Prediction from Experts: Separations and Faster Rates","created":"2022-10-24","cited_by_count":17,"area":null},{"id":"2301.00457","title":"ReSQueing Parallel and Private Stochastic Convex Optimization","created":"2023-01-01","cited_by_count":17,"area":null},{"id":"2210.08781","title":"Stochastic Differentially Private and Fair Learning","created":"2022-10-17","cited_by_count":16,"area":null},{"id":"2207.08347","title":"Private Convex Optimization in General Norms","created":"2022-07-18","cited_by_count":13,"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":"2302.12909","title":"Differentially Private Algorithms for the Stochastic Saddle Point Problem with Optimal Rates for the Strong Gap","created":"2023-02-24","cited_by_count":12,"area":null},{"id":"2311.03797","title":"User-level Differentially Private Stochastic Convex Optimization: Efficient Algorithms with Optimal Rates","created":"2023-11-07","cited_by_count":12,"area":null},{"id":"2402.17722","title":"Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence","created":"2024-02-27","cited_by_count":11,"area":null},{"id":"2405.13453","title":"A Huber Loss Minimization Approach to Mean Estimation under User-level Differential Privacy","created":"2024-05-22","cited_by_count":11,"area":null},{"id":"2110.11688","title":"Differentially Private Coordinate Descent for Composite Empirical Risk Minimization","created":"2021-10-22","cited_by_count":10,"area":null},{"id":"2302.03884","title":"DIFF2: Differential Private Optimization via Gradient Differences for Nonconvex Distributed Learning","created":"2023-02-08","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":"2310.20579","title":"Initialization Matters: Privacy-Utility Analysis of Overparameterized Neural Networks","created":"2023-10-31","cited_by_count":10,"area":null},{"id":"2402.11173","title":"How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization","created":"2024-02-17","cited_by_count":10,"area":null},{"id":"2301.13273","title":"Near Optimal Private and Robust Linear Regression","created":"2023-01-30","cited_by_count":9,"area":null},{"id":"2201.03204","title":"Differentially Private $\\ell_1$-norm Linear Regression with Heavy-tailed Data","created":"2022-01-10","cited_by_count":8,"area":null},{"id":"2207.08257","title":"Uniform Stability for First-Order Empirical Risk Minimization","created":"2022-07-17","cited_by_count":8,"area":null},{"id":"2303.18047","title":"Differentially Private Stochastic Convex Optimization in (Non)-Euclidean Space Revisited","created":"2023-03-31","cited_by_count":8,"area":null},{"id":"2305.04912","title":"On User-Level Private Convex Optimization","created":"2023-05-08","cited_by_count":8,"area":null},{"id":"2310.19978","title":"Scaling Up Differentially Private LASSO Regularized Logistic Regression via Faster Frank-Wolfe Iterations","created":"2023-10-30","cited_by_count":8,"area":null},{"id":"2407.09690","title":"Private Heterogeneous Federated Learning Without a Trusted Server Revisited: Error-Optimal and Communication-Efficient Algorithms for Convex Losses","created":"2024-07-12","cited_by_count":8,"area":null},{"id":"2204.10376","title":"Differentially Private Learning with Margin Guarantees","created":"2022-04-21","cited_by_count":7,"area":null},{"id":"2403.02912","title":"Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems","created":"2024-03-05","cited_by_count":7,"area":null},{"id":"2406.02789","title":"Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions","created":"2024-06-04","cited_by_count":6,"area":null},{"id":"2406.12406","title":"Fast Rates for Bandit PAC Multiclass Classification","created":"2024-06-18","cited_by_count":6,"area":null},{"id":"2106.07094","title":"On the Convergence of Differentially Private Federated Learning on Non-Lipschitz Objectives, and with Normalized Client Updates","created":"2021-06-13","cited_by_count":5,"area":null},{"id":"2404.01141","title":"SoK: A Review of Differentially Private Linear Models For High-Dimensional Data","created":"2024-04-01","cited_by_count":5,"area":null},{"id":"2207.01560","title":"High-Dimensional Private Empirical Risk Minimization by Greedy Coordinate Descent","created":"2022-07-04","cited_by_count":4,"area":null},{"id":"2310.07367","title":"Improved Analysis of Sparse Linear Regression in Local Differential Privacy Model","created":"2023-10-11","cited_by_count":4,"area":null},{"id":"2311.13447","title":"Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates","created":"2023-11-22","cited_by_count":4,"area":null},{"id":"2410.18391","title":"Faster Algorithms for User-Level Private Stochastic Convex Optimization","created":"2024-10-24","cited_by_count":4,"area":null},{"id":"2511.22270","title":"Towards Understanding Generalization in DP-GD: A Case Study in Training Two-Layer CNNs","created":"2025-11-27","cited_by_count":4,"area":null},{"id":"2105.13637","title":"The Power of Sampling: Dimension-free Risk Bounds in Private ERM","created":"2021-05-28","cited_by_count":3,"area":null},{"id":"2208.06135","title":"Private Domain Adaptation from a Public Source","created":"2022-08-12","cited_by_count":3,"area":null},{"id":"2209.07403","title":"Private Stochastic Optimization With Large Worst-Case Lipschitz Parameter","created":"2022-09-15","cited_by_count":3,"area":null},{"id":"2210.17070","title":"Private optimization in the interpolation regime: faster rates and hardness results","created":"2022-10-31","cited_by_count":3,"area":null},{"id":"2405.17079","title":"Learning with User-Level Local Differential Privacy","created":"2024-05-27","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":"2510.21060","title":"On the Sample Complexity of Differentially Private Policy Optimization","created":"2025-10-24","cited_by_count":3,"area":null},{"id":"2308.08825","title":"Controlling Federated Learning for Covertness","created":"2023-08-17","cited_by_count":2,"area":null},{"id":"2404.10881","title":"Differentially Private Optimization with Sparse Gradients","created":"2024-04-16","cited_by_count":2,"area":null},{"id":"2410.07502","title":"Adaptive Batch Size for Privately Finding Second-Order Stationary Points","created":"2024-10-10","cited_by_count":2,"area":null},{"id":"2411.05198","title":"Private Algorithms for Stochastic Saddle Points and Variational Inequalities: Beyond Euclidean Geometry","created":"2024-11-07","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":"2206.08111","title":"On Private Online Convex Optimization: Optimal Algorithms in $\\ell_p$-Geometry and High Dimensional Contextual Bandits","created":"2022-06-16","cited_by_count":1,"area":null},{"id":"2211.01758","title":"Optimal Algorithms for Stochastic Complementary Composite Minimization","created":"2022-11-03","cited_by_count":1,"area":null},{"id":"2305.15723","title":"Learning across Data Owners with Joint Differential Privacy","created":"2023-05-25","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":"2408.09891","title":"Differential Private Stochastic Optimization with Heavy-tailed Data: Towards Optimal Rates","created":"2024-08-19","cited_by_count":1,"area":null},{"id":"2409.19092","title":"Federated Online Prediction from Experts with Differential Privacy: Separations and Regret Speed-ups","created":"2024-09-27","cited_by_count":1,"area":null},{"id":"2501.03222","title":"Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization","created":"2025-01-06","cited_by_count":1,"area":null},{"id":"2502.14309","title":"On Theoretical Limits of Learning with Label Differential Privacy","created":"2025-02-20","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":"2512.04008","title":"Efficient Public Verification of Private ML via Regularization","created":"2025-12-03","cited_by_count":1,"area":null},{"id":"2605.24879","title":"Efficient DP-SGD for LLMs with Randomized Clipping","created":"2026-05-24","cited_by_count":1,"area":null},{"id":"2607.00876","title":"The Binary Tree Mechanism is Optimal for Differentially Private Continual Counting","created":"2026-07-01","cited_by_count":1,"area":null},{"id":"2206.13011","title":"Efficient Private SCO for Heavy-Tailed Data via Averaged Clipping","created":"2022-06-27","cited_by_count":0,"area":null},{"id":"2402.19016","title":"SPriFed-OMP: A Differentially Private Federated Learning Algorithm for Sparse Basis Recovery","created":"2024-02-29","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":"2508.15141","title":"Towards Reliable and Generalizable Differentially Private Machine Learning (Extended Version)","created":"2025-08-21","cited_by_count":0,"area":null},{"id":"2602.03999","title":"Functional Stochastic Localization","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2602.22936","title":"Generalization Bounds of Stochastic Gradient Descent in Homogeneous Neural Networks","created":"2026-02-26","cited_by_count":0,"area":null},{"id":"2604.06492","title":"Optimal Rates for Pure $\\varepsilon$-Differentially Private Stochastic Convex Optimization with Heavy Tails","created":"2026-04-07","cited_by_count":0,"area":null},{"id":"2606.01527","title":"Near-Optimal Machine Unlearning Utility for Smooth Strongly Convex Losses","created":"2026-06-01","cited_by_count":0,"area":"safety"},{"id":"2606.11431","title":"Mirror Descent Beyond Euclidean Stability: An Exponential Separation in Initialization Sensitivity","created":"2026-06-09","cited_by_count":0,"area":null}],"next_cursor":null}