Fetching the paper…
Reading the bibliography…
Bilevel optimization enjoys a wide range of applications in emerging machine learning and signal processing problems such as hyper-parameter optimization, image reconstruction, meta-learning, adversarial training, and reinforcement learning.
Ye JJ, Zhu D (2010) New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches. SIAM Journal on Optimization 20(4):1885–1905
1905
Earlier work this paper cites.
Hu J, Ji X, Pang JS (2006) Model selection via bilevel optimization. In: IEEE International Joint Conference on Neural Network, pp 1922–1929
1929
Earlier work this paper cites.
Stackelberg H (1952) The Theory of Market Economy. Oxford University Press
1952
Earlier work this paper cites.
Clarke F (1990) Optimization and nonsmooth analysis. SIAM
1990
Earlier work this paper cites.
Vicente L, Calamai P (1994) Bilevel and multilevel programming: A bibliography review. Journal of Global optimization 5(3):291–306
1994
Earlier work this paper cites.
Vicente L, Savard G, Júdice J (1994) Descent approaches for quadratic bilevel programming. Journal of optimization theory and applications 81(2):379–399
1994
Earlier work this paper cites.
Falk JE, Liu J (1995) On bilevel programming, part i: general nonlinear cases. Mathematical Programming 70:47–72
1995
Earlier work this paper cites.
Ye JJ, Zhu D (1995) Optimality conditions for bilevel programming problems. Optimization 33(1):9–27
1995
Earlier work this paper cites.
Luo Z, Pang J, Ralph D (1996) Mathematical programs with equilibrium constraints. Cambridge University Press
1996
Earlier work this paper cites.
Ye J, Zhu D, Zhu Q (1997) Exact penalization and necessary optimality conditions for generalized bilevel programming problems. SIAM Journal on Optimization 7(2)
1997
Earlier work this paper cites.
Dempe S, Kalashnikov V, Kalashnykova N (2006) Optimality conditions for bilevel programming problems. Optimization with Multivalued Mappings: Theory, Applications, and Algorithms pp 3–28
2006
Earlier work this paper cites.
Nesterov Y, Polyak B (2006) Cubic regularization of newton method and its global performance. Mathematical Programming 108(1):177–205
2006
Earlier work this paper cites.
Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Annals of operations research 153(1):235–256
2007
Earlier work this paper cites.
Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences 2(1):183–202
2009
Earlier work this paper cites.
Dontchev AL, Rockafellar RT (2009) Implicit functions and solution mappings, vol 543. Springer
2009
Earlier work this paper cites.
Dempe S, Dutta J (2012) Is bilevel programming a special case of a mathematical program with complementarity constraints? Mathematical programming 131:37–48
2012
Earlier work this paper cites.
Dempe S, Zemkoho A (2012) On the karush–kuhn–tucker reformulation of the bilevel optimization problem. Nonlinear Analysis: Theory, Methods & Applications 75(3):1202–1218
2012
Earlier work this paper cites.
Nesterov Y (2013) Gradient methods for minimizing composite functions. Mathematical programming 140(1):125–161
2013
Earlier work this paper cites.
Maclaurin D, Duvenaud D, Adams R (2015) Gradient-based hyperparameter optimization through reversible learning. In: Proceedings of International Conference on Machine Learning
2015
Earlier work this paper cites.
Ghadimi S, Lan G, Zhang H (2016) Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Mathematical Programming 155(1):267–305
2016
Earlier work this paper cites.
Karimi H, Nutini J, Schmidt M (2016) Linear convergence of gradient and proximal-gradient methods under the polyak-lojasiewicz condition. In: Proc. of Joint European conference on machine learning and knowledge discovery in databases
2016
Earlier work this paper cites.
Lee JD, Simchowitz M, Jordan MI, Recht B (2016) Gradient descent only converges to minimizers. In: Proceedings of Conference on Learning Theory, pp 1246–1257
2016
Earlier work this paper cites.
Pedregosa F (2016) Hyperparameter optimization with approximate gradient. In: Proceedings of International Conference on Machine Learning
2016
Earlier work this paper cites.
Finn C, Abbeel P, Levine S (2017) Model-agnostic meta-learning for fast adaptation of deep networks. In: Proceedings of International Conference on Machine Learning
2017
Earlier work this paper cites.
Franceschi L, Donini M, Frasconi P, Pontil M (2017) Forward and reverse gradient-based hyperparameter optimization. In: Proceedings of International Conference on Machine Learning
2017
Earlier work this paper cites.
Jin C, Ge R, Netrapalli P, Kakade SM, Jordan MI (2017) How to escape saddle points efficiently. In: Proceedings of International Conference on Machine Learning, pp 1724–1732
2017
Earlier work this paper cites.
Sabach S, Shtern S (2017) A first order method for solving convex bilevel optimization problems. SIAM Journal on Optimization 27(2):640–660
2017
Cited alongside, same era.
Wang M, Fang E, Liu H (2017) Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions. Mathematical Programming 161:419–449
2017
Cited alongside, same era.
Drusvyatskiy D, Lewis A (2018) Error bounds, quadratic growth, and linear convergence of proximal methods. Mathematics of Operations Research 43(3):919–948
2018
Cited alongside, same era.
Franceschi L, Frasconi P, Salzo S, Grazzi R, Pontil M (2018) Bilevel programming for hyperparameter optimization and meta-learning. In: Proceedings of International Conference on Machine Learning
2018
Cited alongside, same era.
Ghadimi S, Wang M (2018) Approximation methods for bilevel programming. arXiv preprint arXiv:180202246
Cheng C, Xie T, Jiang N, Agarwal A (2022) Adversarially trained actor critic for offline reinforcement learning. In: Proceedings of International Conference on Machine Learning
2022
Later among the works it cites.
Crockett C, Fessler J (2022) Bilevel methods for image reconstruction. Foundations and Trends® in Signal Processing 15(2-3):121–289
2022
Later among the works it cites.
Dagréou M, Ablin P, Vaiter S, Moreau T (2022) A framework for bilevel optimization that enables stochastic and global variance reduction algorithms. In: Proceedings of Advances in Neural Information Processing Systems
2022
Later among the works it cites.
Davis D, Drusvyatskiy D (2022) Proximal methods avoid active strict saddles of weakly convex functions. Foundations of Computational Mathematics 22(2):561–606
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
Nichol A, Achiam J, Schulman J (2018) On first-order meta-learning algorithms. arXiv preprint arXiv:180302999
2018
Cited alongside, same era.
Drusvyatskiy D, Paquette C (2019) Efficiency of minimizing compositions of convex functions and smooth maps. Mathematical Programming 178(1):503–558
2019
Cited alongside, same era.
Nouiehed M, Sanjabi M, Huang T, Lee J, Razaviyayn M (2019) Solving a class of non-convex min-max games using iterative first order methods. In: Proceedings of Advances in Neural Information Processing Systems
2019
Cited alongside, same era.
Rajeswaran A, Finn C, Kakade S, Levine S (2019) Meta-learning with implicit gradients. In: Proceedings of Advances in Neural Information Processing Systems
2019
Cited alongside, same era.
Shaban A, Cheng C, Hatch N, Boots B (2019) Truncated back-propagation for bilevel optimization. In: Proceedings of International Conference on Artificial Intelligence and Statistics
2019
Cited alongside, same era.
Fiacco A (2020) Optimal value continuity and differential stability bounds under the mangasarian-fromovitz constraint qualification. In: Mathematical Programming with Data Perturbations II, Second Edition, CRC Press, pp 65–90
2020
Cited alongside, same era.
Grazzi R, Franceschi L, Pontil M, Salzo S (2020) On the iteration complexity of hypergradient computation. In: Proceedings of International Conference on Machine Learning, pp 3748–3758
2020
Cited alongside, same era.
Gao L, Ye J, Yin H, Zeng S, Zhang J (2022) Value function based difference-of-convex algorithm for bilevel hyperparameter selection problems. In: Proceedings of International Conference on Machine Learning
2022
Later among the works it cites.
Giovannelli T, Kent G, Vicente L (2022) Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems. arXiv preprint arXiv:211000604
2022
Later among the works it cites.
Hu Q, Zhong Y, Yang T (2022) Multi-block min-max bilevel optimization with applications in multi-task deep auc maximization. Proceedings of Advances in Neural Information Processing Systems
2022
Later among the works it cites.
Huang F, Li J, Gao S, Huang H (2022) Enhanced bilevel optimization via bregman distance. In: Proceedings of Advances in Neural Information Processing Systems
2022
Later among the works it cites.
Ji K, Liu M, Liang Y, Ying L (2022) Will bilevel optimizers benefit from loops. In: Proceedings of Advances in Neural Information Processing Systems
2022
Later among the works it cites.
Li J, Gu B, Huang H (2022) A fully single loop algorithm for bilevel optimization without hessian inverse. In: Proceedings of AAAI Conference on Artificial Intelligence
2022
Later among the works it cites.
Lu S, Cui X, Squillante M, Kingsbury B, Horesh L (2022) Decentralized bilevel optimization for personalized client learning. In: Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing
2022
Later among the works it cites.
Shen H, Chen T (2022) A single-timescale analysis for stochastic approximation with multiple coupled sequences. In: Proceedings of Advances in Neural Information Processing Systems
2022
Later among the works it cites.
Sow D, Ji K, Liang Y (2022) On the convergence theory for hessian-free bilevel algorithms. In: Proceedings of Advances in Neural Information Processing Systems
2022
Later among the works it cites.
Tarzanagh D, Li M, Thrampoulidis C, Oymak S (2022) Fednest: Federated bilevel, minimax, and compositional optimization. In: Proceedings of International Conference on Machine Learning
2022
Later among the works it cites.
Vicol P, Lorraine J, Pedregosa F, Duvenaud D, Grosse R (2022) On implicit bias in overparameterized bilevel optimization. In: Proceedings of International Conference on Machine Learning
2022
Later among the works it cites.
Yang S, Zhang X, Wang M (2022) Decentralized gossip-based stochastic bilevel optimization over communication networks. In: Proceedings of Advances in Neural Information Processing Systems
2022
Later among the works it cites.
Ye M, Liu B, Wright S, Stone P, Liu Q (2022) Bome! bilevel optimization made easy: A simple first-order approach. In: Proceedings of Advances in Neural Information Processing Systems
2022
Later among the works it cites.
2022
Later among the works it cites.
Hong M, Wai HT, Wang Z, Yang Z (2023) A two-timescale framework for bilevel optimization: Complexity analysis and application to actor-critic. SIAM Journal on Optimization 33(1)
2023
Closest in time.
Lu Z, Mei S (2023) First-order penalty methods for bilevel optimization. arXiv preprint arXiv:230101716
2023
Closest in time.
Shen H, Chen T (2023) On penalty-based bilevel gradient descent method. In: Proceedings of International Conference on Machine Learning
2023
Closest in time.
Ye J, Yuan X, Zeng S, Zhang J (2023) Difference of convex algorithms for bilevel programs with applications in hyperparameter selection. Mathematical Programming 198(2):1583–1616
2023
Closest in time.
Chen L, Xu J, Zhang J (2024) On finding small hyper-gradients in bilevel optimization: Hardness results and improved analysis. In: Proceedings of Conference on Learning Theory
2024
Closest in time.
Giovannelli T, Kent G, Vicente L (2024) Bilevel optimization with a multi-objective lower-level problem: Risk-neutral and risk-averse formulations. Optimization Methods and Software pp 1–23
2024
Closest in time.
Shen H, Yang Z, Chen T (2024) Principled penalty-based methods for bilevel reinforcement learning and rlhf. In: Proceedings of International Conference on Machine Learning
2024
Closest in time.