mlsanityData to 14 Oct 2026

Transfer Learning in High-Dimensional Clustering: Minimax Thresholds and Applications in Single-Cell Data

arXiv 2607.25031 ↗First posted 27 Jul 2026math.ST stat.ME stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Clustering is a fundamental problem in statistics, with applications across many scientific disciplines. In many modern applications involving clustering, the primary dataset (the target data) is accompanied by related datasets (the source data). Transferring information from such sources may improve clustering accuracy in the target, making transfer learning for clustering practically important. Despite recent progress, the conditions under which source data improve target clustering remain unclear in high-dimensional settings, even for the canonical Gaussian mixture model. In this paper, we study the clustering problem in a two-community Gaussian mixture model where relatedness is captured by the geometric alignment of the target and source cluster means. We develop a minimax-optimal transfer-assisted clustering procedure and characterize, up to logarithmic factors, the phase transition for consistent target clustering in terms of the signal-to-noise ratios, sample sizes, ambient dimension, and degree of alignment between the datasets. The technique is also extended to adaptively choose between the target-only or the source assisted clustering depending on the target signal strength. Furthermore, we also extend our techniques to accommodate multiple communities and and multiple source datasets. Extensive simulations and an analysis of a human lung single-cell RNA-sequencing atlas demonstrate the practical effectiveness of our methods.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 57 references that are in the map. First posted on arXiv 27 Jul 2026.

Builds on

3 of 57 references.

References · 3

  1. 2016Statistical and Computational Guarantees of Lloyd's Algorithm and its Variantscited by 54
  2. 2025Stacked SVD or SVD stacked? A Random Matrix Theory perspective on data integrationcited by 6
  3. 2025MoDaH achieves rate optimal batch correctioncited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.