{"list":"other","total":52,"rows":[{"id":"1412.6572","title":"Explaining and Harnessing Adversarial Examples","created":"2014-12-20","cited_by_count":7364},{"id":"1703.03400","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","created":"2017-03-09","cited_by_count":4897},{"id":"1905.11881","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","created":"2019-05-28","cited_by_count":341},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1503.02101","title":"Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition","created":"2015-03-06","cited_by_count":243},{"id":"1802.02246","title":"Approximation Methods for Bilevel Programming","created":"2018-02-06","cited_by_count":236},{"id":"1703.01785","title":"Forward and Reverse Gradient-Based Hyperparameter Optimization","created":"2017-03-06","cited_by_count":234},{"id":"1810.08240","title":"Time-uniform, nonparametric, nonasymptotic confidence sequences","created":"2018-10-18","cited_by_count":229},{"id":"2010.07962","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","created":"2020-10-15","cited_by_count":222},{"id":"1806.01811","title":"AdaGrad stepsizes: Sharp convergence over nonconvex landscapes","created":"2018-06-05","cited_by_count":182},{"id":"1805.08114","title":"On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizes","created":"2018-05-21","cited_by_count":156},{"id":"2007.05170","title":"A Two-Timescale Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic","created":"2020-07-10","cited_by_count":144},{"id":"2002.03305","title":"Momentum Improves Normalized SGD","created":"2020-02-09","cited_by_count":139},{"id":"2102.07367","title":"A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentum","created":"2021-02-15","cited_by_count":106},{"id":"2106.04692","title":"Provably Faster Algorithms for Bilevel Optimization","created":"2021-06-08","cited_by_count":106},{"id":"2301.10945","title":"A Fully First-Order Method for Stochastic Bilevel Optimization","created":"2023-01-26","cited_by_count":100},{"id":"2201.13409","title":"A framework for bilevel optimization that enables stochastic and global variance reduction algorithms","created":"2022-01-31","cited_by_count":99},{"id":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99},{"id":"2010.02519","title":"Improved Analysis of Clipping Algorithms for Non-convex Optimization","created":"2020-10-05","cited_by_count":89},{"id":"2302.05185","title":"On Penalty-based Bilevel Gradient Descent Method","created":"2023-02-10","cited_by_count":87},{"id":"2012.03173","title":"Large-scale Robust Deep AUC Maximization: A New Surrogate Loss and Empirical Studies on Medical Image Classification","created":"2020-12-06","cited_by_count":86},{"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},{"id":"2001.03724","title":"Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problems","created":"2020-01-11","cited_by_count":77},{"id":"2102.04671","title":"A Single-Timescale Method for Stochastic Bilevel Optimization","created":"2021-02-09","cited_by_count":69},{"id":"1908.10831","title":"Stochastic AUC Maximization with Deep Neural Networks","created":"2019-08-28","cited_by_count":61},{"id":"2202.05791","title":"The Power of Adaptivity in SGD: Self-Tuning Step Sizes with Unbounded Gradients and Affine Variance","created":"2022-02-11","cited_by_count":61},{"id":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49},{"id":"2302.14843","title":"High Probability Convergence of Stochastic Gradient Methods","created":"2023-02-28","cited_by_count":49},{"id":"2301.01716","title":"First-order penalty methods for bilevel optimization","created":"2023-01-04","cited_by_count":41},{"id":"2302.06570","title":"Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD","created":"2023-02-13","cited_by_count":41},{"id":"2204.02833","title":"High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize","created":"2022-04-06","cited_by_count":40},{"id":"1810.10207","title":"First-order Convergence Theory for Weakly-Convex-Weakly-Concave Min-max Problems","created":"2018-10-24","cited_by_count":34},{"id":"2105.02266","title":"Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimization","created":"2021-05-05","cited_by_count":33},{"id":"2106.11396","title":"BiAdam: Fast Adaptive Bilevel Optimization Methods","created":"2021-06-21","cited_by_count":33},{"id":"2306.12067","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","created":"2023-06-21","cited_by_count":31},{"id":"2302.08783","title":"SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to Unknown Parameters, Unbounded Gradients and Affine Variance","created":"2023-02-17","cited_by_count":30},{"id":"1912.11940","title":"Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets","created":"2019-12-26","cited_by_count":29},{"id":"2007.13605","title":"Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems","created":"2020-07-27","cited_by_count":26},{"id":"2206.00743","title":"Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization","created":"2022-06-01","cited_by_count":16},{"id":"2208.10451","title":"Minimax AUC Fairness: Efficient Algorithm with Provable Convergence","created":"2022-08-22","cited_by_count":16},{"id":"2401.09587","title":"Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis","created":"2024-01-17","cited_by_count":15},{"id":"2104.14840","title":"Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator","created":"2021-04-30","cited_by_count":13},{"id":"2106.16101","title":"AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization","created":"2021-06-30","cited_by_count":13},{"id":"2206.00260","title":"Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization","created":"2022-06-01","cited_by_count":11},{"id":"2409.19212","title":"An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","created":"2024-09-28","cited_by_count":9},{"id":"2210.17478","title":"TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization","created":"2022-10-31","cited_by_count":8},{"id":"2302.06032","title":"Near-Optimal Non-Convex Stochastic Optimization under Generalized Smoothness","created":"2023-02-13","cited_by_count":7},{"id":"2412.20017","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","created":"2024-12-28","cited_by_count":7},{"id":"2410.05140","title":"Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis","created":"2024-10-07","cited_by_count":5},{"id":"2305.18666","title":"BiSLS/SPS: Auto-tune Step Sizes for Stable Bi-level Optimization","created":"2023-05-30","cited_by_count":4},{"id":"2503.03908","title":"On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness","created":"2025-03-05","cited_by_count":1}],"next_cursor":null}