Skip to content
Preprint

Labeled-Data-Free Meta-Learning: Efficient Task Generation Using Pre-trained Models and Unlabeled Data

Jul 2026 · 0 citations · 33 references
Computer Science

TL;DR

This work proposes a novel meta-learning setting that avoids model inversion by jointly leveraging pre-trained models and unlabeled data and introduces a task-weighting mechanism based on task confidence and class distribution balance to ensure effective meta-learning.

Abstract

Meta-learning without labeled data is crucial for real-world applications, where obtaining labeled datasets can be expensive or restricted due to privacy concerns. Data-Free Meta-Learning (DFML) addresses this challenge by leveraging pre-trained models without access to training data. However, existing DFML methods rely on model inversion to generate training data, a process that is generally difficult and computationally expensive due to the need to generate high-dimensional data matching the original distribution. To address this limitation, we propose a novel meta-learning setting that avoids model inversion by jointly leveraging pre-trained models and unlabeled data. Our method generates meta-training tasks by assigning soft labels from pre-trained models to unlabeled data. Since the quality of these tasks can vary, we introduce a task-weighting mechanism based on task confidence and class distribution balance to ensure effective meta-learning. Extensive experiments demonstrate that our approach substantially reduces computational cost and improves generalization, achieving up to 104-fold speedup and 8.4 percent to 36.4 percent improvements in few-shot classification accuracy compared to state-of-the-art DFML methods.

View source

Similar papers

Open access Aug 2026

Weakly-Supervised Learning with Partial Multi-Labels by Leveraging Dual Label Correlation Perspectives

A novel PML method, namely Wasserstein Partial Multi-Label Learning with dual Label Correlation Perspectives (Wpml3cp), solved by the gradient descent with an augmented Lagrange multiplier technique, and empirical results demonstrate that Wpml3cp and Wpml3cp-D can outperform the PML baselines in various noisy levels.

Xi-Ming Li, Yuanchao Dai, Bing Wang et al. · 0 citations
Preprint Aug 2026

C-Score: Beyond Accuracy for Robustness Assessment in Semi-Supervised Learning under Open-World Unlabeled Contamination

C-Score, a compact framework that evaluates training behavior in three complementary spaces: prediction, feature representation, and optimization, suggests that clean accuracy alone is insufficient for evaluating SSL robustness in open-world environments, and that internal diagnostic signals are necessary for more reli...

Tsao-Lun Chen, Chicheng Fu, Han-Yi Chou et al. · 0 citations
Review Open access 2026

Transfer Learning Approaches for Small-Scale Datasets

The results confirm that transfer learning is a core solution to the real-world problems that may be limited by available labeled data.

Sivesh Prasana, Karthick eyan · 0 citations
Preprint Aug 2026

PseudoMapLabeler: Confidence-Aware Pseudo-Label Generation for Semi-Supervised Online Mapping

This work proposes a teacher-student semi-supervised learning framework that generates high-quality pseudo-labels from unlabeled data through confidence-aware map refinement, and introduces a spatial clipping technique that selectively preserves high-confidence regions while removing unreliable segments.

Chikao Tsuchiya, Dhaval Bhanderi, David Ilstrup et al. · 0 citations
2025

ComRank: Ranking Loss for Multi-Label Complementary Label Learning

This work proposes ComRank, a ranking loss framework for MLCLL, which encourages complementary labels to be ranked lower than non-complementary ones, thereby modeling pairwise label relationships and ensures Bayes consistency under both uniform and biased cases.

Jin Zhu, Yi Gao, Miao Xu et al. · 0 citations
Open access Aug 2026

Label space reduction for transductive zero-shot classification with large language models

This work proposes distilling the model into a probabilistic classifier, enabling lightweight deployment without repeated LLM calls, and demonstrates that LSR improves macro-F1 scores by an average of 7.0% compared to standard zero-shot classification baselines.

Nathan Vandemoortele, Bram Steenwinckel, F. Ongenae et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.