{"total":17,"rows":[{"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":"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":"2502.02002","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","created":"2025-02-04","cited_by_count":5,"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":"2510.00823","title":"Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization","created":"2025-10-01","cited_by_count":4,"area":null},{"id":"2406.07373","title":"Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization","created":"2024-06-11","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":"2410.07502","title":"Adaptive Batch Size for Privately Finding Second-Order Stationary Points","created":"2024-10-10","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":"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":"2505.20189","title":"Private Geometric Median in Nearly-Linear Time","created":"2025-05-26","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":"2506.08362","title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/7})$ Second-Order Oracle Complexity","created":"2025-06-10","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":"2607.04062","title":"Fast, Parallel, Query-Efficient Binary Classification","created":"2026-07-05","cited_by_count":0,"area":null}],"next_cursor":null}