arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2509.17543stat.MLcs.LGstat.ME
收藏

双轴分布压缩:减少数据规模和维度性

Bilateral Distribution Compression: Reducing Both Data Size and Dimensionality

School of Mathematics, University of Bristol, Bristol, United Kingdom(布里斯托大学数学系);Mathematical Institute, University of Oxford, Oxford, United Kingdom(牛津大学数学研究所)

Dominic Broadbent, Nick Whiteley, Robert Allison, Tom Lovett

AI总结:

双轴分布压缩通过两阶段框架在降低数据规模和维度的同时保持分布特性,实现更高效的压缩与更优的下游任务性能。

摘要:

现有的分布压缩方法通过最小化原始集与压缩集之间的最大均值差异(MMD)来减少数据集中的观测数量,但现代数据集往往在样本规模和维度性上都很大。我们提出了双轴分布压缩(BDC),这是一种两阶段框架,能够在两个轴上压缩的同时保持底层分布,整体在数据集规模和维度上具有线性的时间和内存复杂度。BDC的核心是解码MMD(DMMD),我们引入它来量化原始数据与从低维潜在空间解码出的压缩集之间的差异。BDC通过(i)使用重建MMD(RMMD)学习低维投影,(ii)使用编码MMD(EMMD)优化潜在压缩集。我们证明该过程最小化了DMMD,保证压缩集忠实代表原始分布。实验表明,BDC可以在显著更低的成本下,以显著更高的压缩率实现与环境空间压缩相当或更优的下游任务性能。

英文摘要:

Existing distribution compression methods reduce the number of observations in a dataset by minimising the Maximum Mean Discrepancy (MMD) between original and compressed sets, but modern datasets are often large in both sample size and dimensionality. We propose Bilateral Distribution Compression (BDC), a two-stage framework that compresses along both axes while preserving the underlying distribution, with overall linear time and memory complexity in dataset size and dimension. Central to BDC is the Decoded MMD (DMMD), which we introduce to quantify the discrepancy between the original data and a compressed set decoded from a low-dimensional latent space. BDC proceeds by (i) learning a low-dimensional projection using the Reconstruction MMD (RMMD), and (ii) optimising a latent compressed set with the Encoded MMD (EMMD). We show that this procedure minimises the DMMD, guaranteeing that the compressed set faithfully represents the original distribution. Experiments show that BDC can achieve comparable or superior downstream task performance to ambient-space compression at substantially lower cost and with significantly higher rates of compression.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑