[1] Michael Arbel and Julien Mairal. Amortized implicit differentiation for stochastic bilevel optimization. In Proc. International Conference on Learning Representations, virtual, 2022.
[2] Michael Arbel and Julien Mairal. Non-convex bilevel games with critical point selection maps. In Proc. Advances in Neural Information Processing Systems, New Orleans, LA, 2022.
[3] Sanjeev Arora, Simon Du, Sham Kakade, Yuping Luo, and Nikunj Saunshi. Provable representation learning for imitation learning via bi-level optimization. In Proc. International Conference on Machine Learning, virtual, 2020.
[4] Zalán Borsos, Mojmír Mutny, and Andreas Krause. Coresets via bilevel optimization for continual learning and streaming. In Proc. Advances in Neural Information Processing Systems, virtual, 2020.
[5] Jerome Bracken and James T McGill. Mathematical programs with optimization problems in the constraints. Operations Research, 21(1):37-44, 1973.
[6] Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford. Lower bounds for finding stationary points i. Mathematical Programming, 184(1-2):71-120, 2020.
[7] Lesi Chen, Jing Xu, and Jingzhao Zhang. On bilevel optimization without lower-level strong convexity. arXiv preprint arXiv:2301.00712, 2023.
[8] Lisha Chen, Sharu Theresa Jose, Ivana Nikoloska, Sangwoo Park, Tianyi Chen, and Osvaldo Simeone. Learning with limited samples: Meta-learning and applications to communication systems. Foundations and Trends® in Signal Processing, 17(2):79-208, 2023.
[9] Tianyi Chen, Yuejiao Sun, and Wotao Yin. Closing the gap: Tighter analysis of alternating stochastic gradient methods for bilevel problems. In Proc. Advances in Neural Information Processing Systems, virtual, 2021.
[10] Tianyi Chen, Yuejiao Sun, Quan Xiao, and Wotao Yin. A single-timescale method for stochastic bilevel optimization. In Proc. International Conference on Artificial Intelligence and Statistics, virtual, 2022.
[11] Frank H Clarke. Optimization and nonsmooth analysis. SIAM, 1990.
[12] Caroline Crockett and Jeffrey Fessler. Bilevel methods for image reconstruction. Foundations and Trends® in Signal Processing, 15(2-3):121-289, 2022.
[13] Mathieu Dagréou, Pierre Ablin, Samuel Vaiter, and Thomas Moreau. A framework for bilevel optimization that enables stochastic and global variance reduction algorithms. In Proc. Advances in Neural Information Processing Systems, New Orleans, LA, 2022.
[14] Stephan Dempe. Foundations of bilevel programming. Springer Science & Business Media, 2002.
[15] Stephan Dempe and Alain B Zemkoho. On the karush-kuhn-tucker reformulation of the bilevel optimization problem. Nonlinear Analysis: Theory, Methods & Applications, 75(3):1202-1218, 2012.
[16] Stephan Dempe and Alain B Zemkoho. The bilevel programming problem: reformulations, constraint qualifications and optimality conditions. Mathematical Programming, 138(1):447-473, 2013.
[17] Stephan Dempe, Vyatcheslav V Kalashnikov, and Nataliya Kalashnykova. Optimality conditions for bilevel programming problems. Optimization with Multivalued Mappings: Theory, Applications, and Algorithms, pages 3-28, 2006.
[18] Joydeep Dutta and Stephan Dempe. Bilevel programming with convex lower level problems. Optimization with Multivalued Mappings: Theory, Applications, and Algorithms, pages 51-71, 2006.