{"total":83,"rows":[{"id":"2410.13849","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","created":"2024-10-17","cited_by_count":49,"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":"2406.15244","title":"AdaGrad under Anisotropic Smoothness","created":"2024-06-21","cited_by_count":22,"area":null},{"id":"2310.12474","title":"Enhancing High-Resolution 3D Generation through Pixel-wise Gradient Clipping","created":"2023-10-19","cited_by_count":17,"area":null},{"id":"2506.01913","title":"Generalized Gradient Norm Clipping & Non-Euclidean $(L_0,L_1)$-Smoothness","created":"2025-06-02","cited_by_count":17,"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":"2502.07923","title":"Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness","created":"2025-02-11","cited_by_count":13,"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.14432","title":"Adaptive Gradient Clipping for Robust Federated Learning","created":"2024-05-23","cited_by_count":11,"area":null},{"id":"2603.14315","title":"Enhancing LLM Training via Spectral Clipping","created":"2026-03-15","cited_by_count":10,"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":"2308.14606","title":"On the Tradeoff between Privacy Preservation and Byzantine-Robustness in Decentralized Learning","created":"2023-08-28","cited_by_count":8,"area":null},{"id":"2406.11733","title":"To Clip or not to Clip: the Dynamics of SGD with Gradient Clipping in High-Dimensions","created":"2024-06-17","cited_by_count":7,"area":null},{"id":"2502.04164","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","created":"2025-02-06","cited_by_count":7,"area":null},{"id":"2306.09222","title":"Stochastic Re-weighted Gradient Descent via Distributionally Robust Optimization","created":"2023-06-15","cited_by_count":6,"area":null},{"id":"2404.10995","title":"Clipped SGD Algorithms for Performative Prediction: Tight Bounds for Clipping Bias and Remedies","created":"2024-04-17","cited_by_count":5,"area":null},{"id":"2405.15979","title":"BadGD: A unified data-centric framework to identify gradient descent vulnerabilities","created":"2024-05-24","cited_by_count":5,"area":"safety"},{"id":"2405.17529","title":"Clip Body and Tail Separately: High Probability Guarantees for DPSGD with Heavy Tails","created":"2024-05-27","cited_by_count":5,"area":null},{"id":"2409.03682","title":"A New First-Order Meta-Learning Algorithm with Convergence Guarantees","created":"2024-09-05","cited_by_count":4,"area":null},{"id":"2410.14054","title":"Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization","created":"2024-10-17","cited_by_count":4,"area":null},{"id":"2410.16871","title":"Error Feedback under $(L_0,L_1)$-Smoothness: Normalization and Momentum","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2502.17772","title":"An Improved Privacy and Utility Analysis of Differentially Private SGD with Bounded Domain and Smooth Losses","created":"2025-02-25","cited_by_count":4,"area":null},{"id":"2506.00181","title":"On the Interaction of Batch Noise, Adaptivity, and Compression, under $(L_0,L_1)$-Smoothness: An SDE Approach","created":"2025-05-30","cited_by_count":4,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","cited_by_count":3,"area":null},{"id":"2405.15010","title":"Parameter-free Clipped Gradient Descent Meets Polyak","created":"2024-05-23","cited_by_count":3,"area":null},{"id":"2502.13482","title":"Smoothed Normalization for Efficient Distributed Private Optimization","created":"2025-02-19","cited_by_count":3,"area":null},{"id":"2503.00229","title":"Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster","created":"2025-02-28","cited_by_count":3,"area":null},{"id":"2506.13710","title":"Gradient-Normalized Smoothness for Optimization with Approximate Hessians","created":"2025-06-16","cited_by_count":3,"area":null},{"id":"2410.05733","title":"Private and Communication-Efficient Federated Learning based on Differentially Private Sketches","created":"2024-10-08","cited_by_count":2,"area":null},{"id":"2507.20560","title":"Statistical Inference for Differentially Private Stochastic Gradient Descent","created":"2025-07-28","cited_by_count":2,"area":null},{"id":"2509.25550","title":"Unifying Agent Interaction and World Information for Multi-agent Coordination","created":"2025-09-29","cited_by_count":2,"area":null},{"id":"2602.13413","title":"Why is Normalization Preferred? A Worst-Case Complexity Theory for Stochastically Preconditioned SGD under Heavy-Tailed Noise","created":"2026-02-13","cited_by_count":2,"area":null},{"id":"2603.03226","title":"Adaptive Methods Are Preferable in High Privacy Settings: An SDE Perspective","created":"2026-03-03","cited_by_count":2,"area":null},{"id":"2603.14451","title":"How to find expressible and trainable parameterized quantum circuits?","created":"2026-03-15","cited_by_count":2,"area":null},{"id":"2605.11838","title":"Gradient Clipping Beyond Vector Norms: A Spectral Approach for Matrix-Valued Parameters","created":"2026-05-12","cited_by_count":2,"area":null},{"id":"2308.15250","title":"The Relative Gaussian Mechanism and its Application to Private Gradient Descent","created":"2023-08-29","cited_by_count":1,"area":null},{"id":"2405.05485","title":"Variance Control for Black Box Variational Inference Using The James-Stein Estimator","created":"2024-05-09","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":"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":"2411.06770","title":"Sketched Adaptive Federated Deep Learning: A Sharp Convergence Analysis","created":"2024-11-11","cited_by_count":1,"area":null},{"id":"2505.22703","title":"Private Rate-Constrained Optimization with Applications to Fair Learning","created":"2025-05-28","cited_by_count":1,"area":null},{"id":"2508.06884","title":"Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness","created":"2025-08-09","cited_by_count":1,"area":null},{"id":"2509.13628","title":"Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds","created":"2025-09-17","cited_by_count":1,"area":null},{"id":"2510.01578","title":"Gradient Shaping Beyond Clipping: A Functional Perspective on Update Magnitude Control","created":"2025-10-02","cited_by_count":1,"area":null},{"id":"2510.06141","title":"High-Probability Convergence Guarantees of Decentralized SGD","created":"2025-10-07","cited_by_count":1,"area":null},{"id":"2510.20616","title":"On Optimal Hyperparameters for Differentially Private Deep Transfer Learning","created":"2025-10-23","cited_by_count":1,"area":null},{"id":"2512.21521","title":"First Provable Guarantees for Practical Private FL: Beyond Restrictive Assumptions","created":"2025-12-25","cited_by_count":1,"area":null},{"id":"2606.10559","title":"Deterministic Denominator Design for Localized Tamed Stochastic Gradient Langevin Dynamics","created":"2026-06-09","cited_by_count":1,"area":null},{"id":"2306.06402","title":"A Single-Loop Deep Actor-Critic Algorithm for Constrained Reinforcement Learning with Provable Convergence","created":"2023-06-10","cited_by_count":0,"area":null},{"id":"2402.12828","title":"Tracking the Median of Gradients with a Stochastic Proximal Point Method","created":"2024-02-20","cited_by_count":0,"area":null},{"id":"2406.02838","title":"You Only Accept Samples Once: Fast, Self-Correcting Stochastic Variational Inference","created":"2024-06-05","cited_by_count":0,"area":null},{"id":"2506.12749","title":"Free Privacy Protection for Wireless Federated Learning: Enjoy It or Suffer from It?","created":"2025-06-15","cited_by_count":0,"area":null},{"id":"2506.15181","title":"ImprovDML: Improved Trade-off in Private Byzantine-Resilient Distributed Machine Learning","created":"2025-06-18","cited_by_count":0,"area":null},{"id":"2507.00920","title":"Privacy-Preserving Quantized Federated Learning with Diverse Precision","created":"2025-07-01","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":"2509.08726","title":"Decentralized Stochastic Nonconvex Optimization under the $(L_0,L_1)$-Smoothness","created":"2025-09-10","cited_by_count":0,"area":null},{"id":"2509.09485","title":"Balancing Utility and Privacy: Dynamically Private SGD with Random Projection","created":"2025-09-11","cited_by_count":0,"area":null},{"id":"2511.15983","title":"Descend or Rewind? Stochastic Gradient Descent Unlearning","created":"2025-11-20","cited_by_count":0,"area":"safety"},{"id":"2511.16587","title":"Almost Sure Convergence Analysis of Differentially Private Stochastic Gradient Methods","created":"2025-11-20","cited_by_count":0,"area":null},{"id":"2512.14686","title":"Bias-Variance Trade-off for Clipped Stochastic First-Order Methods: From Bounded Variance to Infinite Mean","created":"2025-12-16","cited_by_count":0,"area":null},{"id":"2601.11864","title":"AGGC: Adaptive Group Gradient Clipping for Stabilizing Large Language Model Training","created":"2026-01-17","cited_by_count":0,"area":null},{"id":"2601.18588","title":"Stability as a Liability:Systematic Breakdown of Linguistic Structure in LLMs","created":"2026-01-26","cited_by_count":0,"area":null},{"id":"2601.19730","title":"Stability and Generalization of Stochastic Nonconvex Optimization under Heavy-Tailed Noise: From Gradient Norm to Goldstein Stationarity","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2602.10820","title":"Adaptive Sampling and Clipping for Private Worst-Case Group Optimization","created":"2026-02-11","cited_by_count":0,"area":null},{"id":"2602.20646","title":"On the Convergence of Stochastic Gradient Descent with Perturbed Forward-Backward Passes","created":"2026-02-24","cited_by_count":0,"area":null},{"id":"2602.22282","title":"Differentially Private Truncation of Unbounded Data via Public Second Moments","created":"2026-02-25","cited_by_count":0,"area":null},{"id":"2603.12512","title":"Byzantine-Robust Optimization under $(L_0, L_1)$-Smoothness","created":"2026-03-12","cited_by_count":0,"area":null},{"id":"2605.00281","title":"High-Probability Convergence in Decentralized Stochastic Optimization with Gradient Tracking","created":"2026-04-30","cited_by_count":0,"area":null},{"id":"2605.05660","title":"From Dual Tracking to Clipping: Provably Faster Distributionally Robust Multi-Objective Optimization","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.11850","title":"Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives","created":"2026-05-12","cited_by_count":0,"area":null},{"id":"2606.04375","title":"When Do Fewer Coordinates Suffice in DP-SGD?","created":"2026-06-03","cited_by_count":0,"area":null},{"id":"2606.04384","title":"Revisiting Privacy Amplification by Subsampling in Selective Release DPSGD","created":"2026-06-03","cited_by_count":0,"area":null},{"id":"2606.13287","title":"Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers","created":"2026-06-11","cited_by_count":0,"area":null},{"id":"2606.28123","title":"Dangerous Liaisons of Convex Learning and Non-Affine Aggregation","created":"2026-06-26","cited_by_count":0,"area":null},{"id":"2608.08422","title":"Population-Level Generative Modeling for Ranking Data","created":"2026-08-09","cited_by_count":0,"area":null},{"id":"2609.12119","title":"Almost Sure Convergence Analysis of Stochastic Gradient Methods with Clipping and Additive Noise","created":"2026-09-10","cited_by_count":0,"area":null},{"id":"2609.23055","title":"Optimizers for Diffusion Models: A Controlled Benchmark","created":"2026-09-19","cited_by_count":0,"area":"diffusion"},{"id":"2609.27658","title":"Private Decentralized Optimization with Noise Reduction and Bias Correction","created":"2026-09-23","cited_by_count":0,"area":null},{"id":"2609.29446","title":"SPADE-DFL: Communication-Efficient Decentralized Federated Learning via Derivative-Free Linearized ADMM","created":"2026-09-24","cited_by_count":0,"area":null},{"id":"2609.29458","title":"Precise Convergence Speed of Clipped SGD","created":"2026-09-24","cited_by_count":0,"area":null},{"id":"2609.32195","title":"High-Probability Guarantees for SGD under $\\beta$-Heavy-Tailed Gradient Noise","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.32962","title":"Clipped or Unclipped? Finite-Sample Trade-offs for Averaged SGD under Heavy-Tailed Noise","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.37787","title":"Adam under Generalized Smoothness with Second-Moment-Type Stochastic Gradients","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}