REVIEW 2 cited by
Generalized Inner Loop Meta-Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Many (but not all) approaches self-qualifying as "meta-learning" in deep learning and reinforcement learning fit a common pattern of approximating the solution to a nested optimization problem. In this paper, we give a formalization of this shared pattern, which we call GIMLI, prove its general requirements, and derive a general-purpose algorithm for implementing similar approaches. Based on this analysis and algorithm, we describe a library of our design, higher, which we share with the community to assist and enable future research into these kinds of meta-learning approaches. We end the paper by showcasing the practical applications of this framework and library through illustrative experiments and ablation studies which they facilitate.
Forward citations
Cited by 2 Pith papers
-
Optimization under Persistent State-Dependent Bias: Gradient-based Method and Complexity Analysis
Residual Learning, a proposed bilevel gradient method, claims exact convergence under state-dependent analog-hardware bias with rate O~(kappa1*kappa2^4*sigma^2/(mu*K)).
-
A Planning Framework for Adaptive Labeling
A planning framework for adaptive labeling where a smoothed auto-differential policy gradient (Smoothed-Autodiff) selects batches to minimize final posterior uncertainty, outperforming active-learning heuristics and R...
Discussion (0). Continue with ORCID to comment.