{"list":"other","total":62,"rows":[{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"2203.00667","title":"Generative Adversarial Networks","created":"2022-03-01","cited_by_count":5627},{"id":"1703.03400","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","created":"2017-03-09","cited_by_count":4897},{"id":"1806.09055","title":"DARTS: Differentiable Architecture Search","created":"2018-06-24","cited_by_count":1798},{"id":"1611.01578","title":"Neural Architecture Search with Reinforcement Learning","created":"2016-11-05","cited_by_count":1499},{"id":"1803.02999","title":"On First-Order Meta-Learning Algorithms","created":"2018-03-08","cited_by_count":1018},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"1909.04630","title":"Meta-Learning with Implicit Gradients","created":"2019-09-10","cited_by_count":525},{"id":"1806.04910","title":"Bilevel Programming for Hyperparameter Optimization and Meta-Learning","created":"2018-06-13","cited_by_count":405},{"id":"1701.07274","title":"Deep Reinforcement Learning: An Overview","created":"2017-01-25","cited_by_count":333},{"id":"1905.10018","title":"Momentum-Based Variance Reduction in Non-Convex SGD","created":"2019-05-24","cited_by_count":306},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1802.02246","title":"Approximation Methods for Bilevel Programming","created":"2018-02-06","cited_by_count":236},{"id":"1602.02355","title":"Hyperparameter optimization with approximate gradient","created":"2016-02-07","cited_by_count":233},{"id":"2010.07962","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","created":"2020-10-15","cited_by_count":222},{"id":"1901.06053","title":"A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networks","created":"2019-01-18","cited_by_count":214},{"id":"2006.16218","title":"On the Iteration Complexity of Hypergradient Computation","created":"2020-06-29","cited_by_count":155},{"id":"1902.08297","title":"Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods","created":"2019-02-21","cited_by_count":148},{"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":"1908.10400","title":"On the Convergence Theory of Gradient-Based Model-Agnostic Meta-Learning Algorithms","created":"2019-08-27","cited_by_count":132},{"id":"1509.09259","title":"Distributionally Robust Logistic Regression","created":"2015-09-30","cited_by_count":126},{"id":"2002.02417","title":"Near-Optimal Algorithms for Minimax Optimization","created":"2020-02-05","cited_by_count":119},{"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":"2209.08709","title":"BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach","created":"2022-09-19","cited_by_count":105},{"id":"2005.10785","title":"Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping","created":"2020-05-21","cited_by_count":104},{"id":"2301.10945","title":"A Fully First-Order Method for Stochastic Bilevel Optimization","created":"2023-01-26","cited_by_count":100},{"id":"2310.01082","title":"Linear attention is (maybe) all you need (to understand transformer optimization)","created":"2023-10-02","cited_by_count":98},{"id":"2302.05185","title":"On Penalty-based Bilevel Gradient Descent Method","created":"2023-02-10","cited_by_count":87},{"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":"2007.14294","title":"A High Probability Analysis of Adaptive SGD with Momentum","created":"2020-07-28","cited_by_count":61},{"id":"2302.00999","title":"High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance","created":"2023-02-02","cited_by_count":61},{"id":"2205.02215","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","created":"2022-05-04","cited_by_count":60},{"id":"1910.01215","title":"ES-MAML: Simple Hessian-Free Meta Learning","created":"2019-09-25","cited_by_count":57},{"id":"2106.10784","title":"iDARTS: Differentiable Architecture Search with Stochastic Implicit Gradients","created":"2021-06-21","cited_by_count":51},{"id":"2410.13849","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","created":"2024-10-17","cited_by_count":49},{"id":"2102.03926","title":"Lower Bounds and Accelerated Algorithms for Bilevel Optimization","created":"2021-02-07","cited_by_count":46},{"id":"2412.19529","title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","created":"2024-12-27","cited_by_count":42},{"id":"2301.00712","title":"On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis","created":"2023-01-02","cited_by_count":39},{"id":"2406.19976","title":"ScaleBiO: Scalable Bilevel Optimization for LLM Data Reweighting","created":"2024-06-28","cited_by_count":37},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36},{"id":"2110.07004","title":"On the Convergence Theory for Hessian-Free Bilevel Algorithms","created":"2021-10-13","cited_by_count":35},{"id":"1907.02707","title":"Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method","created":"2019-07-05","cited_by_count":32},{"id":"2206.10870","title":"Decentralized Gossip-Based Stochastic Bilevel Optimization over Communication Networks","created":"2022-06-22","cited_by_count":32},{"id":"2102.10264","title":"On Proximal Policy Optimization's Heavy-tailed Gradients","created":"2021-02-20","cited_by_count":31},{"id":"2310.01860","title":"High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise","created":"2023-10-03","cited_by_count":24},{"id":"2210.12839","title":"Decentralized Stochastic Bilevel Optimization with Improved per-Iteration Complexity","created":"2022-10-23","cited_by_count":21},{"id":"2302.05437","title":"High Probability Convergence of Clipped-SGD Under Heavy-tailed Noise","created":"2023-02-10","cited_by_count":21},{"id":"2303.12277","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","created":"2023-03-22","cited_by_count":20},{"id":"2202.03684","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","created":"2022-02-08","cited_by_count":19},{"id":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","cited_by_count":17},{"id":"2401.09587","title":"Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis","created":"2024-01-17","cited_by_count":15},{"id":"2206.01095","title":"Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise","created":"2022-06-02","cited_by_count":14},{"id":"2406.01992","title":"Overcoming Lower-Level Constraints in Bilevel Optimization: A Novel Approach with Regularized Gap Functions","created":"2024-06-04","cited_by_count":12},{"id":"2407.17823","title":"Optimal Hessian/Jacobian-Free Nonconvex-PL Bilevel Optimization","created":"2024-07-25","cited_by_count":11},{"id":"2506.11214","title":"Complexity of normalized stochastic first-order methods with momentum under heavy-tailed noise","created":"2025-06-12","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":"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":"2304.12453","title":"Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness","created":"2023-04-24","cited_by_count":4},{"id":"2405.14130","title":"High-probability complexity guarantees for nonconvex minimax problems","created":"2024-05-23","cited_by_count":2}],"next_cursor":null}