Fetching the paper…
Reading the bibliography…
In this paper, we propose a new Hessian inverse free Fully Single Loop Algorithm (FSLA) for bilevel optimization problems.
Momentum-based variance reduction in non-convex sgd
Cutkosky, A.; and Orabona, F. 2019 · 1905
Earlier work this paper cites.
Learner-aware teaching: Inverse reinforcement learning with preferences and constraints
Tschiatschek, S.; Ghosh, A.; Haug, L.; Devidze, R.; and Singla, A. 2019 · 1906
Earlier work this paper cites.
PC-DARTS: Partial channel connections for memory-efficient architecture search
Xu, Y.; Xie, L.; Zhang, X.; Chen, X.; Qi, G.-J.; Tian, Q.; and Xiong, H. 2019 · 1907
Earlier work this paper cites.
Es-maml: Simple hessian-free meta learning
Song, X.; Gao, W.; Yang, Y.; Choromanski, K.; Pacchiano, A.; and Tang, Y. 2019 · 1910
Earlier work this paper cites.
Penalty method for inversion-free deep bilevel optimization
Mehra, A.; and Hamm, J. 2019 · 1911
Earlier work this paper cites.
Solutions of ill-posed problems (an tikhonov and vy arsenin)
Willoughby, R. A. 1979 · 1979
Earlier work this paper cites.
Finite perturbation of convex programs
Ferris, M. C.; and Mangasarian, O. L. 1991 · 1991
Earlier work this paper cites.
Design and regularization of neural networks: the optimal use of a validation set
Larsen, J.; Hansen, L. K.; Svarer, C.; and Ohlsson, M. 1996 · 1996
Earlier work this paper cites.
Optimal use of regularization and cross-validation in neural network modeling
Chen, D.; and Hagan, M. T. 1999 · 1999
Earlier work this paper cites.
Numerical optimization
Nocedal, J.; and Wright, S. 2006 · 2006
Earlier work this paper cites.
Alphagan: Fully differentiable architecture search for generative adversarial networks
Tian, Y.; Shen, L.; Su, G.; Li, Z.; and Liu, W. 2020 · 2006
Earlier work this paper cites.
Efficient multiple hyperparameter learning for log-linear models
Do, C. B.; Foo, C.-S.; and Ng, A. Y. 2007 · 2007
Earlier work this paper cites.
Hong, M.; Wai, H.-T.; Wang, Z.; and Yang, Z. 2020 · 2007
Earlier work this paper cites.
An explicit descent method for bilevel convex optimization
Solodov, M. 2007 · 2007
Earlier work this paper cites.
Improved bilevel model: Fast and optimal algorithm with theoretical guarantee
Li, J.; Gu, B.; and Huang, H. 2020 · 2009
Earlier work this paper cites.
Provably Faster Algorithms for Bilevel Optimization and Applications to Meta-Learning
Ji, K.; Yang, J.; and Liang, Y. 2020 · 2010
Earlier work this paper cites.
MNIST handwritten digit database
LeCun, Y.; Cortes, C.; and Burges, C. 2010 · 2010
Cited alongside, same era.
Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
Yamada, I.; Yukawa, M.; and Yamagishi, M. 2011 · 2011
Cited alongside, same era.
Generic methods for optimization-based modeling
Domke, J. 2012 · 2012
Cited alongside, same era.
Gradient-based hyperparameter optimization through reversible learning
Maclaurin, D.; Duvenaud, D.; and Adams, R. 2015 · 2015
Cited alongside, same era.
Hyperparameter optimization with approximate gradient
Pedregosa, F. 2016 · 2016
Cited alongside, same era.
Forward and reverse gradient-based hyperparameter optimization
Convergent reinforcement learning with function approximation: A bilevel optimization perspective
Yang, Z.; Fu, Z.; Zhang, K.; and Wang, Z. 2018 · 2018
Later among the works it cites.
Cold case: The lost mnist digits
Yadav, C.; and Bottou, L. 2019 · 2019
Later among the works it cites.
Fast context adaptation via meta-learning
Zintgraf, L.; Shiarli, K.; Kurin, V.; Hofmann, K.; and Whiteson, S. 2019 · 2019
Later among the works it cites.
Adversarialnas: Adversarial neural architecture search for gans
Gao, C.; Chen, Y.; Liu, S.; Tan, Z.; and Yan, S. 2020 · 2020
Later among the works it cites.
On the iteration complexity of hypergradient computation
Grazzi, R.; Franceschi, L.; Pontil, M.; and Salzo, S. 2020 · 2020
Later among the works it cites.
SCAFFOLD: Stochastic controlled averaging for federated learning
Karimireddy, S. P.; Kale, S.; Mohri, M.; Reddi, S.; Stich, S.; and Suresh, A. T. 2020 · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Franceschi, L.; Donini, M.; Frasconi, P.; and Pontil, M. 2017 · 2017
Cited alongside, same era.
A first order method for solving convex bilevel optimization problems
Sabach, S.; and Shtern, S. 2017 · 2017
Cited alongside, same era.
Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms
Xiao, H.; Rasul, K.; and Vollgraf, R. 2017 · 2017
Cited alongside, same era.
Bilevel programming for hyperparameter optimization and meta-learning
Franceschi, L.; Frasconi, P.; Salzo, S.; Grazzi, R.; and Pontil, M. 2018 · 2018
Cited alongside, same era.
Approximation Methods for Bilevel Programming
Ghadimi, S.; and Wang, M. 2018 · 2018
Cited alongside, same era.
Reviving and improving recurrent back-propagation
Liao, R.; Xiong, Y.; Fetaya, E.; Zhang, L.; Yoon, K.; Pitkow, X.; Urtasun, R.; and Zemel, R. 2018 · 2018
Cited alongside, same era.
Darts: Differentiable architecture search
Liu, H.; Simonyan, K.; and Yang, Y. 2018 · 2018
Cited alongside, same era.
Later among the works it cites.
Meta-transfer learning for zero-shot super-resolution
Soh, J. W.; Cho, S.; and Cho, N. I. 2020 · 2020
Later among the works it cites.
Meta-cotgan: A meta cooperative training paradigm for improving adversarial text generation
Yin, H.; Li, D.; Li, X.; and Li, P. 2020 · 2020
Later among the works it cites.
A single-timescale stochastic bilevel optimization method
Chen, T.; Sun, Y.; and Yin, W. 2021 · 2021
Closest in time.
On Stochastic Moving-Average Estimators for Non-Convex Optimization
Guo, Z.; Xu, Y.; Yin, W.; Jin, R.; and Yang, T. 2021 · 2021
Closest in time.
Enhanced Bilevel Optimization via Bregman Distance
Huang, F.; and Huang, H. 2021 · 2021
Closest in time.
SUPER-ADAM: Faster and Universal Framework of Adaptive Gradients
Huang, F.; Li, J.; and Huang, H. 2021 · 2021
Closest in time.
Lower Bounds and Accelerated Algorithms for Bilevel Optimization
Ji, K.; and Liang, Y. 2021 · 2021
Closest in time.
A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentum
Khanduri, P.; Zeng, S.; Hong, M.; Wai, H.-T.; Wang, Z.; and Yang, Z. 2021 · 2021
Closest in time.
Liu, R.; Gao, J.; Zhang, J.; Meng, D.; and Lin, Z. 2021 · 2021
Closest in time.
Provably Faster Algorithms for Bilevel Optimization
Yang, J.; Ji, K.; and Liang, Y. 2021 · 2021
Closest in time.