LGMLMay 13, 2019

Hierarchically Structured Meta-learning

arXiv:1905.05301v2222 citations
Originality Incremental advance
AI Analysis

This addresses the problem of handling diverse tasks in meta-learning for researchers, but it is incremental as it builds on gradient-based meta-learning with hierarchical clustering.

The paper tackles task uncertainty and heterogeneity in meta-learning by proposing a hierarchically structured meta-learning (HSML) algorithm that tailors knowledge to different task clusters, achieving state-of-the-art performance in toy-regression and few-shot image classification problems.

In order to learn quickly with few samples, meta-learning utilizes prior knowledge learned from previous tasks. However, a critical challenge in meta-learning is task uncertainty and heterogeneity, which can not be handled via globally sharing knowledge among tasks. In this paper, based on gradient-based meta-learning, we propose a hierarchically structured meta-learning (HSML) algorithm that explicitly tailors the transferable knowledge to different clusters of tasks. Inspired by the way human beings organize knowledge, we resort to a hierarchical task clustering structure to cluster tasks. As a result, the proposed approach not only addresses the challenge via the knowledge customization to different clusters of tasks, but also preserves knowledge generalization among a cluster of similar tasks. To tackle the changing of task relationship, in addition, we extend the hierarchical structure to a continual learning environment. The experimental results show that our approach can achieve state-of-the-art performance in both toy-regression and few-shot image classification problems.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes