一种无需训练的高效数据集距离度量方法,能准确比较不同数据分布。
Lightspeed Geometric Dataset Distance via Sliced Optimal Transport
- 通过随机投影将数据分布映射为一维实数,实现快速计算
- 计算复杂度近线性,不受类别数量影响,支持无交集标签集
- 适用于迁移学习性能预测与数据增强效果评估
我们提出了一种模型无关、嵌入无关的数据集距离度量方法——切片最优传输数据集距离(s-OTDD),无需训练,对类别数量变化具有鲁棒性,并可处理不相交的标签集合。核心创新是矩变换投影(MTP),将标签表示为特征分布时映射为实数,从而将数据集转换为一维分布。s-OTDD 定义为在随机投影参数下投影分布间平均的 Wasserstein 距离。由于一维最优传输存在闭式解,s-OTDD 在数据点数量和特征维度上达到(近)线性复杂度,且与类别数量无关。该方法在几何意义清晰的投影基础上,与最优传输数据集距离高度相关,同时比现有度量更高效。此外,其与迁移学习中的性能差距及数据增强下的分类精度有良好相关性。
原文摘要 · Abstract (English)
We introduce sliced optimal transport dataset distance (s-OTDD), a model-agnostic, embedding-agnostic approach for dataset comparison that requires no training, is robust to variations in the number of classes, and can handle disjoint label sets. The core innovation is Moment Transform Projection (MTP), which maps a label, represented as a distribution over features, to a real number. Using MTP, we derive a data point projection that transforms datasets into one-dimensional distributions. The s-OTDD is defined as the expected Wasserstein distance between the projected distributions, with respect to random projection parameters. Leveraging the closed form solution of one-dimensional optimal transport, s-OTDD achieves (near-)linear computational complexity in the number of data points and feature dimensions and is independent of the number of classes. With its geometrically meaningful projection, s-OTDD strongly correlates with the optimal transport dataset distance while being more efficient than existing dataset discrepancy measures. Moreover, it correlates well with the performance gap in transfer learning and classification accuracy in data augmentation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。