A computable a-posteriori bound on the inexact piggyback hypergradient enables adaptive tolerance and step-size control for bilevel learning of convex regularizers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An Adaptively Inexact Method for Bilevel Learning Using Primal-Dual Style Differentiation
A computable a-posteriori bound on the inexact piggyback hypergradient enables adaptive tolerance and step-size control for bilevel learning of convex regularizers.