{"total":151,"rows":[{"id":"2107.06917","title":"A Field Guide to Federated Optimization","created":"2021-07-14","cited_by_count":315,"area":null},{"id":"2204.13650","title":"Unlocking High-Accuracy Differentially Private Image Classification through Scale","created":"2022-04-28","cited_by_count":224,"area":null},{"id":"2101.04535","title":"Adversary Instantiation: Lower Bounds for Differentially Private Machine Learning","created":"2021-01-11","cited_by_count":199,"area":null},{"id":"2103.00039","title":"Practical and Private (Deep) Learning without Sampling or Shuffling","created":"2021-02-26","cited_by_count":170,"area":null},{"id":"2102.06062","title":"Deep Learning with Label Differential Privacy","created":"2021-02-11","cited_by_count":117,"area":null},{"id":"2201.12328","title":"Toward Training at ImageNet Scale with Differential Privacy","created":"2022-01-28","cited_by_count":87,"area":null},{"id":"2103.01516","title":"Private Stochastic Convex Optimization: Optimal Rates in $\\ell_1$ Geometry","created":"2021-03-02","cited_by_count":83,"area":null},{"id":"2102.05855","title":"Differential Privacy Dynamics of Langevin Diffusion and Noisy Gradient Descent","created":"2021-02-11","cited_by_count":73,"area":null},{"id":"2102.11845","title":"Learning with User-Level Privacy","created":"2021-02-23","cited_by_count":72,"area":null},{"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":"2103.01278","title":"Non-Euclidean Differentially Private Stochastic Convex Optimization: Optimal Rates in Linear Time","created":"2021-03-01","cited_by_count":51,"area":null},{"id":"2203.00263","title":"Private Convex Optimization via Exponential Mechanism","created":"2022-03-01","cited_by_count":49,"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":"2203.05363","title":"Differentially Private Learning Needs Hidden State (Or Much Faster Convergence)","created":"2022-03-10","cited_by_count":48,"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":"2302.10249","title":"Faster high-accuracy log-concave sampling via algorithmic warm starts","created":"2023-02-20","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":"2205.02973","title":"Large Scale Transfer Learning for Differentially Private Image Classification","created":"2022-05-06","cited_by_count":41,"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":"2206.09888","title":"SoteriaFL: A Unified Framework for Private Federated Learning with Communication Compression","created":"2022-06-20","cited_by_count":34,"area":null},{"id":"2102.05274","title":"Stability of SGD: Tightness Analysis and Improved Bounds","created":"2021-02-10","cited_by_count":33,"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":"2103.11003","title":"Differentially private inference via noisy optimization","created":"2021-03-19","cited_by_count":27,"area":null},{"id":"2203.06735","title":"Private Non-Convex Federated Learning Without a Trusted Server","created":"2022-03-13","cited_by_count":26,"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":"2205.13709","title":"DP-PCA: Statistically Optimal and Differentially Private PCA","created":"2022-05-27","cited_by_count":24,"area":null},{"id":"2201.09046","title":"Differentially Private SGDA for Minimax Problems","created":"2022-01-22","cited_by_count":23,"area":null},{"id":"2202.05318","title":"Personalization Improves Privacy-Accuracy Tradeoffs in Federated Learning","created":"2022-02-10","cited_by_count":23,"area":null},{"id":"2101.08925","title":"Differentially Private SGD with Non-Smooth Losses","created":"2021-01-22","cited_by_count":22,"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":"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":"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":"2111.12050","title":"Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning","created":"2021-11-23","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":"2106.09805","title":"Shuffle Private Stochastic Convex Optimization","created":"2021-06-17","cited_by_count":17,"area":null},{"id":"2205.03014","title":"Differentially Private Generalized Linear Models Revisited","created":"2022-05-06","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":"2102.02167","title":"Algorithmic Instabilities of Accelerated Gradient Descent","created":"2021-02-03","cited_by_count":16,"area":null},{"id":"2209.08005","title":"Stability and Generalization for Markov Chain Stochastic Gradient Methods","created":"2022-09-16","cited_by_count":14,"area":null},{"id":"2311.14632","title":"Differentially Private SGD Without Clipping Bias: An Error-Feedback Approach","created":"2023-11-24","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":"2404.09816","title":"FedP3: Federated Personalized and Privacy-friendly Network Pruning under Model Heterogeneity","created":"2024-04-15","cited_by_count":13,"area":null},{"id":"2108.00331","title":"Faster Rates of Private Stochastic Convex Optimization","created":"2021-07-31","cited_by_count":12,"area":null},{"id":"2205.09494","title":"Differentially private Riemannian optimization","created":"2022-05-19","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":"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":"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":"2202.11199","title":"Differentially Private Regression with Unbounded Covariates","created":"2022-02-19","cited_by_count":10,"area":null},{"id":"2210.06328","title":"Momentum Aggregation for Private Non-convex ERM","created":"2022-10-12","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":"2305.09903","title":"Privacy Loss of Noisy Stochastic Gradient Descent Might Converge Even for Non-Convex Losses","created":"2023-05-17","cited_by_count":10,"area":null},{"id":"2310.08425","title":"Differentially Private Non-convex Learning for Multi-layer Neural Networks","created":"2023-10-12","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":"2206.01836","title":"Dimension Independent Generalization of DP-SGD for Overparameterized Smooth Convex Optimization","created":"2022-06-03","cited_by_count":9,"area":null},{"id":"2301.13273","title":"Near Optimal Private and Robust Linear Regression","created":"2023-01-30","cited_by_count":9,"area":null},{"id":"2302.14154","title":"Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime","created":"2023-02-27","cited_by_count":9,"area":null},{"id":"2305.09896","title":"Convergence and Privacy of Decentralized Nonconvex Optimization with Gradient Clipping and Communication Compression","created":"2023-05-17","cited_by_count":9,"area":null},{"id":"2402.19437","title":"Differentially Private Worst-group Risk Minimization","created":"2024-02-29","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":"2405.08920","title":"Neural Collapse Meets Differential Privacy: Curious Behaviors of NoisyGD with Near-perfect Representation Learning","created":"2024-05-14","cited_by_count":8,"area":null},{"id":"2406.19579","title":"Private Zeroth-Order Nonsmooth Nonconvex Optimization","created":"2024-06-27","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":"2306.08173","title":"Safeguarding Data in Multimodal AI: A Differentially Private Approach to CLIP Training","created":"2023-06-13","cited_by_count":7,"area":null},{"id":"2207.04686","title":"(Nearly) Optimal Private Linear Regression via Adaptive Clipping","created":"2022-07-11","cited_by_count":6,"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":"2407.05237","title":"Privacy of the last iterate in cyclically-sampled DP-SGD on nonconvex composite losses","created":"2024-07-07","cited_by_count":6,"area":null},{"id":"2101.07413","title":"Dynamic Privacy Budget Allocation Improves Data Efficiency of Differentially Private Gradient Descent","created":"2021-01-19","cited_by_count":5,"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":"2110.07435","title":"Adaptive Differentially Private Empirical Risk Minimization","created":"2021-10-14","cited_by_count":5,"area":null},{"id":"2210.06593","title":"Differentially Private Online-to-Batch for Smooth Losses","created":"2022-10-12","cited_by_count":5,"area":null},{"id":"2102.05134","title":"Local and Global Uniform Convexity Conditions","created":"2021-02-09","cited_by_count":4,"area":null},{"id":"2206.03008","title":"Algorithms for bounding contribution for histogram estimation under user-level privacy","created":"2022-06-07","cited_by_count":4,"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":"2305.16474","title":"FairDP: Certified Fairness with Differential Privacy","created":"2023-05-25","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":"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":"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.05880","title":"Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization","created":"2024-10-08","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":"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":"2204.10536","title":"Sharper Utility Bounds for Differentially Private Models","created":"2022-04-22","cited_by_count":3,"area":null},{"id":"2206.03834","title":"Boosting the Confidence of Generalization for $L_2$-Stable Randomized Learning Algorithms","created":"2022-06-08","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}],"next_cursor":"100"}