REVIEW 4 cited by
Task2Vec: Task Embedding for 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
Signed reviews
read the original abstract
We introduce a method to provide vectorial representations of visual classification tasks which can be used to reason about the nature of those tasks and their relations. Given a dataset with ground-truth labels and a loss function defined over those labels, we process images through a "probe network" and compute an embedding based on estimates of the Fisher information matrix associated with the probe network parameters. This provides a fixed-dimensional embedding of the task that is independent of details such as the number of classes and does not require any understanding of the class label semantics. We demonstrate that this embedding is capable of predicting task similarities that match our intuition about semantic and taxonomic relations between different visual tasks (e.g., tasks based on classifying different types of plants are similar) We also demonstrate the practical value of this framework for the meta-task of selecting a pre-trained feature extractor for a new task. We present a simple meta-learning framework for learning a metric on embeddings that is capable of predicting which feature extractors will perform well. Selecting a feature extractor with task embedding obtains a performance close to the best available feature extractor, while costing substantially less than exhaustively training and evaluating on all available feature extractors.
Forward citations
Cited by 4 Pith papers
-
Strategy, Not Payoffs: A Behavioural Embedding of Normal-Form Games
A two-feature game embedding (Nash entropy and best-response switching) predicts cross-game transfer of fine-tuned LLMs on held-out games, outperforming game identity and published structural embeddings.
-
Transferability and Hardness of Supervised Classification Tasks
Conditional entropy between label sequences predicts task transferability and hardness without training any models, with strong correlations on CelebA, AwA2, and CUB.
-
Toward Understanding Catastrophic Forgetting in Continual Learning
Error rates of continual learning algorithms on a task sequence correlate strongly with the sum of individual task complexities, but not with the dissimilarity between consecutive tasks.
-
P2L: Predicting Transfer Learning for Images and Semantic Relations
A single weighted combination of log dataset size and feature-space distance, tuned on nine tasks, selects the best transfer source model in 13 of 21 held-out image and semantic relation tasks.
Discussion (0). Continue with ORCID to comment.