Newton bilevel methods drop the lower-level strong-convexity assumption
Experiments cover synthetic tasks, data hyper-cleaning, and GPT-2 reweighting, with claimed better complexity than GALET and sl-BAMM.
1 stories, newest first · one card per story
Experiments cover synthetic tasks, data hyper-cleaning, and GPT-2 reweighting, with claimed better complexity than GALET and sl-BAMM.
Today 1.6K readers · 2.4K views · 774 reads · all time 189K views