Fetching the paper…
Reading the bibliography…
Bilevel optimization has been recently used in many machine learning problems such as hyperparameter optimization, policy optimization, and meta learning.
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
L. M. Bregman · 1967
Earlier work this paper cites.
An iterative row-action method for interval convex programming
Y. Censor and A. Lent · 1981
Earlier work this paper cites.
Proximal minimization algorithm withd-functions
Y. Censor and S. A. Zenios · 1992
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner · 1998
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Earlier work this paper cites.
Composite objective mirror descent
J. C. Duchi, S. Shalev-Shwartz, Y. Singer, and A. Tewari · 2010
Earlier work this paper cites.
Human-level concept learning through probabilistic program induction
B. M. Lake, R. Salakhutdinov, and J. B. Tenenbaum · 2015
Earlier work this paper cites.
Bilevel optimization with nonsmooth lower level problems
P. Ochs, R. Ranftl, T. Brox, and T. Pock · 2015
Earlier work this paper cites.
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
S. Ghadimi, G. Lan, and H. Zhang · 2016
Earlier work this paper cites.
Sarah: A novel method for machine learning problems using stochastic recursive gradient
L. M. Nguyen, J. Liu, K. Scheinberg, and M. Takáč · 2017
Earlier work this paper cites.
Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator
C. Fang, C. J. Li, Z. Lin, and T. Zhang · 2018
Earlier work this paper cites.
Bilevel programming for hyperparameter optimization and meta-learning
L. Franceschi, P. Frasconi, S. Salzo, R. Grazzi, and M. Pontil · 2018
Earlier work this paper cites.
Approximation methods for bilevel programming
S. Ghadimi and M. Wang · 2018
Earlier work this paper cites.
Deep bilevel learning
S. Jenni and P. Favaro · 2018
Earlier work this paper cites.
Darts: Differentiable architecture search
H. Liu, K. Simonyan, and Y. Yang · 2018
Earlier work this paper cites.
On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization
S. Zhang and N. He · 2018
Cited alongside, same era.
Momentum-based variance reduction in non-convex sgd
A. Cutkosky and F. Orabona · 2019
Cited alongside, same era.
Truncated back-propagation for bilevel optimization
A. Shaban, C.-A. Cheng, N. Hatch, and B. Boots · 2019
Cited alongside, same era.
Spiderboost and momentum: Faster variance reduction algorithms
Z. Wang, K. Ji, Y. Zhou, Y. Liang, and V. Tarokh · 2019
Cited alongside, same era.
On the iteration complexity of hypergradient computation
R. Grazzi, L. Franceschi, M. Pontil, and S. Salzo · 2020
Cited alongside, same era.
Biadam: Fast adaptive bilevel optimization methods
F. Huang and H. Huang · 2021
Closest in time.
Super-adam: faster and universal framework of adaptive gradients
F. Huang, J. Li, and H. Huang · 2021
Closest in time.
Lower bounds and accelerated algorithms for bilevel optimization
K. Ji and Y. Liang · 2021
Closest in time.
Bilevel optimization: Convergence analysis and enhanced design
K. Ji, J. Yang, and Y. Liang · 2021
Closest in time.
A near-optimal algorithm for stochastic bilevel optimization via double-momentum
P. Khanduri, S. Zeng, M. Hong, H.-T. Wai, Z. Wang, and Z. Yang · 2021
Closest in time.
A fully single loop algorithm for bilevel optimization without hessian inverse
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Hong, H.-T. Wai, Z. Wang, and Z. Yang · 2020
Cited alongside, same era.
On the adaptivity of stochastic gradient-based optimization
L. Lei and M. I. Jordan · 2020
Cited alongside, same era.
Improved bilevel model: Fast and optimal algorithm with theoretical guarantee
J. Li, B. Gu, and H. Huang · 2020
Cited alongside, same era.
Variance reduction on adaptive stochastic mirror descent
W. Li, Z. Wang, Y. Zhang, and G. Cheng · 2020
Cited alongside, same era.
A generic first-order algorithmic framework for bi-level programming beyond lower-level singleton
R. Liu, P. Mu, X. Yuan, S. Zeng, and J. Zhang · 2020
Cited alongside, same era.
Stochastic nested variance reduction for nonconvex optimization
D. Zhou, P. Xu, and Q. Gu · 2020
Cited alongside, same era.
A single-timescale stochastic bilevel optimization method
T. Chen, Y. Sun, and W. Yin · 2021
Cited alongside, same era.
J. Li, B. Gu, and H. Huang · 2021
Closest in time.
R. Liu, J. Gao, J. Zhang, D. Meng, and Z. Lin · 2021
Closest in time.
A value-function-based interior-point method for non-convex bi-level optimization
R. Liu, X. Liu, X. Yuan, S. Zeng, and J. Zhang · 2021
Closest in time.
Towards gradient-based bilevel optimization with non-convex followers and beyond
R. Liu, Y. Liu, S. Zeng, and J. Zhang · 2021
Closest in time.
On lp-hyperparameter learning via bilevel nonsmooth optimization
T. Okuno, A. Takeda, A. Kawana, and M. Watanabe · 2021
Closest in time.
Provably faster algorithms for bilevel optimization
J. Yang, K. Ji, and Y. Liang · 2021
Closest in time.
Bregman gradient policy optimization
F. Huang, S. Gao, and H. Huang · 2022
Closest in time.
Accelerated zeroth-order and first-order momentum methods from mini to minimax optimization
F. Huang, S. Gao, J. Pei, and H. Huang · 2022
Closest in time.
A general descent aggregation framework for gradient-based bi-level optimization
R. Liu, P. Mu, X. Yuan, S. Zeng, and J. Zhang · 2022
Closest in time.