Marc Deisenroth, Jean Kaddour, Steindór Saemundsson
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Data-efficient learning algorithms are essential in many practical applications where data collection is expensive, e.g., in robotics due to the wear and tear. To address this problem, meta-learning algorithms use prior experience about tasks to learn new, related tasks efficiently. Typically, a set of training tasks is assumed given or randomly chosen. However, this setting does not take into account the sequential nature that naturally arises when training a model from scratch in reallife: how do we collect a set of training tasks in a data-efficient manner? In this work, we introduce task selection based on prior experience into a meta-learning algorithm by conceptualizing the learner and the active meta-learning setting using a probabilistic latent variable model. We provide empirical evidence that our approach improves data-efficiency when compared to strong baselines on simulated robotic experiments.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.08949")
get_code_for_paper("2007.08949")
have("2007.08949")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.08949.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.08949)
Connect an agent — have() is free.