{"list":"other","total":51,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"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":"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":"1805.08136","title":"Meta-learning with differentiable closed-form solvers","created":"2018-05-21","cited_by_count":397},{"id":"1502.03492","title":"Gradient-based Hyperparameter Optimization through Reversible Learning","created":"2015-02-11","cited_by_count":360},{"id":"1909.09157","title":"Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAML","created":"2019-09-19","cited_by_count":359},{"id":"1905.11881","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","created":"2019-05-28","cited_by_count":341},{"id":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1905.10018","title":"Momentum-Based Variance Reduction in Non-Convex SGD","created":"2019-05-24","cited_by_count":306},{"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":"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":"2006.03875","title":"Coresets via Bilevel Optimization for Continual Learning and Streaming","created":"2020-06-06","cited_by_count":192},{"id":"1810.10667","title":"Truncated Back-propagation for Bilevel Optimization","created":"2018-10-25","cited_by_count":190},{"id":"2006.16218","title":"On the Iteration Complexity of Hypergradient Computation","created":"2020-06-29","cited_by_count":155},{"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":"2209.08709","title":"BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach","created":"2022-09-19","cited_by_count":105},{"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":"2208.11195","title":"Robustness to Unbounded Smoothness of Generalized SignSGD","created":"2022-08-23","cited_by_count":81},{"id":"2006.04045","title":"A Generic First-Order Algorithmic Framework for Bi-Level Programming Beyond Lower-Level Singleton","created":"2020-06-07","cited_by_count":79},{"id":"2102.04671","title":"A Single-Timescale Method for Stochastic Bilevel Optimization","created":"2021-02-09","cited_by_count":69},{"id":"1702.03999","title":"A First Order Method for Solving Convex Bi-Level Optimization Problems","created":"2017-02-13","cited_by_count":67},{"id":"2110.00455","title":"Towards Gradient-based Bilevel Optimization with Non-convex Followers and Beyond","created":"2021-10-01","cited_by_count":63},{"id":"2111.14580","title":"Amortized Implicit Differentiation for Stochastic Bilevel Optimization","created":"2021-11-29","cited_by_count":63},{"id":"2106.07991","title":"A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization","created":"2021-06-15","cited_by_count":60},{"id":"2305.18471","title":"Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptions","created":"2023-05-29","cited_by_count":57},{"id":"2112.04660","title":"A Fully Single Loop Algorithm for Bilevel Optimization without Hessian Inverse","created":"2021-12-09","cited_by_count":53},{"id":"2309.01753","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","created":"2023-09-04","cited_by_count":51},{"id":"2306.01264","title":"Convex and Non-convex Optimization Under Generalized Smoothness","created":"2023-06-02","cited_by_count":44},{"id":"2302.06570","title":"Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD","created":"2023-02-13","cited_by_count":41},{"id":"2110.12459","title":"Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis","created":"2021-10-24","cited_by_count":39},{"id":"2303.02854","title":"Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization","created":"2023-03-06","cited_by_count":35},{"id":"2105.02266","title":"Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimization","created":"2021-05-05","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":"2208.09900","title":"Provable Adaptivity of Adam under Non-uniform Smoothness","created":"2022-08-21","cited_by_count":30},{"id":"2303.00883","title":"Variance-reduced Clipping for Non-convex Optimization","created":"2023-03-02","cited_by_count":22},{"id":"2205.05040","title":"A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural Networks","created":"2022-05-10","cited_by_count":20},{"id":"2202.03397","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","created":"2022-02-07","cited_by_count":17},{"id":"2203.01123","title":"A Primal-Dual Approach to Bilevel Optimization with Multiple Inner Minima","created":"2022-03-01","cited_by_count":13},{"id":"2302.07155","title":"EPISODE: Episodic Gradient Clipping with Periodic Resampled Corrections for Federated Learning with Heterogeneous Data","created":"2023-02-14","cited_by_count":7}],"next_cursor":null}