{"list":"other","total":61,"rows":[{"id":"1609.02907","title":"Semi-Supervised Classification with Graph Convolutional Networks","created":"2016-09-09","cited_by_count":11361},{"id":"2203.00667","title":"Generative Adversarial Networks","created":"2022-03-01","cited_by_count":5627},{"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":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1807.01695","title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator","created":"2018-07-04","cited_by_count":287},{"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":"2010.07962","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","created":"2020-10-15","cited_by_count":222},{"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":"1710.11606","title":"Lower Bounds for Finding Stationary Points I","created":"2017-10-31","cited_by_count":126},{"id":"2002.02417","title":"Near-Optimal Algorithms for Minimax Optimization","created":"2020-02-05","cited_by_count":119},{"id":"2008.10898","title":"PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimization","created":"2020-08-25","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":"1903.03088","title":"Self-Tuning Networks: Bilevel Optimization of Hyperparameters using Structured Best-Response Functions","created":"2019-03-07","cited_by_count":105},{"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":"2302.05185","title":"On Penalty-based Bilevel Gradient Descent Method","created":"2023-02-10","cited_by_count":87},{"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":"1808.02901","title":"Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems","created":"2018-08-08","cited_by_count":76},{"id":"1711.10456","title":"Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent","created":"2017-11-28","cited_by_count":66},{"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":"2103.06064","title":"Graph Neural Networks Inspired by Classical Iterative Algorithms","created":"2021-03-10","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":"1711.00841","title":"Lower Bounds for Finding Stationary Points II: First-Order Methods","created":"2017-11-02","cited_by_count":58},{"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":"1605.08003","title":"Tight Complexity Bounds for Optimizing Composite Objectives","created":"2016-05-25","cited_by_count":48},{"id":"1705.02766","title":"\"Convex Until Proven Guilty\": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions","created":"2017-05-08","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":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45},{"id":"2301.01716","title":"First-order penalty methods for bilevel optimization","created":"2023-01-04","cited_by_count":41},{"id":"2006.13476","title":"Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations","created":"2020-06-24","cited_by_count":40},{"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":"1906.11985","title":"Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond","created":"2019-06-27","cited_by_count":36},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36},{"id":"2106.04188","title":"Stability and Generalization of Bilevel Programming in Hyperparameter Optimization","created":"2021-06-08","cited_by_count":31},{"id":"1912.07481","title":"On Lower Iteration Complexity Bounds for the Saddle Point Problems","created":"2019-12-16","cited_by_count":28},{"id":"1705.07260","title":"Oracle Complexity of Second-Order Methods for Smooth Convex Optimization","created":"2017-05-20","cited_by_count":24},{"id":"2103.08280","title":"Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction","created":"2021-03-15","cited_by_count":24},{"id":"2109.14756","title":"A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning","created":"2021-09-29","cited_by_count":24},{"id":"2205.15084","title":"SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems","created":"2022-05-30","cited_by_count":23},{"id":"1603.05642","title":"Optimal Black-Box Reductions Between Optimization Objectives","created":"2016-03-17","cited_by_count":21},{"id":"2202.03684","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","created":"2022-02-08","cited_by_count":19},{"id":"2201.11411","title":"Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(\\epsilon^{-7/4})$ Complexity","created":"2022-01-27","cited_by_count":17},{"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":"2302.08766","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization","created":"2023-02-17","cited_by_count":16},{"id":"2307.00126","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","created":"2023-06-30","cited_by_count":15},{"id":"1710.10329","title":"Lower Bounds for Higher-Order Convex Optimization","created":"2017-10-27","cited_by_count":12},{"id":"2402.07101","title":"On the Complexity of First-Order Methods in Stochastic Bilevel Optimization","created":"2024-02-11","cited_by_count":12},{"id":"2405.09660","title":"Fast Two-Time-Scale Stochastic Gradient Method with Applications in Reinforcement Learning","created":"2024-05-15","cited_by_count":10},{"id":"2507.20400","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","created":"2025-07-27","cited_by_count":9},{"id":"2404.00158","title":"Fully Zeroth-Order Bilevel Programming via Gaussian Smoothing","created":"2024-03-29","cited_by_count":6},{"id":"2405.18777","title":"SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity","created":"2024-05-29","cited_by_count":6},{"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":"2511.19656","title":"Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles","created":"2025-11-24","cited_by_count":3},{"id":"2510.03646","title":"Optimal Zeroth-Order Bilevel Optimization","created":"2025-10-04","cited_by_count":1}],"next_cursor":null}