qNBO coordinates lower-level quasi-Newton iterations with inverse Hessian-vector products to approximate bilevel hypergradients, giving BFGS and SR1 instantiations and a non-asymptotic BFGS convergence rate.
The convergence of a class of double-rank minimization algorithms 1
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
qNBO: quasi-Newton Meets Bilevel Optimization
qNBO coordinates lower-level quasi-Newton iterations with inverse Hessian-vector products to approximate bilevel hypergradients, giving BFGS and SR1 instantiations and a non-asymptotic BFGS convergence rate.