Clustered Task-Aware Meta-Learning by Learning from Learning Paths
To enable effective learning of new tasks with only few samples, meta-learning acquires common knowledge from the existing tasks with a globally shared meta-learner. To further address the problem of task heterogeneity, recent developments balance between customization and generalization by incorporating task clustering to generate the task-aware modulation to be applied on the global meta-learner. However, these methods learn task representation mostly from the features of input data, while the task-specific optimization process with respect to the base-learner model is often neglected. In this work, we propose a Clustered Task-Aware Meta-Learning (CTML) framework with task representation learned from its own learning path. We first conduct a rehearsed task learning from the common initialization, and collect a set of geometric quantities that adequately describes this learning path. By inputting this set of values into a meta path learner, we automatically abstract path representation optimized for the downstream clustering and modulation. To further save the computational cost incurred by the additional rehearsed learning, we devise a shortcut tunnel to directly map between the path and feature cluster assignments. Extensive experiments on two real-world application domains: few-shot image classification and cold-start recommendation demonstrate the superiority of CTML compared to state-of-the-art baselines.
Code (1)
Tasks
ClusteringFew-Shot Image Classificationimage-classificationImage ClassificationMeta-LearningSimilar Papers 제목 키워드 기반
Metapath- and Entity-aware Graph Neural Network for Recommendation
In graph neural networks (GNNs), message passing iteratively aggregates nodes' information from their direct neighbors while neglecting the sequential nature of multi-hop node connections. Such sequential node connection…
Graph Neural NetworkLink PredictionRecommendation SystemsAutomatic Meta-Path Discovery for Effective Graph-Based Recommendation
Heterogeneous Information Networks (HINs) are labeled graphs that depict relationships among different types of entities (e.g., users, movies and directors). For HINs, meta-path-based recommenders (MPRs) utilize meta-pat…
Recommendation SystemsAspect-Aware MOOC Recommendation in a Heterogeneous Network
MOOC recommendation systems have received increasing attention to help learners navigate and select preferred learning content. Traditional methods such as collaborative filtering and content-based filtering suffer from …
Collaborative FilteringRecommendation SystemsGraph Neural NetworkMeta-node: A Concise Approach to Effectively Learn Complex Relationships in Heterogeneous Graphs
Existing message passing neural networks for heterogeneous graphs rely on the concepts of meta-paths or meta-graphs due to the intrinsic nature of heterogeneous graphs. However, the meta-paths and meta-graphs need to be …
Contrastive LearningGraph LearningNode ClusteringFeature Learning for Meta-Paths in Knowledge Graphs
In this thesis, we study the problem of feature learning on heterogeneous knowledge graphs. These features can be used to perform tasks such as link prediction, classification and clustering on graphs. Knowledge graphs p…
ClusteringGraph EmbeddingKnowledge GraphsLink Prediction