{"total":49,"rows":[{"id":"2206.07136","title":"Automatic Clipping: Differentially Private Deep Learning Made Easier and Stronger","created":"2022-06-14","cited_by_count":88,"area":null},{"id":"2106.14343","title":"High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails","created":"2021-06-28","cited_by_count":80,"area":null},{"id":"2102.11845","title":"Learning with User-Level Privacy","created":"2021-02-23","cited_by_count":72,"area":null},{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","cited_by_count":45,"area":null},{"id":"2105.01650","title":"Stochastic gradient descent with noise of machine learning type. Part I: Discrete time analysis","created":"2021-05-04","cited_by_count":39,"area":null},{"id":"2102.03198","title":"Bias-Variance Reduced Local SGD for Less Heterogeneous Federated Learning","created":"2021-02-05","cited_by_count":31,"area":null},{"id":"2106.13792","title":"Proxy Convexity: A Unified Framework for the Analysis of Neural Networks Trained by Gradient Descent","created":"2021-06-25","cited_by_count":21,"area":null},{"id":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"area":null},{"id":"2410.16561","title":"Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration","created":"2024-10-21","cited_by_count":18,"area":null},{"id":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","cited_by_count":17,"area":null},{"id":"2206.02398","title":"Interference Management for Over-the-Air Federated Learning in Multi-Cell Wireless Networks","created":"2022-06-06","cited_by_count":15,"area":null},{"id":"2305.15659","title":"How to escape sharp minima with random perturbations","created":"2023-05-25","cited_by_count":13,"area":null},{"id":"2111.14069","title":"Escape saddle points by a simple gradient-descent based algorithm","created":"2021-11-28","cited_by_count":11,"area":null},{"id":"2102.12357","title":"Wirelessly Powered Federated Edge Learning: Optimal Tradeoffs Between Convergence and Power Transfer","created":"2021-02-24","cited_by_count":10,"area":null},{"id":"2107.08461","title":"Differentially Private Bayesian Neural Networks on Accuracy, Privacy and Reliability","created":"2021-07-18","cited_by_count":6,"area":null},{"id":"2110.02954","title":"A Stochastic Newton Algorithm for Distributed Convex Optimization","created":"2021-10-07","cited_by_count":6,"area":null},{"id":"2210.01496","title":"Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients","created":"2022-10-04","cited_by_count":6,"area":null},{"id":"2210.13983","title":"Optimization for Amortized Inverse Problems","created":"2022-10-25","cited_by_count":6,"area":null},{"id":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2508.15185","title":"Integrated Sensing, Communication, and Computation for Over-the-Air Federated Edge Learning","created":"2025-08-21","cited_by_count":5,"area":null},{"id":"2211.14645","title":"Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties","created":"2022-11-26","cited_by_count":4,"area":null},{"id":"2310.14616","title":"Rethinking SIGN Training: Provable Nonconvex Acceleration without First- and Second-Order Gradient Lipschitz","created":"2023-10-23","cited_by_count":4,"area":null},{"id":"2501.15941","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","created":"2025-01-27","cited_by_count":4,"area":null},{"id":"2512.13123","title":"Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences","created":"2025-12-15","cited_by_count":4,"area":null},{"id":"2103.03570","title":"Second-order step-size tuning of SGD for non-convex optimization","created":"2021-03-05","cited_by_count":3,"area":null},{"id":"2301.00631","title":"Stochastic Variable Metric Proximal Gradient with variance reduction for non-convex composite optimization","created":"2023-01-02","cited_by_count":3,"area":null},{"id":"2304.09221","title":"Convergence of stochastic gradient descent under a local Lojasiewicz condition for deep neural networks","created":"2023-04-18","cited_by_count":3,"area":null},{"id":"2510.03167","title":"Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism","created":"2025-10-03","cited_by_count":3,"area":null},{"id":"2102.09893","title":"A Variance Controlled Stochastic Method with Biased Estimation for Faster Non-convex Optimization","created":"2021-02-19","cited_by_count":2,"area":null},{"id":"2201.12691","title":"Coordinate Descent Methods for Fractional Minimization","created":"2022-01-30","cited_by_count":2,"area":null},{"id":"2202.09052","title":"Tackling benign nonconvexity with smoothing and stochastic gradients","created":"2022-02-18","cited_by_count":2,"area":null},{"id":"2209.06300","title":"PINCH: An Adversarial Extraction Attack Framework for Deep Learning Models","created":"2022-09-13","cited_by_count":2,"area":null},{"id":"2101.02397","title":"A Comprehensive Study on Optimization Strategies for Gradient Descent In Deep Learning","created":"2021-01-07","cited_by_count":1,"area":null},{"id":"2104.05613","title":"An Efficient Algorithm for Deep Stochastic Contextual Bandits","created":"2021-04-12","cited_by_count":1,"area":null},{"id":"2105.10090","title":"Escaping Saddle Points with Compressed SGD","created":"2021-05-21","cited_by_count":1,"area":null},{"id":"2110.13144","title":"Faster Perturbed Stochastic Gradient Methods for Finding Local Minima","created":"2021-10-25","cited_by_count":1,"area":null},{"id":"2310.18841","title":"A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees","created":"2023-10-28","cited_by_count":1,"area":null},{"id":"2403.15244","title":"A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness","created":"2024-03-22","cited_by_count":1,"area":null},{"id":"2405.18031","title":"Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks","created":"2024-05-28","cited_by_count":1,"area":null},{"id":"2410.06878","title":"Noise is All You Need: Private Second-Order Convergence of Noisy SGD","created":"2024-10-09","cited_by_count":1,"area":null},{"id":"2604.09437","title":"AdaCubic: An Adaptive Cubic Regularization Optimizer for Deep Learning","created":"2026-04-10","cited_by_count":1,"area":null},{"id":"2101.02625","title":"Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm","created":"2021-01-07","cited_by_count":0,"area":null},{"id":"2103.04413","title":"Escaping Saddle Points with Stochastically Controlled Stochastic Gradient Methods","created":"2021-03-07","cited_by_count":0,"area":null},{"id":"2203.11829","title":"Provable Constrained Stochastic Convex Optimization with XOR-Projected Gradient Descent","created":"2022-03-22","cited_by_count":0,"area":null},{"id":"2205.08098","title":"Can We Do Better Than Random Start? The Power of Data Outsourcing","created":"2022-05-17","cited_by_count":0,"area":null},{"id":"2205.13753","title":"HOUDINI: Escaping from Moderately Constrained Saddles","created":"2022-05-27","cited_by_count":0,"area":null},{"id":"2308.02881","title":"Private Federated Learning with Dynamic Power Control via Non-Coherent Over-the-Air Computation","created":"2023-08-05","cited_by_count":0,"area":null},{"id":"2406.04731","title":"Efficient Continual Finite-Sum Minimization","created":"2024-06-07","cited_by_count":0,"area":null},{"id":"2512.24334","title":"OptiVote: Non-Coherent FSO Over-the-Air Majority Vote for Communication-Efficient Distributed Federated Learning in Space Data Centers","created":"2025-12-30","cited_by_count":0,"area":null}],"next_cursor":null}