Fetching the paper…
Reading the bibliography…
Stochastic bilevel optimization generalizes the classic stochastic optimization from the minimization of a single objective to the minimization of an objective function that depends the solution of another optimization problem.
A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
The Theory of Market Economy
Heinrich Von Stackelberg · 1952
Earlier work this paper cites.
Mathematical programs with optimization problems in the constraints
Jerome Bracken and James T McGill · 1973
Earlier work this paper cites.
Bilevel and multilevel programming: A bibliography review
Luis N Vicente and Paul H Calamai · 1994
Earlier work this paper cites.
Optimality conditions for bilevel programming problems
Jane Ye and Daoli Zhu · 1995
Earlier work this paper cites.
Actor-critic-type learning algorithms for markov decision processes
Vijaymohan Konda and Vivek Borkar · 1999
Earlier work this paper cites.
Numerical Optimization
Jorge Nocedal and Stephen Wright · 2006
Earlier work this paper cites.
An overview of bilevel optimization
Benoît Colson, Patrice Marcotte, and Gilles Savard · 2007
Earlier work this paper cites.
Classification model selection via bilevel programming
Gautam Kunapuli, Kristin P Bennett, Jing Hu, and Jong-Shi Pang · 2008
Earlier work this paper cites.
Lectures on Stochastic Programming: Modeling and Theory
Alexander Shapiro, Darinka Dentcheva, and Andrzej Ruszczyński · 2009
Earlier work this paper cites.
LIBSVM: A library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Earlier work this paper cites.
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Earlier work this paper cites.
A bilevel optimization approach for parameter learning in variational models
Karl Kunisch and Thomas Pock · 2013
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A basic course , volume 87
Yurii Nesterov · 2013
Earlier work this paper cites.
Hyperparameter optimization with approximate gradient
Fabian Pedregosa · 2016
Earlier work this paper cites.
A class of prediction-correction methods for time-varying convex optimization
Andrea Simonetto, Aryan Mokhtari, Alec Koppel, Geert Leus, and Alejandro Ribeiro · 2016
Earlier work this paper cites.
Finite-sum composition optimization via variance reduced gradient descent
Xiangru Lian, Mengdi Wang, and Ji Liu · 2017
Earlier work this paper cites.
A first order method for solving convex bilevel optimization problems
Shoham Sabach and Shimrit Shtern · 2017
Cited alongside, same era.
Finite sample analysis of two-timescale stochastic approximation with applications to reinforcement learning
Gal Dalal, Gugan Thoppe, Balázs Szörényi, and Shie Mannor · 2018
Cited alongside, same era.
The limit points of (optimistic) gradient descent in min-max optimization
Constantinos Daskalakis and Ioannis Panageas · 2018
Cited alongside, same era.
Damek Davis and Dmitriy Drusvyatskiy · 2018
Cited alongside, same era.
Bilevel programming for hyperparameter optimization and meta-learning
Luca Franceschi, Paolo Frasconi, Saverio Salzo, Riccardo Grazzi, and Massimiliano Pontil · 2018
Cited alongside, same era.
A two-timescale framework for bilevel optimization: Complexity analysis and application to actor-critic
Mingyi Hong, Hoi-To Wai, Zhaoran Wang, and Zhuoran Yang · 2020
Later among the works it cites.
Biased stochastic gradient descent for conditional stochastic optimization
Yifan Hu, Siqi Zhang, Xin Chen, and Niao He · 2020
Later among the works it cites.
Provably faster algorithms for bilevel optimization and applications to meta-learning
Kaiyi Ji, Junjie Yang, and Yingbin Liang · 2020
Later among the works it cites.
Finite time analysis of linear two-timescale stochastic approximation with markovian noise
Maxim Kaledin, Eric Moulines, Alexey Naumov, Vladislav Tadic, and Hoi-To Wai · 2020
Later among the works it cites.
On gradient descent ascent for nonconvex-concave minimax problems
Tianyi Lin, Chi Jin, and Michael Jordan · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Approximation methods for bilevel programming
Saeed Ghadimi and Mengdi Wang · 2018
Cited alongside, same era.
Momentum-based variance reduction in non-convex sgd
Ashok Cutkosky and Francesco Orabona · 2019
Cited alongside, same era.
Solving a class of non-convex min-max games using iterative first order methods
Maher Nouiehed, Maziar Sanjabi, Tianjian Huang, Jason D Lee, and Meisam Razaviyayn · 2019
Cited alongside, same era.
A Newton-based method for nonconvex optimization with fast evasion of saddle points
Santiago Paternain, Aryan Mokhtari, and Alejandro Ribeiro · 2019
Cited alongside, same era.
Meta-learning with implicit gradients
Aravind Rajeswaran, Chelsea Finn, Sham M Kakade, and Sergey Levine · 2019
Cited alongside, same era.
Truncated back-propagation for bilevel optimization
Amirreza Shaban, Ching-An Cheng, Nathan Hatch, and Byron Boots · 2019
Cited alongside, same era.
A stochastic composite gradient method with incremental variance reduction
Junyu Zhang and Lin Xiao · 2019
Cited alongside, same era.
A generic first-order algorithmic framework for bi-level programming beyond lower-level singleton
Risheng Liu, Pan Mu, Xiaoming Yuan, Shangzhi Zeng, and Jin Zhang · 2020
Later among the works it cites.
Stochastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems
Luo Luo, Haishan Ye, Zhichao Huang, and Tong Zhang · 2020
Later among the works it cites.
A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach
Aryan Mokhtari, Asuman Ozdaglar, and Sarath Pattathil · 2020
Later among the works it cites.
Stochastic Gauss-Newton algorithms for nonconvex compositional optimization
Quoc Tran-Dinh, Nhan Pham, and Lam Nguyen · 2020
Later among the works it cites.
Randomized stochastic variance-reduced methods for stochastic bilevel optimization
Zhishuai Guo and Tianbao Yang · 2021
Closest in time.
Biadam: Fast adaptive bilevel optimization methods
Feihu Huang and Heng Huang · 2021
Closest in time.
A momentum-assisted single-timescale stochastic approximation algorithm for bilevel optimization
Prashant Khanduri, Siliang Zeng, Mingyi Hong, Hoi-To Wai, Zhaoran Wang, and Zhuoran Yang · 2021
Closest in time.
Investigating bi-level optimization for learning and vision from a unified perspective: A survey and beyond
Risheng Liu, Jiaxin Gao, Jin Zhang, Deyu Meng, and Zhouchen Lin · 2021
Closest in time.
Non-convex min-max optimization: Provable algorithms and applications in machine learning
Hassan Rafique, Mingrui Liu, Qihang Lin, and Tianbao Yang · 2021
Closest in time.
A hybrid stochastic optimization framework for composite nonconvex optimization
Quoc Tran-Dinh, Nhan H Pham, Dzung T Phan, and Lam M Nguyen · 2021
Closest in time.
Provably faster algorithms for bilevel optimization
Junjie Yang, Kaiyi Ji, and Yingbin Liang · 2021
Closest in time.