{"total":19,"rows":[{"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":"2302.09483","title":"Why Is Public Pretraining Necessary for Private Model Training?","created":"2023-02-19","cited_by_count":37,"area":null},{"id":"2308.06058","title":"Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction","created":"2023-08-11","cited_by_count":23,"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":"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":"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":"2303.18047","title":"Differentially Private Stochastic Convex Optimization in (Non)-Euclidean Space Revisited","created":"2023-03-31","cited_by_count":8,"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":"2507.01129","title":"On Design Principles for Private Adaptive Optimizers","created":"2025-07-01","cited_by_count":6,"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":"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":"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":"2406.03620","title":"Private Online Learning via Lazy Algorithms","created":"2024-06-05","cited_by_count":3,"area":null},{"id":"2404.10881","title":"Differentially Private Optimization with Sparse Gradients","created":"2024-04-16","cited_by_count":2,"area":null},{"id":"2509.04668","title":"Beyond Ordinary Lipschitz Constraints: Differentially Private Stochastic Optimization with Tsybakov Noise Condition","created":"2025-09-04","cited_by_count":2,"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":"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":"2610.09206","title":"An Accuracy-Information Tradeoff for Loss-Difference Conditional Mutual Information","created":"2026-10-06","cited_by_count":0,"area":null}],"next_cursor":null}