{"list":"other","total":52,"rows":[{"id":"1703.03400","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","created":"2017-03-09","cited_by_count":4897},{"id":"1803.02999","title":"On First-Order Meta-Learning Algorithms","created":"2018-03-08","cited_by_count":1018},{"id":"1608.04636","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","created":"2016-08-16","cited_by_count":539},{"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":"1502.03492","title":"Gradient-based Hyperparameter Optimization through Reversible Learning","created":"2015-02-11","cited_by_count":360},{"id":"2005.06392","title":"On the Global Convergence Rates of Softmax Policy Gradient Methods","created":"2020-05-13","cited_by_count":264},{"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":"2003.00307","title":"Loss landscapes and optimization in over-parameterized non-linear systems and neural networks","created":"2020-02-29","cited_by_count":233},{"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":"2101.11517","title":"Investigating Bi-Level Optimization for Learning and Vision from a Unified Perspective: A Survey and Beyond","created":"2021-01-27","cited_by_count":153},{"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":"1308.6594","title":"Mini-batch Stochastic Approximation Methods for Nonconvex Stochastic Composite Optimization","created":"2013-08-29","cited_by_count":143},{"id":"2202.02446","title":"Adversarially Trained Actor Critic for Offline Reinforcement Learning","created":"2022-02-05","cited_by_count":111},{"id":"2102.07367","title":"A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentum","created":"2021-02-15","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":"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":"1411.3803","title":"Stochastic Compositional Gradient Descent: Algorithms for Minimizing Compositions of Expected-Value Functions","created":"2014-11-14","cited_by_count":95},{"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":"2112.12376","title":"Revisiting and Advancing Fast Adversarial Training Through The Lens of Bi-Level Optimization","created":"2021-12-23","cited_by_count":76},{"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":"1602.06661","title":"Error bounds, quadratic growth, and linear convergence of proximal methods","created":"2016-02-22","cited_by_count":60},{"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":"2205.02215","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","created":"2022-05-04","cited_by_count":60},{"id":"1605.00125","title":"Efficiency of minimizing compositions of convex functions and smooth maps","created":"2016-04-30","cited_by_count":59},{"id":"2112.04660","title":"A Fully Single Loop Algorithm for Bilevel Optimization without Hessian Inverse","created":"2021-12-09","cited_by_count":53},{"id":"2301.01716","title":"First-order penalty methods for bilevel optimization","created":"2023-01-04","cited_by_count":41},{"id":"2205.14224","title":"Will Bilevel Optimizers Benefit from Loops","created":"2022-05-27","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":"1911.03432","title":"Penalty Method for Inversion-Free Deep Bilevel Optimization","created":"2019-11-08","cited_by_count":33},{"id":"2206.10870","title":"Decentralized Gossip-Based Stochastic Bilevel Optimization over Communication Networks","created":"2022-06-22","cited_by_count":32},{"id":"2212.14032","title":"On Implicit Bias in Overparameterized Bilevel Optimization","created":"2022-12-28","cited_by_count":30},{"id":"2102.07976","title":"A General Descent Aggregation Framework for Gradient-based Bi-level Optimization","created":"2021-02-16","cited_by_count":28},{"id":"2107.12301","title":"Enhanced Bilevel Optimization via Bregman Distance","created":"2021-07-26","cited_by_count":28},{"id":"2301.09880","title":"Probabilistic Bilevel Coreset Selection","created":"2023-01-24","cited_by_count":27},{"id":"2206.00457","title":"Automatic differentiation of nonsmooth iterative algorithms","created":"2022-05-31","cited_by_count":25},{"id":"2207.04888","title":"Non-Convex Bilevel Games with Critical Point Selection Maps","created":"2022-07-11","cited_by_count":25},{"id":"2206.05670","title":"Decentralized Bilevel Optimization","created":"2022-06-12","cited_by_count":23},{"id":"2106.13781","title":"Tighter Analysis of Alternating Stochastic Gradient Method for Stochastic Nested Problems","created":"2021-06-25","cited_by_count":22},{"id":"2109.09610","title":"Bilevel methods for image reconstruction","created":"2021-09-20","cited_by_count":20},{"id":"1811.01213","title":"Learning to Defend by Learning to Attack","created":"2018-11-03","cited_by_count":17},{"id":"2102.09006","title":"Difference of convex algorithms for bilevel programs with applications in hyperparameter selection","created":"2021-02-17","cited_by_count":17},{"id":"2206.10414","title":"A Single-Timescale Analysis For Stochastic Approximation With Multiple Coupled Sequences","created":"2022-06-21","cited_by_count":17},{"id":"2206.05976","title":"Value Function Based Difference-of-Convex Algorithm for Bilevel Hyperparameter Selection Problems","created":"2022-06-13","cited_by_count":15},{"id":"2110.00604","title":"Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems","created":"2021-10-01","cited_by_count":11},{"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":"2211.07096","title":"Alternating Implicit Projected SGD and Its Efficient Variants for Equality-constrained Bilevel Optimization","created":"2022-11-14","cited_by_count":10}],"next_cursor":null}