Pith. sign in

REVIEW 1 cited by

Gradient-Based Meta-Learning with Learned Layerwise Metric and Subspace

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

arxiv 1801.05558 v3 pith:HQ6DIQYZ submitted 2018-01-17 stat.ML cs.CVcs.LG

classification stat.MLcs.CVcs.LG
keywords descentgradientmeta-learninggradient-basedlearnermethodssubspacetask-specific
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Gradient-based meta-learning methods leverage gradient descent to learn the commonalities among various tasks. While previous such methods have been successful in meta-learning tasks, they resort to simple gradient descent during meta-testing. Our primary contribution is the {\em MT-net}, which enables the meta-learner to learn on each layer's activation space a subspace that the task-specific learner performs gradient descent on. Additionally, a task-specific learner of an {\em MT-net} performs gradient descent with respect to a meta-learned distance metric, which warps the activation space to be more sensitive to task identity. We demonstrate that the dimension of this learned subspace reflects the complexity of the task-specific learner's adaptation task, and also that our model is less sensitive to the choice of initial learning rates than previous gradient-based meta-learning methods. Our method achieves state-of-the-art or comparable performance on few-shot classification and regression tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning to Generalize to Unseen Tasks with Bilevel Optimization

    cs.LG 2019-08 conditional novelty 4.0 of 10

    L2G, a bilevel training objective that evaluates an inner-loop gradient update on a second disjoint task, improves Prototypical and Relation Networks by one to five accuracy points on mini-ImageNet and tiered-ImageNet.

Pith tools