arXiv:2412.13495cs.LGcs.AI2024-12中稿 · AAAI被引 4

在不共享数据的前提下,实现分布式数据的高维可视化。

Federated t-SNE and UMAP for Distributed Data Visualization

  • 通过联邦学习隐式学习数据分布,估算全局距离矩阵。
  • 在多个数据集上测试,精度损失极小,仅下降1%~3%。
  • 适合隐私敏感场景,如医疗、金融等跨机构数据协作。

高维数据可视化在大数据时代至关重要,t-SNE和UMAP等技术已被广泛应用于科学与工程领域。然而,大数据通常分布在多个数据中心,面临安全与隐私问题,导致标准的t-SNE和UMAP算法难以应用。为此,本文提出Fed-tSNE和Fed-UMAP,可在联邦学习框架下实现高维数据可视化,无需在客户端间交换数据或向中心服务器发送原始数据。核心思想是通过联邦学习隐式学习数据分布,并据此估计t-SNE和UMAP所需的全局距离矩阵。为进一步增强隐私保护,提出Fed-tSNE+和Fed-UMAP+。同时将该思路扩展至联邦谱聚类,实现分布式数据聚类。此外,本文提供了优化收敛性、距离与相似性估计及差分隐私的理论保证。多组实验表明,与原算法相比,联邦算法精度下降极小(1%~3%),性能表现优异。

原文摘要 · Abstract (English)

High-dimensional data visualization is crucial in the big data era and these techniques such as t-SNE and UMAP have been widely used in science and engineering. Big data, however, is often distributed across multiple data centers and subject to security and privacy concerns, which leads to difficulties for the standard algorithms of t-SNE and UMAP. To tackle the challenge, this work proposes Fed-tSNE and Fed-UMAP, which provide high-dimensional data visualization under the framework of federated learning, without exchanging data across clients or sending data to the central server. The main idea of Fed-tSNE and Fed-UMAP is implicitly learning the distribution information of data in a manner of federated learning and then estimating the global distance matrix for t-SNE and UMAP. To further enhance the protection of data privacy, we propose Fed-tSNE+ and Fed-UMAP+. We also extend our idea to federated spectral clustering, yielding algorithms of clustering distributed data. In addition to these new algorithms, we offer theoretical guarantees of optimization convergence, distance and similarity estimation, and differential privacy. Experiments on multiple datasets demonstrate that, compared to the original algorithms, the accuracy drops of our federated algorithms are tiny.

联邦学习数据可视化隐私保护聚类

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。