{"total":140,"rows":[{"id":"2109.00650","title":"Dash: Semi-Supervised Learning with Dynamic Thresholding","created":"2021-09-01","cited_by_count":148,"area":null},{"id":"2208.09632","title":"Adam Can Converge Without Any Modification On Update Rules","created":"2022-08-20","cited_by_count":114,"area":null},{"id":"2102.12660","title":"Distributionally Robust Federated Averaging","created":"2021-02-25","cited_by_count":104,"area":null},{"id":"2302.05185","title":"On Penalty-based Bilevel Gradient Descent Method","created":"2023-02-10","cited_by_count":87,"area":null},{"id":"2205.07344","title":"Policy Gradient Method For Robust Reinforcement Learning","created":"2022-05-15","cited_by_count":69,"area":null},{"id":"2103.04737","title":"Low-Rank Sinkhorn Factorization","created":"2021-03-08","cited_by_count":67,"area":null},{"id":"2106.01128","title":"Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs","created":"2021-06-02","cited_by_count":61,"area":null},{"id":"2106.08208","title":"SUPER-ADAM: Faster and Universal Framework of Adaptive Gradients","created":"2021-06-15","cited_by_count":40,"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":"2110.12459","title":"Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis","created":"2021-10-24","cited_by_count":39,"area":null},{"id":"2109.11926","title":"Sinkhorn Distributionally Robust Optimization","created":"2021-09-24","cited_by_count":38,"area":null},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36,"area":null},{"id":"2106.11396","title":"BiAdam: Fast Adaptive Bilevel Optimization Methods","created":"2021-06-21","cited_by_count":33,"area":null},{"id":"2208.09900","title":"Provable Adaptivity of Adam under Non-uniform Smoothness","created":"2022-08-21","cited_by_count":30,"area":null},{"id":"2103.01447","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","created":"2021-03-02","cited_by_count":29,"area":null},{"id":"2107.12301","title":"Enhanced Bilevel Optimization via Bregman Distance","created":"2021-07-26","cited_by_count":28,"area":null},{"id":"2112.07221","title":"HET: Scaling out Huge Embedding Model Training via Cache-enabled Distributed Framework","created":"2021-12-14","cited_by_count":28,"area":null},{"id":"2301.09880","title":"Probabilistic Bilevel Coreset Selection","created":"2023-01-24","cited_by_count":27,"area":null},{"id":"2103.11882","title":"Generating Adversarial Computer Programs using Optimized Obfuscations","created":"2021-03-18","cited_by_count":22,"area":null},{"id":"2102.09393","title":"On the Convergence of Step Decay Step-Size for Stochastic Optimization","created":"2021-02-18","cited_by_count":21,"area":null},{"id":"2210.14026","title":"SWIFT: Rapid Decentralized Federated Learning via Wait-Free Model Communication","created":"2022-10-25","cited_by_count":21,"area":null},{"id":"2310.01972","title":"Epidemic Learning: Boosting Decentralized Learning with Randomized Communication","created":"2023-10-03","cited_by_count":21,"area":null},{"id":"2403.14729","title":"Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratch","created":"2024-03-21","cited_by_count":20,"area":null},{"id":"2104.05245","title":"Distributed Learning Systems with First-order Methods","created":"2021-04-12","cited_by_count":17,"area":null},{"id":"2106.12112","title":"Bregman Gradient Policy Optimization","created":"2021-06-23","cited_by_count":17,"area":null},{"id":"2508.04860","title":"Can SGD Handle Heavy-Tailed Noise?","created":"2025-08-06","cited_by_count":17,"area":null},{"id":"2109.12519","title":"AsySQN: Faster Vertical Federated Learning Algorithms with Better Computation Resource Utilization","created":"2021-09-26","cited_by_count":16,"area":null},{"id":"2206.05891","title":"Anchor Sampling for Federated Learning with Partial Client Participation","created":"2022-06-13","cited_by_count":14,"area":null},{"id":"2302.11051","title":"Fusion of Global and Local Knowledge for Personalized Federated Learning","created":"2023-02-21","cited_by_count":14,"area":null},{"id":"2305.15938","title":"First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities","created":"2023-05-25","cited_by_count":14,"area":null},{"id":"2310.18535","title":"Contextual Stochastic Bilevel Optimization","created":"2023-10-27","cited_by_count":14,"area":null},{"id":"2404.01436","title":"Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance","created":"2024-04-01","cited_by_count":14,"area":null},{"id":"2106.16101","title":"AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization","created":"2021-06-30","cited_by_count":13,"area":null},{"id":"2206.03907","title":"A Unified Convergence Theorem for Stochastic Optimization Methods","created":"2022-06-08","cited_by_count":12,"area":null},{"id":"2405.16805","title":"Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization","created":"2024-05-27","cited_by_count":12,"area":null},{"id":"2502.01014","title":"Refining Adaptive Zeroth-Order Optimization at Ease","created":"2025-02-03","cited_by_count":12,"area":null},{"id":"2201.12332","title":"On the Hidden Biases of Policy Mirror Ascent in Continuous Action Spaces","created":"2022-01-28","cited_by_count":11,"area":null},{"id":"2211.13668","title":"Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems","created":"2022-11-24","cited_by_count":11,"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":"2211.07096","title":"Alternating Implicit Projected SGD and Its Efficient Variants for Equality-constrained Bilevel Optimization","created":"2022-11-14","cited_by_count":10,"area":null},{"id":"2403.02967","title":"Non-convex Stochastic Composite Optimization with Polyak Momentum","created":"2024-03-05","cited_by_count":9,"area":null},{"id":"2506.04430","title":"Leveraging Coordinate Momentum in SignSGD and Muon: Memory-Optimized Zero-Order","created":"2025-06-04","cited_by_count":9,"area":null},{"id":"2111.13322","title":"Random-reshuffled SARAH does not need a full gradient computations","created":"2021-11-26","cited_by_count":7,"area":null},{"id":"2203.15797","title":"Convergence of First-Order Methods for Constrained Nonconvex Optimization with Dependent Data","created":"2022-03-29","cited_by_count":7,"area":null},{"id":"2211.01122","title":"Fast Adaptive Federated Bilevel Optimization","created":"2022-11-02","cited_by_count":7,"area":null},{"id":"2306.14522","title":"Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning","created":"2023-06-26","cited_by_count":7,"area":null},{"id":"2405.19440","title":"MGDA Converges under Generalized Smoothness, Provably","created":"2024-05-29","cited_by_count":7,"area":null},{"id":"2406.10148","title":"A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints","created":"2024-06-14","cited_by_count":7,"area":null},{"id":"2506.14460","title":"Zeroth-Order Optimization is Secretly Single-Step Policy Optimization","created":"2025-06-17","cited_by_count":7,"area":null},{"id":"2303.03984","title":"Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization","created":"2023-03-07","cited_by_count":6,"area":null},{"id":"2410.12918","title":"Boosting Asynchronous Decentralized Learning with Model Fragmentation","created":"2024-10-16","cited_by_count":6,"area":null},{"id":"2412.14291","title":"Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes","created":"2024-12-18","cited_by_count":6,"area":null},{"id":"2101.02137","title":"Smoothed functional-based gradient algorithms for off-policy reinforcement learning: A non-asymptotic viewpoint","created":"2021-01-06","cited_by_count":5,"area":null},{"id":"2103.13026","title":"The Gradient Convergence Bound of Federated Multi-Agent Reinforcement Learning with Efficient Communication","created":"2021-03-24","cited_by_count":5,"area":null},{"id":"2110.01490","title":"Risk-Aware Learning for Scalable Voltage Optimization in Distribution Grids","created":"2021-10-04","cited_by_count":5,"area":null},{"id":"2204.00406","title":"A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction","created":"2022-04-01","cited_by_count":5,"area":null},{"id":"2206.00285","title":"Stochastic Gradient Methods with Preconditioned Updates","created":"2022-06-01","cited_by_count":5,"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":"2210.03967","title":"Asymptotically Unbiased Instance-wise Regularized Partial AUC Optimization: Theory and Algorithm","created":"2022-10-08","cited_by_count":5,"area":null},{"id":"2211.07303","title":"Adaptive Federated Minimax Optimization with Lower Complexities","created":"2022-11-14","cited_by_count":5,"area":null},{"id":"2305.05828","title":"A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties","created":"2023-05-10","cited_by_count":5,"area":null},{"id":"2309.11006","title":"STARNet: Sensor Trustworthiness and Anomaly Recognition via Approximated Likelihood Regret for Robust Edge Autonomy","created":"2023-09-20","cited_by_count":5,"area":null},{"id":"2310.01139","title":"Minibatch and Local SGD: Algorithmic Stability and Linear Speedup in Generalization","created":"2023-10-02","cited_by_count":5,"area":null},{"id":"2402.15344","title":"Iteration and Stochastic First-order Oracle Complexities of Stochastic Gradient Descent using Constant and Decaying Learning Rates","created":"2024-02-23","cited_by_count":5,"area":null},{"id":"2406.00502","title":"Non-geodesically-convex optimization in the Wasserstein space","created":"2024-06-01","cited_by_count":5,"area":null},{"id":"2504.07388","title":"Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm","created":"2025-04-10","cited_by_count":5,"area":null},{"id":"2302.12431","title":"Flexible Phase Dynamics for Bio-Plausible Contrastive Learning","created":"2023-02-24","cited_by_count":4,"area":null},{"id":"2310.19059","title":"Escaping Saddle Points in Heterogeneous Federated Learning via Distributed SGD with Communication Compression","created":"2023-10-29","cited_by_count":4,"area":null},{"id":"2312.01047","title":"A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization","created":"2023-12-02","cited_by_count":4,"area":null},{"id":"2401.10989","title":"Provably Scalable Black-Box Variational Inference with Structured Variational Families","created":"2024-01-19","cited_by_count":4,"area":null},{"id":"2405.09106","title":"Minimisation of Polyak-\\L{}ojasewicz Functions Using Random Zeroth-Order Oracles","created":"2024-05-15","cited_by_count":4,"area":null},{"id":"2203.14434","title":"Flexible risk design using bi-directional dispersion","created":"2022-03-28","cited_by_count":3,"area":null},{"id":"2210.05279","title":"Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity","created":"2022-10-11","cited_by_count":3,"area":null},{"id":"2211.11751","title":"Denoising Multi-Similarity Formulation: A Self-paced Curriculum-Driven Approach for Robust Metric Learning","created":"2022-11-19","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":"2312.05993","title":"FastPart: Over-Parameterized Stochastic Gradient Descent for Sparse optimisation on Measures","created":"2023-12-10","cited_by_count":3,"area":null},{"id":"2404.01200","title":"Large-Scale Non-convex Stochastic Constrained Distributionally Robust Optimization","created":"2024-04-01","cited_by_count":3,"area":null},{"id":"2505.02281","title":"Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles","created":"2025-05-04","cited_by_count":3,"area":null},{"id":"2505.07614","title":"Bant: Byzantine Antidote via Trial Function and Trust Scores","created":"2025-05-12","cited_by_count":3,"area":null},{"id":"2510.19163","title":"Natural Gradient VI: Guarantees for Non-Conjugate Models","created":"2025-10-22","cited_by_count":3,"area":null},{"id":"2510.27153","title":"Exploring Landscapes for Better Minima along Valleys","created":"2025-10-31","cited_by_count":3,"area":null},{"id":"2606.04401","title":"TANDEM: Bi-Level Data Mixture Optimization with Twin Networks","created":"2026-06-03","cited_by_count":3,"area":null},{"id":"2211.01883","title":"Faster Adaptive Momentum-Based Federated Methods for Distributed Composition Optimization","created":"2022-11-03","cited_by_count":2,"area":null},{"id":"2310.12969","title":"Demystifying the Myths and Legends of Nonconvex Convergence of SGD","created":"2023-10-19","cited_by_count":2,"area":null},{"id":"2402.06033","title":"An Inexact Halpern Iteration with Application to Distributionally Robust Optimization","created":"2024-02-08","cited_by_count":2,"area":null},{"id":"2409.10470","title":"Online Nonconvex Bilevel Optimization with Bregman Divergences","created":"2024-09-16","cited_by_count":2,"area":null},{"id":"2409.19800","title":"Differentially Private Bilevel Optimization","created":"2024-09-29","cited_by_count":2,"area":null},{"id":"2410.09766","title":"Stability and Sharper Risk Bounds with Convergence Rate $\\tilde{O}(1/n^2)$","created":"2024-10-13","cited_by_count":2,"area":null},{"id":"2502.11033","title":"Convergence of Policy Mirror Descent Beyond Compatible Function Approximation","created":"2025-02-16","cited_by_count":2,"area":null},{"id":"2502.14648","title":"Variance Reduction Methods Do Not Need to Compute Full Gradients: Improved Efficiency through Shuffling","created":"2025-02-20","cited_by_count":2,"area":null},{"id":"2507.06125","title":"Subspace-based Approximate Hessian Method for Zeroth-Order Optimization","created":"2025-07-08","cited_by_count":2,"area":null},{"id":"2510.17503","title":"Stochastic Difference-of-Convex Optimization with Momentum","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2107.04987","title":"Coordinate-wise Control Variates for Deep Policy Gradients","created":"2021-07-11","cited_by_count":1,"area":null},{"id":"2109.14856","title":"Robust High-Dimensional Regression with Coefficient Thresholding and its Application to Imaging Data Analysis","created":"2021-09-30","cited_by_count":1,"area":null},{"id":"2202.06880","title":"Black-Box Generalization: Stability of Zeroth-Order Learning","created":"2022-02-14","cited_by_count":1,"area":null},{"id":"2208.04579","title":"Adaptive Zeroth-Order Optimisation of Nonconvex Composite Objectives","created":"2022-08-09","cited_by_count":1,"area":null},{"id":"2211.04655","title":"Perturbed Iterate SGD for Lipschitz Continuous Loss Functions with Numerical Error and Adaptive Step Sizes","created":"2022-11-09","cited_by_count":1,"area":null},{"id":"2212.12921","title":"Learning k-Level Structured Sparse Neural Networks Using Group Envelope Regularization","created":"2022-12-25","cited_by_count":1,"area":null},{"id":"2307.05384","title":"Stochastic Nested Compositional Bi-level Optimization for Robust Feature Learning","created":"2023-07-11","cited_by_count":1,"area":null},{"id":"2312.15295","title":"AdamL: A fast adaptive gradient method incorporating loss function","created":"2023-12-23","cited_by_count":1,"area":null}],"next_cursor":"100"}