{"total":111,"rows":[{"id":"2103.01955","title":"The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Games","created":"2021-03-02","cited_by_count":942,"area":null},{"id":"2106.01548","title":"When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentations","created":"2021-06-03","cited_by_count":260,"area":null},{"id":"2106.09524","title":"Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticity","created":"2021-06-17","cited_by_count":110,"area":null},{"id":"2110.08529","title":"Sharpness-Aware Minimization Improves Language Model Generalization","created":"2021-10-16","cited_by_count":108,"area":null},{"id":"2111.10603","title":"Reasonable Effectiveness of Random Weighting: A Litmus Test for Multi-Task Learning","created":"2021-11-20","cited_by_count":101,"area":null},{"id":"2203.11834","title":"Improving Generalization in Federated Learning by Seeking Flat Minima","created":"2022-03-22","cited_by_count":98,"area":null},{"id":"2503.12645","title":"Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimization","created":"2025-03-16","cited_by_count":92,"area":null},{"id":"2206.07085","title":"Understanding the Generalization Benefit of Normalization Layers: Sharpness Reduction","created":"2022-06-14","cited_by_count":86,"area":null},{"id":"2302.12022","title":"DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule","created":"2023-02-08","cited_by_count":85,"area":null},{"id":"2202.00661","title":"When Do Flat Minima Optimizers Work?","created":"2022-02-01","cited_by_count":78,"area":null},{"id":"2201.04122","title":"In Defense of the Unitary Scalarization for Deep Multi-Task Learning","created":"2022-01-11","cited_by_count":67,"area":null},{"id":"2106.10891","title":"Open-set Label Noise Can Improve Robustness Against Inherent Label Noise","created":"2021-06-21","cited_by_count":59,"area":null},{"id":"2204.11326","title":"Beyond the Quadratic Approximation: the Multiscale Structure of Neural Network Loss Landscapes","created":"2022-04-24","cited_by_count":43,"area":null},{"id":"2202.02831","title":"Anticorrelated Noise Injection for Improved Generalization","created":"2022-02-06","cited_by_count":42,"area":null},{"id":"2307.06440","title":"No Train No Gain: Revisiting Efficient Training Algorithms For Transformer-based Language Models","created":"2023-07-12","cited_by_count":41,"area":null},{"id":"2102.13152","title":"Local Stochastic Gradient Descent Ascent: Convergence Analysis and Communication Efficiency","created":"2021-02-25","cited_by_count":40,"area":null},{"id":"2306.04251","title":"Stochastic Collapse: How Gradient Noise Attracts SGD Dynamics Towards Simpler Subnetworks","created":"2023-06-07","cited_by_count":39,"area":null},{"id":"2203.04850","title":"Federated Minimax Optimization: Improved Convergence Analyses and Algorithms","created":"2022-03-09","cited_by_count":37,"area":null},{"id":"2302.08982","title":"(S)GD over Diagonal Linear Networks: Implicit Regularisation, Large Stepsizes and Edge of Stability","created":"2023-02-17","cited_by_count":36,"area":null},{"id":"2303.02749","title":"Revisiting the Noise Model of Stochastic Gradient Descent","created":"2023-03-05","cited_by_count":36,"area":null},{"id":"2103.04564","title":"Discovering Diverse Multi-Agent Strategic Behavior via Reward Randomization","created":"2021-03-08","cited_by_count":35,"area":null},{"id":"2107.11228","title":"Taxonomizing local versus global structure in neural network loss landscapes","created":"2021-07-23","cited_by_count":34,"area":null},{"id":"2206.07505","title":"Revisiting Some Common Practices in Cooperative Multi-Agent Reinforcement Learning","created":"2022-06-15","cited_by_count":32,"area":null},{"id":"2305.15155","title":"Momentum Provably Improves Error Feedback!","created":"2023-05-24","cited_by_count":31,"area":null},{"id":"2306.04815","title":"Catapults in SGD: spikes in the training loss and their impact on generalization through feature learning","created":"2023-06-07","cited_by_count":31,"area":null},{"id":"2206.00730","title":"The Phenomenon of Policy Churn","created":"2022-06-01","cited_by_count":28,"area":null},{"id":"2102.13229","title":"Consistent Sparse Deep Learning: Theory and Computation","created":"2021-02-25","cited_by_count":27,"area":null},{"id":"2106.08315","title":"Decentralized Local Stochastic Extra-Gradient for Variational Inequalities","created":"2021-06-15","cited_by_count":25,"area":null},{"id":"2103.01489","title":"Mind Mappings: Enabling Efficient Algorithm-Accelerator Mapping Space Search","created":"2021-03-02","cited_by_count":24,"area":null},{"id":"2202.04777","title":"Exact Solutions of a Deep Linear Network","created":"2022-02-10","cited_by_count":24,"area":null},{"id":"2209.14105","title":"Exploring the Relationship between Architecture and Adversarially Robust Generalization","created":"2022-09-28","cited_by_count":23,"area":null},{"id":"2107.05074","title":"SGD: The Role of Implicit Regularization, Batch-size and Multiple-epochs","created":"2021-07-11","cited_by_count":22,"area":null},{"id":"2106.11851","title":"Stochastic Polyak Stepsize with a Moving Target","created":"2021-06-22","cited_by_count":19,"area":null},{"id":"2110.11442","title":"Towards Noise-adaptive, Problem-adaptive (Accelerated) Stochastic Gradient Descent","created":"2021-10-21","cited_by_count":16,"area":null},{"id":"2102.02976","title":"Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channels","created":"2021-02-05","cited_by_count":15,"area":null},{"id":"2301.06308","title":"Stability Analysis of Sharpness-Aware Minimization","created":"2023-01-16","cited_by_count":14,"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":"2604.07666","title":"An Imperfect Verifier is Good Enough: Learning with Noisy Rewards","created":"2026-04-09","cited_by_count":13,"area":null},{"id":"2506.23803","title":"SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration","created":"2025-06-30","cited_by_count":12,"area":null},{"id":"2402.03990","title":"Subsampling is not Magic: Why Large Batch Sizes Work for Differentially Private Stochastic Optimisation","created":"2024-02-06","cited_by_count":11,"area":null},{"id":"2104.04874","title":"SGD Implicitly Regularizes Generalization Error","created":"2021-04-10","cited_by_count":10,"area":null},{"id":"2205.15142","title":"Special Properties of Gradient Descent with Large Learning Rates","created":"2022-05-30","cited_by_count":10,"area":null},{"id":"2306.08590","title":"Beyond Implicit Bias: The Insignificance of SGD Noise in Online Learning","created":"2023-06-14","cited_by_count":10,"area":null},{"id":"2402.11173","title":"How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization","created":"2024-02-17","cited_by_count":10,"area":null},{"id":"2109.14213","title":"On the One-sided Convergence of Adam-type Algorithms in Non-convex Non-concave Min-max Optimization","created":"2021-09-29","cited_by_count":9,"area":null},{"id":"2208.07951","title":"On the generalization of learning algorithms that do not converge","created":"2022-08-16","cited_by_count":9,"area":null},{"id":"2209.14501","title":"On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks","created":"2022-09-29","cited_by_count":9,"area":null},{"id":"2302.10181","title":"Exploring the Effect of Multi-step Ascent in Sharpness-Aware Minimization","created":"2023-01-27","cited_by_count":9,"area":null},{"id":"2310.00692","title":"A Theoretical Analysis of Noise Geometry in Stochastic Gradient Descent","created":"2023-10-01","cited_by_count":9,"area":null},{"id":"2106.06085","title":"Problem-solving benefits of down-sampled lexicase selection","created":"2021-06-10","cited_by_count":8,"area":null},{"id":"2107.11774","title":"SGD with a Constant Large Learning Rate Can Converge to Local Maxima","created":"2021-07-25","cited_by_count":8,"area":null},{"id":"2401.07250","title":"Stabilizing Sharpness-aware Minimization Through A Simple Renormalization Strategy","created":"2024-01-14","cited_by_count":8,"area":null},{"id":"2501.12243","title":"FOCUS: First Order Concentrated Updating Scheme","created":"2025-01-21","cited_by_count":8,"area":null},{"id":"2102.06759","title":"Stochastic Gradient Langevin Dynamics with Variance Reduction","created":"2021-02-12","cited_by_count":7,"area":null},{"id":"2304.03216","title":"On the Pareto Front of Multilingual Neural Machine Translation","created":"2023-04-06","cited_by_count":7,"area":null},{"id":"2603.21191","title":"On the Role of Batch Size in Stochastic Conditional Gradient Methods","created":"2026-03-22","cited_by_count":7,"area":null},{"id":"2107.05804","title":"AlterSGD: Finding Flat Minima for Continual Learning by Alternative Training","created":"2021-07-13","cited_by_count":6,"area":null},{"id":"2207.04922","title":"On uniform-in-time diffusion approximation for stochastic gradient descent","created":"2022-07-11","cited_by_count":6,"area":null},{"id":"2302.07851","title":"Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization","created":"2023-02-15","cited_by_count":6,"area":null},{"id":"2401.11600","title":"Understanding the Generalization Benefits of Late Learning Rate Decay","created":"2024-01-21","cited_by_count":6,"area":null},{"id":"2410.22113","title":"Where Do Large Learning Rates Lead Us?","created":"2024-10-29","cited_by_count":6,"area":null},{"id":"2111.04004","title":"Exponential escape efficiency of SGD from sharp minima in non-stationary regime","created":"2021-11-07","cited_by_count":5,"area":null},{"id":"2201.04545","title":"On generalization bounds for deep networks based on loss surface implicit regularization","created":"2022-01-12","cited_by_count":5,"area":null},{"id":"2205.03202","title":"Perseus: A Simple and Optimal High-Order Method for Variational Inequalities","created":"2022-05-06","cited_by_count":5,"area":null},{"id":"2210.06705","title":"From Gradient Flow on Population Loss to Learning with Stochastic Gradient Descent","created":"2022-10-13","cited_by_count":5,"area":null},{"id":"2307.05025","title":"Unleashing the Potential of Regularization Strategies in Learning with Noisy Labels","created":"2023-07-11","cited_by_count":5,"area":null},{"id":"2310.14423","title":"A Quadratic Synchronization Rule for Distributed Deep Learning","created":"2023-10-22","cited_by_count":5,"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":"2505.23737","title":"On the Convergence Analysis of Muon","created":"2025-05-29","cited_by_count":5,"area":null},{"id":"2101.02524","title":"A spin-glass model for the loss surfaces of generative adversarial networks","created":"2021-01-07","cited_by_count":4,"area":null},{"id":"2207.09304","title":"A sharp uniform-in-time error estimate for Stochastic Gradient Langevin Dynamics","created":"2022-07-19","cited_by_count":4,"area":null},{"id":"2311.02394","title":"NeuroEvoBench: Benchmarking Evolutionary Optimizers for Deep Learning Applications","created":"2023-11-04","cited_by_count":4,"area":null},{"id":"2403.13704","title":"Improving the Adaptive Moment Estimation (ADAM) stochastic optimizer through an Implicit-Explicit (IMEX) time-stepping approach","created":"2024-03-20","cited_by_count":4,"area":null},{"id":"2104.08364","title":"Sync-Switch: Hybrid Parameter Synchronization for Distributed Deep Learning","created":"2021-04-16","cited_by_count":3,"area":null},{"id":"2112.01433","title":"Loss Landscape Dependent Self-Adjusting Learning Rates in Decentralized Stochastic Gradient Descent","created":"2021-12-02","cited_by_count":3,"area":null},{"id":"2204.10536","title":"Sharper Utility Bounds for Differentially Private Models","created":"2022-04-22","cited_by_count":3,"area":null},{"id":"2411.10649","title":"Deep Loss Convexification for Learning Iterative Models","created":"2024-11-16","cited_by_count":3,"area":null},{"id":"2503.03625","title":"Deterministic Global Optimization of the Acquisition Function in Bayesian Optimization: To Do or Not To Do?","created":"2025-03-05","cited_by_count":3,"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":"2210.01834","title":"Invariant Aggregator for Defending against Federated Backdoor Attacks","created":"2022-10-04","cited_by_count":2,"area":null},{"id":"2311.08745","title":"Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization","created":"2023-11-15","cited_by_count":2,"area":null},{"id":"2404.19248","title":"Scheduling Weight Transitions for Quantization-Aware Training","created":"2024-04-30","cited_by_count":2,"area":null},{"id":"2408.02839","title":"Mini-batch Estimation for Deep Cox Models: Statistical Foundations and Practical Guidance","created":"2024-08-05","cited_by_count":2,"area":null},{"id":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","cited_by_count":2,"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":"2204.01365","title":"Deep learning, stochastic gradient descent and diffusion maps","created":"2022-04-04","cited_by_count":1,"area":null},{"id":"2311.13169","title":"SiGeo: Sub-One-Shot NAS via Information Theory and Geometry of Loss Landscape","created":"2023-11-22","cited_by_count":1,"area":null},{"id":"2311.15221","title":"The Local Landscape of Phase Retrieval Under Limited Samples","created":"2023-11-26","cited_by_count":1,"area":null},{"id":"2410.15620","title":"Acoustic Model Optimization over Multiple Data Sources: Merging and Valuation","created":"2024-10-21","cited_by_count":1,"area":null},{"id":"2412.17008","title":"Data value estimation on private gradients","created":"2024-12-22","cited_by_count":1,"area":null},{"id":"2505.11638","title":"Accelerating Natural Gradient Descent for PINNs with Randomized Numerical Linear Algebra","created":"2025-05-16","cited_by_count":1,"area":null},{"id":"2510.25480","title":"Gradient-Weight Alignment as a Train-Time Proxy for Generalization in Classification Tasks","created":"2025-10-29","cited_by_count":1,"area":null},{"id":"2511.18611","title":"CycleSL: Server-Client Cyclical Update Driven Scalable Split Learning","created":"2025-11-23","cited_by_count":1,"area":null},{"id":"2603.05960","title":"Omni-Masked Gradient Descent: Memory-Efficient Optimization via Mask Traversal with Improved Convergence","created":"2026-03-06","cited_by_count":1,"area":null},{"id":"2605.18999","title":"Distance-Aware Muon: Adaptive Step Scaling for Normalized Optimization","created":"2026-05-18","cited_by_count":1,"area":null},{"id":"2107.01525","title":"AdaL: Adaptive Gradient Transformation Contributes to Convergences and Generalizations","created":"2021-07-04","cited_by_count":0,"area":null},{"id":"2107.08686","title":"Improved Learning Rates for Stochastic Optimization","created":"2021-07-19","cited_by_count":0,"area":null},{"id":"2112.00174","title":"Adaptive Optimization with Examplewise Gradients","created":"2021-11-30","cited_by_count":0,"area":null},{"id":"2203.03886","title":"Boosting Mask R-CNN Performance for Long, Thin Forensic Traces with Pre-Segmentation and IoU Region Merging","created":"2022-03-08","cited_by_count":0,"area":null},{"id":"2208.05631","title":"Quantized Adaptive Subgradient Algorithms and Their Applications","created":"2022-08-11","cited_by_count":0,"area":null}],"next_cursor":"100"}