Fetching the paper…
Reading the bibliography…
In this work, we study first-order algorithms for solving Bilevel Optimization (BO) where the objective functions are smooth but possibly nonconvex in both levels and the variables are restricted to closed convex sets.
Theory of the market economy
H. v. Stackelberg et al · 1952
Earlier work this paper cites.
Proximité et dualité dans un espace hilbertien
J.-J. Moreau · 1965
Earlier work this paper cites.
Mathematical programs with optimization problems in the constraints
J. Bracken and J. T. McGill · 1973
Earlier work this paper cites.
A solution method for the linear static stackelberg problem using penalty functions
G. Anandalingam and D. White · 1990
Earlier work this paper cites.
Double penalty method for bilevel optimization problems
Y. Ishizuka and E. Aiyoshi · 1992
Earlier work this paper cites.
A penalty function approach for solving bi-level linear programs
D. J. White and G. Anandalingam · 1993
Earlier work this paper cites.
Descent approaches for quadratic bilevel programming
L. Vicente, G. Savard, and J. Júdice · 1994
Earlier work this paper cites.
Exact and inexact penalty methods for the generalized bilevel programming problem
P. Marcotte and D. L. Zhu · 1996
Earlier work this paper cites.
Nonlinear programming
D. P. Bertsekas · 1997
Earlier work this paper cites.
Exact penalization and necessary optimality conditions for generalized bilevel programming problems
J. Ye, D. Zhu, and Q. J. Zhu · 1997
Earlier work this paper cites.
Nonlinear Programming
D. P. Bertsekas · 1999
Earlier work this paper cites.
Actor-critic algorithms
V. Konda and J. Tsitsiklis · 1999
Earlier work this paper cites.
Envelope theorems for arbitrary choice sets
P. Milgrom and I. Segal · 2002
Earlier work this paper cites.
Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints
S. Dempe · 2003
Earlier work this paper cites.
An overview of bilevel optimization
B. Colson, P. Marcotte, and G. Savard · 2007
Earlier work this paper cites.
Bilevel model selection for support vector machines
G. Kunapuli, K. P. Bennett, J. Hu, and J.-S. Pang · 2008
Earlier work this paper cites.
Perturbation analysis of optimization problems
J. F. Bonnans and A. Shapiro · 2013
Earlier work this paper cites.
Convex optimization: Algorithms and complexity
S. Bubeck et al · 2015
Earlier work this paper cites.
Bilevel programming problems
S. Dempe, V. Kalashnikov, G. A. Pérez-Valdés, and N. Kalashnykova · 2015
Earlier work this paper cites.
Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition
H. Karimi, J. Nutini, and M. Schmidt · 2016
Earlier work this paper cites.
Hyperparameter optimization with approximate gradient
F. Pedregosa · 2016
Earlier work this paper cites.
A review on bilevel optimization: From classical to evolutionary approaches and applications
A. Sinha, P. Malo, and K. Deb · 2017
Earlier work this paper cites.
Bilevel programming for hyperparameter optimization and meta-learning
L. Franceschi, P. Frasconi, S. Salzo, R. Grazzi, and M. Pontil · 2018
Earlier work this paper cites.
Approximation methods for bilevel programming
S. Ghadimi and M. Wang · 2018
Cited alongside, same era.
A variational inequality perspective on generative adversarial networks
G. Gidel, H. Berard, G. Vignoud, P. Vincent, and S. Lacoste-Julien · 2018
Cited alongside, same era.
Reinforcement learning: An introduction
R. S. Sutton and A. G. Barto · 2018
Cited alongside, same era.
Meta-learning with implicit gradients
A. Rajeswaran, C. Finn, S. M. Kakade, and S. Levine · 2019
Cited alongside, same era.
Efficient algorithms for smooth minimax optimization
K. K. Thekumparampil, P. Jain, P. Netrapalli, and S. Oh · 2019
Cited alongside, same era.
Generative adversarial networks
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio · 2020
A single-timescale method for stochastic bilevel optimization
T. Chen, Y. Sun, Q. Xiao, and W. Yin · 2022
Later among the works it cites.
M. Dagréou, P. Ablin, S. Vaiter, and T. Moreau · 2022
Later among the works it cites.
Partial differential equations
L. C. Evans · 2022
Later among the works it cites.
The first optimal algorithm for smooth and strongly-convex-strongly-concave minimax optimization
D. Kovalev and A. Gasnikov · 2022
Later among the works it cites.
A fully single loop algorithm for bilevel optimization without hessian inverse
J. Li, B. Gu, and H. Huang · 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…
Cited alongside, same era.
What is local optimality in nonconvex-nonconcave minimax optimization?
C. Jin, P. Netrapalli, and M. Jordan · 2020
Cited alongside, same era.
J. Yang, N. Kiyavash, and N. He · 2020
Cited alongside, same era.
A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems
J. Zhang, P. Xiao, R. Sun, and Z. Luo · 2020
Cited alongside, same era.
Stability and generalization of bilevel programming in hyperparameter optimization
F. Bao, G. Wu, C. Li, J. Zhu, and B. Zhang · 2021
Cited alongside, same era.
Closing the gap: Tighter analysis of alternating stochastic gradient methods for bilevel problems
T. Chen, Y. Sun, and W. Yin · 2021
Cited alongside, same era.
The complexity of constrained min-max optimization
C. Daskalakis, S. Skoulakis, and M. Zampetakis · 2021
Cited alongside, same era.
J. Li, L. Zhu, and A. M.-C. So · 2022
Later among the works it cites.
Loss landscapes and optimization in over-parameterized non-linear systems and neural networks
C. Liu, L. Zhu, and M. Belkin · 2022
Later among the works it cites.
A constrained optimization approach to bilevel optimization with multiple inner minima
D. Sow, K. Ji, Z. Guan, and Y. Liang · 2022
Later among the works it cites.
Faster single-loop algorithms for minimax optimization without strong concavity
J. Yang, A. Orvieto, A. Lucchi, and N. He · 2022
Later among the works it cites.
Bome! bilevel optimization made easy: A simple first-order approach
M. Ye, B. Liu, P. Stone, S. Wright, and Q. Liu · 2022
Later among the works it cites.
Accelerated primal-dual scheme for a class of stochastic nonconvex-concave saddle point problems
M. Boroun, Z. Alizadeh, and A. Jalilzadeh · 2023
Closest in time.
Near-optimal fully first-order algorithms for finding stationary points in bilevel optimization
L. Chen, Y. Ma, and J. Zhang · 2023
Closest in time.
On bilevel optimization without lower-level strong convexity
L. Chen, J. Xu, and J. Zhang · 2023
Closest in time.
Bilevel optimization with a lower-level contraction: Optimal sample complexity without warm-start
R. Grazzi, M. Pontil, and S. Salzo · 2023
Closest in time.
A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor-critic
M. Hong, H.-T. Wai, Z. Wang, and Z. Yang · 2023
Closest in time.
On momentum-based gradient methods for bilevel optimization with nonconvex lower-level
F. Huang · 2023
Closest in time.
A fully first-order method for stochastic bilevel optimization
J. Kwon, D. Kwon, S. Wright, and R. D. Nowak · 2023
Closest in time.
Averaged method of multipliers for bi-level optimization without lower-level strong convexity
R. Liu, Y. Liu, W. Yao, S. Zeng, and J. Zhang · 2023
Closest in time.
First-order penalty methods for bilevel optimization
Z. Lu and S. Mei · 2023
Closest in time.
On penalty-based bilevel gradient descent method
H. Shen and T. Chen · 2023
Closest in time.
A generalized alternating method for bilevel optimization under the polyak-Łojasiewicz condition
Q. Xiao, S. Lu, and T. Chen · 2023
Closest in time.
Alternating projected sgd for equality-constrained bilevel optimization
Q. Xiao, H. Shen, W. Yin, and T. Chen · 2023
Closest in time.