[54] Fabian Pedregosa. Hyperparameter optimization with approximate gradient. In Proc. International Conference on Machine Learning, New York City, NY, 2016.
[55] Quang Pham, Chenghao Liu, Doyen Sahoo, and HOI Steven. Contextual transformation networks for online continual learning. In Proc. International Conference on Learning Representations, virtual, 2021.
[56] Shoham Sabach and Shimrit Shtern. A first order method for solving convex bilevel optimization problems. SIAM Journal on Optimization, 27(2):640-660, 2017.
[57] Han Shen, Quan Xiao, and Tianyi Chen. On penalty-based bilevel gradient descent method. arXiv preprint:2302.05185, 2023.
[58] Daouda Sow, Kaiyi Ji, Ziwei Guan, and Yingbin Liang. A constrained optimization approach to bilevel optimization with multiple inner minima. arXiv preprint arXiv:2203.01123, 2022.
[59] Bradly Stadie, Lunjun Zhang, and Jimmy Ba. Learning intrinsic rewards as a bi-level optimization problem. In Conference on Uncertainty in Artificial Intelligence, virtual, 2020.
[60] Gilbert W Stewart. On the perturbation of pseudo-inverses, projections and linear least squares problems. SIAM review, 19(4):634-662, 1977.
[61] Ju Sun, Qing Qu, and John Wright. A geometric analysis of phase retrieval. Foundations of Computational Mathematics, 18:1131-1198, 2018.
[62] Richard S Sutton and Andrew G Barto. Reinforcement Learning: An Introduction. MIT press, 2018.
[63] Davoud Ataee Tarzanagh, Mingchen Li, Christos Thrampoulidis, and Samet Oymak. FEDNEST: Federated bilevel, minimax, and compositional optimization. In Proc. International Conference on Machine Learning, Baltimore, MD, 2022.
[64] Ioannis Tsaknakis, Prashant Khanduri, and Mingyi Hong. An implicit gradient-type method for linearly constrained bilevel problems. In IEEE International Conference on Acoustics, Speech and Signal Processing, Singapore, 2022.
[65] Paul Vicol, Jonathan P Lorraine, Fabian Pedregosa, David Duvenaud, and Roger B Grosse. On implicit bias in overparameterized bilevel optimization. In Proc. International Conference on Machine Learning, Baltimore, MD, 2022.
[66] Quan Xiao, Han Shen, Wotao Yin, and Tianyi Chen. Alternating implicit projected sgd and its efficient variants for equality-constrained bilevel optimization. In Proc. International Conference on Artificial Intelligence and Statistics, Valencia, Spain, 2023.
[67] Junjie Yang, Kaiyi Ji, and Yingbin Liang. Provably faster algorithms for bilevel optimization. In Proc. Advances in Neural Information Processing Systems, virtual, 2021.
[68] Shuoguang Yang, Xuezhou Zhang, and Mengdi Wang. Decentralized gossip-based stochastic bilevel optimization over communication networks. In Proc. Advances in Neural Information Processing Systems, New Orleans, LA, 2022.
[69] Jane J Ye. Constraint qualifications and optimality conditions in bilevel optimization. Bilevel Optimization: Advances and Next Challenges, pages 227–251, 2020.
[70] Jane J Ye and Daoli Zhu. Optimality conditions for bilevel programming problems. Optimization, 33(1):9-27, 1995.
[71] Jane J Ye and Daoli Zhu. New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches. SIAM Journal on Optimization, 20(4): 1885-1905, 2010.
[72] Jane J Ye, Xiaoming Yuan, Shangzhi Zeng, and Jin Zhang. Difference of convex algorithms for bilevel programs with applications in hyperparameter selection. Mathematical Programming, pages 1-34, 2022.
[73] Yihua Zhang, Guanhua Zhang, Prashant Khanduri, Mingyi Hong, Shiyu Chang, and Sijia Liu. Revisiting and advancing fast adversarial training through the lens of bi-level optimization. In Proc. International Conference on Machine Learning, Baltimore, MD, 2022.