Task Agnostic Meta-Learning for Few-Shot Learning
Open accessAbstract
Meta-learning approaches have been proposed to tackle the few-shot learning problem. Typically, a meta-learner is trained on a variety of tasks in the hopes of being generalizable to new tasks. However, the generalizability on new tasks of a meta-learner could be fragile when it is over-trained on existing tasks during meta-training phase. In other words, the initial model of a meta-learner could be too biased towards existing tasks to adapt to new tasks, especially when only very few examples are available to update the model. To avoid a biased meta-learner and improve its generalizability, we propose a novel paradigm of Task-Agnostic Meta-Learning (TAML) algorithms. Specifically, we present an entropy-based approach that meta-learns an unbiased initial model with the largest uncertainty over the output labels by preventing it from over-performing in classification tasks. Alternatively, a more general inequality-minimization TAML is presented for more ubiquitous scenarios by directly minimizing the inequality of initial losses beyond the classification tasks wherever a suitable loss can be defined. Experiments on benchmarked datasets demonstrate that the proposed approaches outperform compared meta-learning algorithms in both few-shot classification and reinforcement learning tasks.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
MoE models, notably Mixtral 8x7B, have superior pretraining speed compared to dense models.
“MoE models, notably Mixtral 8x7B, are renowned for their superior pretraining speed compared to dense models”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
A distinguishing characteristic of MoE models is flexibility in managing large datasets, capable of amplifying model capacity by over a thousand times while only experiencing minor reductions in computational efficiency.
“A distinguishing characteristic of MoE models is their flexibility in managing large datasets, capable of amplifying model capacity by over a thousand times while only experiencing minor reductions in computational efficiency [289], [292].”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
MoE models face challenges in fine-tuning and require substantial memory for inference due to necessity of loading all experts into VRAM.
“However, they face challenges in fine-tuning and require substantial memory for inference due to the necessity of loading all experts into Video Random Access Memory (VRAM) [289], [290], [110].”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
Experimental evidence suggests that routers learn to route inputs according to data clusters, demonstrating their potential in real-world applications.
“Experimental evidence suggests that routers learn to route inputs according to data clusters, demonstrating their potential in real-world applications [295], [289].”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
Core concept and structure of MoE models lie in dynamic routing and specialization capabilities, offering promising avenues for scaling up neural networks and enhancing efficiency and adaptability in various tasks, but robustness of router must be protected against adversarial attacks.
“The core concept and structure of MoE models lie in their dynamic routing and specialization capabilities, offering promising avenues for scaling up neural networks and enhancing their efficiency and adaptability in various tasks, but the robustness of the router must be protected against adversarial attacks [289], [298].”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
The router network in MoE layers plays a pivotal role in achieving load balance, which is fundamental to the stability and overall performance of MoE models.
“with the router network in MoE layers, responsible for selecting the appropriate experts for processing specific tokens, playing a pivotal role in achieving this balance, which is fundamental to the stability and overall performance of MoE models [293], [289], [288], [300], [110].”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
Expert capacity management strategies regulate the processing abilities of individual experts by setting thresholds on the number of tokens each can handle, effectively averting bottlenecks and ensuring more efficient model operation, leading to improved training processes and heightened performance during complex computational tasks.
“Concurrently, the integration of expert capacity management strategies, emerges as a crucial approach in MoE models to regulate the processing abilities of individual experts by setting thresholds on the number of tokens each can handle, effectively averting bottlenecks and ensuring a more efficient and streamlined model operation, leading to improved training processes and heightened performance”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
Effective load balancing is essential in MoE models to guarantee a uniform distribution of computational load among experts.
“Effective load balancing is essential in MoE models to guarantee a uniform distribution of computational load among experts”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
MoE models face hurdles in fine-tuning and demand considerable VRAM for inference because all experts must be loaded.
“yet they face hurdles in fine-tuning and demand considerable VRAM for inference, owing to the requirement of loading all experts [289], [290], [110].”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
Models like Mixtral and Switch Transformer, with over 1.6 trillion parameters, achieved computational efficiency equivalent to a 10 billion-parameter dense model, because they benefited from the sublinear scaling of MoE compute versus model size, leading to substantial accuracy gains within fixed compute budgets.
“Notably, models like Mixtral and Switch Transformer, with over 1.6 trillion parameters, achieved computational efficiency equivalent to a 10 billion-parameter dense model, because they benefited from the sublinear scaling of MoE compute versus model size, leading to substantial accuracy gains within fixed compute budgets [21], [289], [287], [110].”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
Recent advancements in MoE architecture have resulted in notable training cost efficiencies, especially in encoder-decoder models, with cost savings up to fivefold in certain contexts compared to dense models.
“Recent advancements in MoE architecture have resulted in notable training cost efficiencies, especially in encoder-decoder models, with evidence showing cost savings of up to fivefold in certain contexts when compared to dense models [21], [289], [298], [287].”
From From Google Gemini to OpenAI Q* (Q-Star): A Survey on Reshaping the Generative Artificial Intelligence (AI) Research Landscape (2025) · cites this paper as [289]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357 · see citing works
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
Finn, C., Abbeel, P., & Levine, S. (2017) · arXiv · doi:10.48550/arxiv.1703.03400 · Cited by 8,512 · see citing works
Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning
Williams, R. J. (1992) · Machine Learning · doi:10.1007/bf00992696 · Cited by 7,936 · see citing works
On the measurement of inequality
Atkinson, A. B. (1970) · Journal of Economic Theory · doi:10.1016/0022-0531(70)90039-6 · Cited by 6,386 · see citing works
Matching Networks for One Shot LearningPreprint
Vinyals, O., Blundell, C., Lillicrap, T., Kavukcuoglu, K., & Wierstra, D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.04080 · Cited by 4,874 · see citing works
Trust region policy optimization
Schulman, J., Levine, S., Moritz, P., Jordan, M. I., & Abbeel, P. (2015) · arXiv · doi:10.48550/arxiv.1502.05477 · Cited by 4,578 · see citing works
Learning to learn by gradient descent by gradient descent
Andrychowicz, M., Denil, M., Gomez, S., Hoffman, M. W., Pfau, D., Schaul, T., Shillingford, B., & de Freitas, N. (2016) · arXiv · doi:10.48550/arxiv.1606.04474 · Cited by 1,486 · see citing works
On First-Order Meta-Learning Algorithms
Nichol, A., Achiam, J., & Schulman, J. (2018) · arXiv · doi:10.48550/arxiv.1803.02999 · Cited by 1,438 · see citing works
Thrun, S., & Pratt, L. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5529-2 · Cited by 1,291 · see citing works
Allison, P. D. (1978) · American Sociological Review · doi:10.2307/2094626 · Cited by 1,133 · see citing works
Benchmarking Deep Reinforcement Learning for Continuous Control
Duan, Y., Chen, X., Houthooft, R., Schulman, J., & Abbeel, P. (2016) · arXiv · doi:10.48550/arxiv.1604.06778 · Cited by 1,114 · see citing works
Meta-SGD: Learning to Learn Quickly for Few-Shot LearningPreprint
Li, Z., Zhou, F., Chen, F., & Li, H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.09835 · Cited by 1,026 · see citing works
Towards a Neural StatisticianPreprint
Edwards, H., & Storkey, A. (2016) · International Conference on Learning Representations · doi:10.48550/arxiv.1606.02185 · Cited by 450 · see citing works
One-shot Learning with Memory-Augmented Neural NetworksPreprint
Santoro, A., Bartunov, S., Botvinick, M., Wierstra, D., & Lillicrap, T. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.06065 · Cited by 435 · see citing works
Learning to Remember Rare EventsPreprint
Kaiser, Ł., Nachum, O., Roy, A., & Samy Bengio, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.03129 · Cited by 296 · see citing works
Meta-neural networks that learn by learning
Naik, D., & Mammone, R. J. (2003) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1992.287172 · Cited by 191 · see citing works
Learning to OptimizePreprint
Li, K., & Malik, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.01885 · Cited by 159 · see citing works
Generalized entropy and the measurement of distributional change
Cowell, F. (1980) · European Economic Review · doi:10.1016/0014-2921(80)90051-3 · Cited by 129 · see citing works
Meta NetworksPreprint
Munkhdalai, T., & Yu, H. Z. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.00837 · Cited by 7 · see citing works
Flagged first, then by citations
Research works printed but not linked: 4
- Sachin Ravi and Hugo Larochelle. Optimization as a model for few-shot learning. In In International Conference on Learning Representations (ICLR), 2017.
- Jurgen Schmidhuber. Evolutionary principles in self-referential learning. on learning now to learn: The meta-meta-meta...-hook. Diploma thesis, Technische Universitat Munchen, Germany, 14 May 1987.
- Nikhil Mishra, Mostafa Rohaninejad, Xi Chen, and Pieter Abbeel. A simple neural attentive meta-learner. In International Conference on Learning Representations, 2018.
- Jake Snell, Kevin Swersky, and Richard Zemel. Prototypical networks for few-shot learning. In Advances in Neural Information Processing Systems, 2017.
Cited by
Sorted by citations
A Comprehensive Survey of Few-shot Learning: Evolution, Applications, Challenges, and Opportunities
Song, Y., Wang, T., Cai, P., Mondal, S. K., & Sahoo, J. P. (2023) · ACM Computing Surveys · doi:10.1145/3582688 · Cited by 721 · see citing works
Meta-Learning with Task-Adaptive Loss Function for Few-Shot Learning
Baik, S., Choi, J., Kim, H., Cho, D., Min, J., & Lee, K. M. (2021) · 2021 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.00933 · Cited by 163 · see citing works
McIntosh, T. R., Susnjak, T., Liu, T., Watters, P., Xu, D., Liu, D., & Halgamuge, M. N. (2025) · Technologies · doi:10.3390/technologies13020051 · Cited by 102 · see citing works
“It focuses on few-shot generalization, enabling AI to handle a wide range of tasks with minimal data, underlining its importance in developing versatile and adaptable AI systems [255], [256], [254], [257].”
BackgroundGeneralization of Forgery Detection With Meta Deepfake Detection Model
Tran, V.-N., Kwon, S.-G., Lee, S.-H., Le, H.-S., & Kwon, K.-R. (2023) · IEEE Access · doi:10.1109/access.2022.3232290 · Cited by 47 · see citing works
“TAML [44], which prevents the problem that the model can be biased over some tasks during adapting to new tasks with metalearning technique, especially the tasks that are sampled in the meta-training phase.”
Background
- Authors
- Jamal, M. A., & Qi, G.-J.
- Affiliations
- University of Central Florida (US)
- Venue
- 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
- Publisher
- IEEE
- Published
- 2019-06
- Pages
- 11711-11719
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2804962156
- Cited by
- 519
- References
- 19
- Citations by year
- 2026: 27 · 2025: 64 · 2024: 78 · 2023: 107 · 2022: 96 · 2021: 91 · 2020: 45 · 2019: 7 · 2018: 4
- FWCI
- 22.86
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Keywords
- few-shot learning, uncertainty estimation, few-shot classification
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review