[1] R. Liu, X. Liu, X. Yuan, S. Zeng, and J. Zhang, “A value-function-based interior-point method for non-convex bi-level optimization,” in Proceedings of International Conference on Machine Learning (ICML), pp. 6882–6892, 2021.
[2] Z.-Q. Luo, J.-S. Pang, and D. Ralph, Mathematical Programs with Equilibrium Constraints. Cambridge University Press, 1996.
[3] L. Franceschi, M. Donini, P. Frasconi, and M. Pontil, "Forward and reverse gradient-based hyperparameter optimization," in Proceedings of Advances in Neural Information Processing Systems (NeurIPS), pp. 1165-1173, 2017.
[4] A. Shaban, C.-A. Cheng, N. Hatch, and B. Boots, "Truncated back-propagation for bilevel optimization," in Proceedings of International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 1723-1732, 2019.
[5] S. Qiu, Z. Yang, J. Ye, and Z. Wang, "On finite-time convergence of actor-critic algorithm," IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 2, pp. 652-664, 2021.
[6] A. Rajeswaran, C. Finn, S. M. Kakade, and S. Levine, "Meta-learning with implicit gradients," Proceedings of Advances in Neural Information Processing Systems (NeurIPS), 2019.
[7] S. Lu, "Bilevel optimization with coupled decision-dependent distributions," in Proceedings of International Conference on Machine Learning (ICML), pp. 22758-22789, 2023.
[8] Q. Hu, Y. Zhong, and T. Yang, "Multi-block min-max bilevel optimization with applications in multi-task deep AUC maximization," in Proceedings of Advances in Neural Information Processing Systems (NeurIPS), pp. 29552-29565, 2022.
[9] S. Lu, S. Zeng, X. Cui, M. Squillante, L. Horesh, B. Kingsbury, J. Liu, and M. Hong, “A stochastic linearized augmented lagrangian method for decentralized bilevel optimization,” in Proceedings of Advances in Neural Information Processing Systems (NeurIPS), pp. 30638–30650, 2022.
[10] S. Yang, X. Zhang, and M. Wang, "Decentralized gossip-based stochastic bilevel optimization over communication networks," in Proceedings of Advances in Neural Information Processing Systems (NeurIPS), pp. 238-252, 2022.
[11] X. Chen, M. Huang, S. Ma, and K. Balasubramanian, "Decentralized stochastic bilevel optimization with improved per-iteration complexity," in Proceedings of International Conference on Machine Learning (ICML), pp. 4641-4671, 2023.
[12] D. Boob, Q. Deng, and G. Lan, "Stochastic first-order methods for convex and nonconvex functional constrained optimization," Mathematical Programming, vol. 197, no. 1, pp. 215-279, 2023.
[13] K. Ji, J. Yang, and Y. Liang, "Bilevel optimization: Convergence analysis and enhanced design," in Proceedings of International Conference on Machine Learning (ICML), pp. 4882-4892, 2021.
[14] J. Kwon, D. Kwon, S. Wright, and R. Nowak, “A fully first-order method for stochastic bilevel optimization,” in Proceedings of International Conference on Machine Learning (ICML), p.p. 18083-18113, 2023.
[15] B. Liu, M. Ye, S. Wright, P. Stone, and Q. Liu, “BOME! bilevel optimization made easy: A simple first-order approach,” in Proceedings of Advances in Neural Information Processing Systems (NeurIPS), vol. 35, pp. 17248–17262, 2022.
[16] H. Shen and T. Chen, “On penalty-based bilevel gradient descent method,” in Proceedings of International Conference on Machine Learning (ICML), pp. 30992–31015, 2023.
[17] S. Sabach and S. Shtern, “A first order method for solving convex bilevel optimization problems,” SIAM Journal on Optimization, vol. 27, no. 2, pp. 640–660, 2017.
[18] S. Ghadimi and M. Wang, “Approximation methods for bilevel programming,” arXiv preprint arXiv:1802.02246, 2018.
[19] L. Chen, J. Xu, and J. Zhang, "On bilevel optimization without lower-level strong convexity," arXiv:2301.00712, 2023.