提出可学习的几何集,实现无分布假设下正样本高覆盖率与负样本高效排除。
Contrastive Conformal Sets
- 引入可学习的广义超球约束构造覆盖集
- 在指定覆盖率下最大化负样本排除,提升包含-排除权衡
- 无需负样本对,适用于数据稀缺场景
对比学习通过拉近正样本、推远负样本来生成语义一致的特征嵌入。然而现有方法缺乏在语义空间中构建具有分布无关保证的几何集合的理论基础。本文将分位数预测扩展至该场景,提出配备可学习广义超球约束的覆盖集。所提方法在保证用户指定覆盖率的同时,最大化负样本排除能力。我们从理论上证明体积最小化是负样本排除的有效代理,使方法即使在无负样本对时仍有效运行。正样本包含性保证继承了分位数预测的无分布覆盖性质,而负样本排除则通过在预留训练集上优化学习到的集合几何实现。在模拟和真实图像数据集上的实验表明,相比标准距离基分位数基准,本方法在包含-排除权衡上表现更优。
原文摘要 · Abstract (English)
Contrastive learning produces coherent semantic feature embeddings by encouraging positive samples to cluster closely while separating negative samples. However, existing contrastive learning methods lack a principled construction of geometric sets in the semantic feature space with distribution-free guarantees at any user-specified coverage level. We extend conformal prediction to this setting by introducing covering sets equipped with learnable generalized hyper-ball constraints. We propose a method that constructs conformal sets guaranteeing user-specified coverage of positive samples while maximizing negative sample exclusion. We theoretically motivate volume minimization as a proxy for negative exclusion, enabling our approach to operate effectively even when negative pairs are unavailable. The positive inclusion guarantee inherits the distribution-free coverage property of conformal prediction, while negative exclusion is maximized through learned set geometry optimized on a held-out training split. Experiments on simulated and real-world image datasets demonstrate improved inclusion-exclusion trade-offs compared to standard distance-based conformal baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。