paper-with-me

Papers

Expert Training: Task Hardness Aware Meta-Learning for Few-Shot Classification

2020-07-13 · Yucan Zhou, Yu Wang, Jianfei Cai, Yu Zhou, QinGhua Hu, Weiping Wang

Deep neural networks are highly effective when a large number of labeled samples are available but fail with few-shot classification tasks. Recently, meta-learning methods have received much attention, which train a meta-learner on massive additional tasks to gain the knowledge to instruct the few-shot classification. Usually, the training tasks are randomly sampled and performed indiscriminately, often making the meta-learner stuck into a bad local optimum. Some works in the optimization of deep neural networks have shown that a better arrangement of training data can make the classifier converge faster and perform better. Inspired by this idea, we propose an easy-to-hard expert meta-training strategy to arrange the training tasks properly, where easy tasks are preferred in the first phase, then, hard tasks are emphasized in the second phase. A task hardness aware module is designed and integrated into the training procedure to estimate the hardness of a task based on the distinguishability of its categories. In addition, we explore multiple hardness measurements including the semantic relation, the pairwise Euclidean distance, the Hausdorff distance, and the Hilbert-Schmidt independence criterion. Experimental results on the miniImageNet and tieredImageNetSketch datasets show that the meta-learners can obtain better results with our expert training strategy.

📄 PDF Abstract BibTeX arXiv:2007.06240

Code (0)

등록된 구현이 없습니다.

Tasks

General ClassificationMeta-Learning

Similar Papers 제목 키워드 기반

MetaMoE: Diversity-Aware Proxy Selection for Privacy-Preserving Mixture-of-Experts Unification

2026-05-14 · Weisen Jiang, Shuhao Chen, Sinno Jialin Pan arxiv

Mixture-of-Experts (MoE) models scale capacity by combining specialized experts, but most existing approaches assume centralized access to training data. In practice, data are distributed across clients and cannot be sha…

Curriculum Meta-Learning for Next POI Recommendation

2021-08-14 · KDD 2021 8 · Yudong Chen, Xin Wang, Miao Fan, Jizhou Huang 외

Next point-of-interest (POI) recommendation is a hot research field where a recent emerging scenario, next POI to search recommendation, has been deployed in many online map services such as Baidu Maps. One of the key is…

Meta-Learning

Swift and Sure: Hardness-aware Contrastive Learning for Low-dimensional Knowledge Graph Embeddings

2022-01-03 · Kai Wang, Yu Liu, Quan Z. Sheng

Knowledge graph embedding (KGE) has shown great potential in automatic knowledge graph (KG) completion and knowledge-driven tasks. However, recent KGE models suffer from high training cost and large storage space, thus l…

Contrastive LearningGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graph Embeddings

On Hard Episodes in Meta-Learning

2021-10-21 · Samyadeep Basu, Amr Sharaf, Nicolo Fusi, Soheil Feizi

Existing meta-learners primarily focus on improving the average task accuracy across multiple episodes. Different episodes, however, may vary in hardness and quality leading to a wide gap in the meta-learner's performanc…

Meta-Learning

Model-Agnostic Meta Learning for Class Imbalance Adaptation

2026-04-20 · Hanshu Rao, Guangzeng Han, Xiaolei Huang arxiv

Class imbalance is a widespread challenge in NLP tasks, significantly hindering robust performance across diverse domains and applications. We introduce Hardness-Aware Meta-Resample (HAMR), a unified framework that adapt…