Formalizes Root-Finding Bilevel Optimization (RF-BO) and introduces a Jacobian-free TTSA algorithm that structurally avoids variance amplification, with convergence guarantees and reported gains over squared-residual baselines in SimCLR, ODE control, RL entropy tuning, and generative modeling.
arXiv preprint arXiv:2007.01932 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Escaping the Variance Trap: Jacobian-Free Dynamics for Root-Finding Bilevel Optimization
Formalizes Root-Finding Bilevel Optimization (RF-BO) and introduces a Jacobian-free TTSA algorithm that structurally avoids variance amplification, with convergence guarantees and reported gains over squared-residual baselines in SimCLR, ODE control, RL entropy tuning, and generative modeling.