Meta-Learning with Heterogeneous Tasks

Zhaofeng Si, Shu Hu, Kaiyi Ji, Siwei Lyu
10/24/2024
cs.LG

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

Meta-learning is a general approach to equip machine learning models with the ability to handle few-shot scenarios when dealing with many tasks. Most existing meta-learning methods work based on the assumption that all tasks are of equal importance. However, real-world applications often present heterogeneous tasks characterized by varying difficulty levels, noise in training samples, or being distinctively different from most other tasks. In this paper, we introduce a novel meta-learning method designed to effectively manage such heterogeneous tasks by employing rank-based task-level learning objectives, Heterogeneous Tasks Robust Meta-learning (HeTRoM). HeTRoM is proficient in handling heterogeneous tasks, and it prevents easy tasks from overwhelming the meta-learner. The approach allows for an efficient iterative optimization algorithm based on bi-level optimization, which is then improved by integrating statistical guidance. Our experimental results demonstrate that our method provides flexibility, enabling users to adapt to diverse task settings and enhancing the meta-learner's overall performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{si2024metalearning,
  title  = {Meta-Learning with Heterogeneous Tasks},
  author = {Zhaofeng Si and Shu Hu and Kaiyi Ji and Siwei Lyu},
  year   = {2024},
  eprint = {2410.18894},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.18894v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.18894.svg)](https://codeofpaper.com/paper/2410.18894)

Discussion