{"list":"other","total":59,"rows":[{"id":"1703.03400","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","created":"2017-03-09","cited_by_count":4897},{"id":"1606.04080","title":"Matching Networks for One Shot Learning","created":"2016-06-13","cited_by_count":2255},{"id":"1806.09055","title":"DARTS: Differentiable Architecture Search","created":"2018-06-24","cited_by_count":1798},{"id":"1909.05207","title":"Introduction to Online Convex Optimization","created":"2019-09-07","cited_by_count":803},{"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":"1911.02590","title":"Optimizing Millions of Hyperparameters by Implicit Differentiation","created":"2019-11-06","cited_by_count":304},{"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":"1802.02871","title":"Online Learning: A Comprehensive Survey","created":"2018-02-08","cited_by_count":205},{"id":"1810.10667","title":"Truncated Back-propagation for Bilevel Optimization","created":"2018-10-25","cited_by_count":190},{"id":"1307.5449","title":"Non-stationary Stochastic Optimization","created":"2013-07-20","cited_by_count":175},{"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":"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":"1902.08438","title":"Online Meta-Learning","created":"2019-02-22","cited_by_count":137},{"id":"1810.10815","title":"Adaptive Online Learning in Dynamic Environments","created":"2018-10-25","cited_by_count":133},{"id":"1705.06270","title":"A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications","created":"2017-05-17","cited_by_count":129},{"id":"2005.01350","title":"A Finite Time Analysis of Two Time-Scale Actor Critic Methods","created":"2020-05-04","cited_by_count":122},{"id":"1502.07073","title":"Strongly Adaptive Online Learning","created":"2015-02-25","cited_by_count":107},{"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":"1501.06225","title":"Online Optimization : Competing with Dynamic Comparators","created":"2015-01-26","cited_by_count":99},{"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":"2007.03479","title":"Dynamic Regret of Convex and Smooth Functions","created":"2020-07-07","cited_by_count":90},{"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":"2008.12284","title":"learn2learn: A Library for Meta-Learning Research","created":"2020-08-27","cited_by_count":69},{"id":"2102.04671","title":"A Single-Timescale Method for Stochastic Bilevel Optimization","created":"2021-02-09","cited_by_count":69},{"id":"1605.04638","title":"Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient","created":"2016-05-16","cited_by_count":66},{"id":"2205.02215","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","created":"2022-05-04","cited_by_count":60},{"id":"2201.01212","title":"AutoBalance: Optimized Loss Functions for Imbalanced Data","created":"2022-01-04","cited_by_count":49},{"id":"1608.03933","title":"Improved Dynamic Regret for Non-degenerate Functions","created":"2016-08-13","cited_by_count":46},{"id":"2102.03926","title":"Lower Bounds and Accelerated Algorithms for Bilevel Optimization","created":"2021-02-07","cited_by_count":46},{"id":"1712.00578","title":"Tracking the Best Expert in Non-stationary Stochastic Environments","created":"2017-12-02","cited_by_count":35},{"id":"2006.05876","title":"Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions","created":"2020-06-10","cited_by_count":33},{"id":"2106.11396","title":"BiAdam: Fast Adaptive Bilevel Optimization Methods","created":"2021-06-21","cited_by_count":33},{"id":"1903.08110","title":"Online Non-Convex Learning: Following the Perturbed Leader is Optimal","created":"2019-03-19","cited_by_count":32},{"id":"2106.03827","title":"Stateful Strategic Regression","created":"2021-06-07","cited_by_count":32},{"id":"1906.03364","title":"Online Forecasting of Total-Variation-bounded Sequences","created":"2019-06-08","cited_by_count":31},{"id":"2002.02085","title":"Minimizing Dynamic Regret and Adaptive Regret Simultaneously","created":"2020-02-06","cited_by_count":31},{"id":"1901.09109","title":"DADAM: A Consensus-based Distributed Adaptive Gradient Method for Online Optimization","created":"2019-01-25","cited_by_count":30},{"id":"1708.00075","title":"Efficient Regret Minimization in Non-Convex Games","created":"2017-07-31","cited_by_count":28},{"id":"2009.00690","title":"Improved Bilevel Model: Fast and Optimal Algorithm with Theoretical Guarantee","created":"2020-09-01","cited_by_count":28},{"id":"1810.07362","title":"Learning in Non-convex Games with an Optimization Oracle","created":"2018-10-17","cited_by_count":24},{"id":"1904.11681","title":"Adaptive Regret of Convex and Smooth Functions","created":"2019-04-26","cited_by_count":24},{"id":"1910.07927","title":"Dynamic Local Regret for Non-convex Online Forecasting","created":"2019-10-16","cited_by_count":17},{"id":"2003.05334","title":"Online Meta-Critic Learning for Off-Policy Actor-Critic Methods","created":"2020-03-11","cited_by_count":17},{"id":"2010.13514","title":"Delta-STN: Efficient Bilevel Optimization for Neural Networks using Structured Response Jacobians","created":"2020-10-26","cited_by_count":17},{"id":"2010.12033","title":"Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses","created":"2020-10-22","cited_by_count":11},{"id":"1905.12950","title":"Equipping Experts/Bandits with Long-term Memory","created":"2019-05-30","cited_by_count":10},{"id":"2010.08496","title":"Online non-convex optimization with imperfect feedback","created":"2020-10-16","cited_by_count":10},{"id":"1806.01520","title":"On $\\ell_p$-hyperparameter Learning via Bilevel Nonsmooth Optimization","created":"2018-06-05","cited_by_count":9},{"id":"2010.06250","title":"Regret minimization in stochastic non-convex learning via a proximal-gradient approach","created":"2020-10-13","cited_by_count":9},{"id":"2109.05829","title":"Zeroth-order non-convex learning via hierarchical dual averaging","created":"2021-09-13","cited_by_count":6},{"id":"2109.14375","title":"Dynamic Regret Analysis for Online Meta-Learning","created":"2021-09-29","cited_by_count":4}],"next_cursor":null}