无需训练,用上下文学习解决仅有正样本的分类问题。
In-Context Positive-Unlabeled Learning

- 通过上下文学习直接推理,不需微调或迭代优化。
- 在20个半合成基准上平均AUC和准确率优于四种基线方法。
- 适合快速部署于多任务场景,尤其擅长处理标签不全的数据。
正例-无标签(PU)学习解决仅提供部分正样本及大量混合正负样本的二分类问题。现有方法通常需针对数据集训练或迭代优化,难以快速适应多任务需求。我们提出PUICL,一种基于预训练的Transformer模型,完全通过上下文学习实现PU分类。PUICL在由随机结构因果模型生成的合成PU数据集上进行预训练,覆盖多种特征-标签关系与类别先验配置。推理时,输入包含已知正样本和未标记样本,模型一次性输出未标记样本的类别概率,无需梯度更新或任务特定拟合。在20个源自UCI、OpenML和scikit-learn的半合成PU基准上,PUICL在平均AUC和准确率上超越四种标准基线,F1-score表现也具竞争力。结果表明,上下文学习范式可自然扩展至半监督的PU设置。
原文摘要 · Abstract (English)
Positive-unlabeled (PU) learning addresses binary classification when only a set of labeled positives is available alongside a pool of unlabeled samples drawn from a mixture of positives and negatives. Existing PU methods typically require dataset-specific training or iterative optimization, which limits their applicability when many tasks must be solved quickly or with little tuning. We introduce PUICL, a pretrained transformer that solves PU classification entirely through in-context learning. PUICL is pretrained on synthetic PU datasets generated from randomly instantiated structural causal models, exposing it to a wide range of feature-label relationships and class-prior configurations. At inference time, PUICL receives the labeled positives and the unlabeled samples as a single input and returns class probabilities for the unlabeled rows in one forward pass, with no gradient updates or per-task fitting. On 20 semi-synthetic PU benchmarks derived from the UCI Machine Learning Repository, OpenML, and scikit-learn, PUICL outperforms four standard PU learning baselines in average AUC and accuracy, and is competitive on F1-score. These results show that the in-context learning paradigm extends naturally beyond fully supervised tabular prediction to the semi-supervised PU setting.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。