UniGeM: Unifying Data Mixing and Selection via Geometric Exploration and Mining
Changhao Wang, Yunfei Yu, Xinhao Yao, Jiaolong Yang, Riccardo Cantoro, Chaobo Li, Qing Cui, Jun Zhou
TL;DR
UniGeM proposes a geometry-inspired approach to data curation that unifies macro-distribution balancing and micro-quality selection as a manifold approximation problem. It operates in two stages: Stage-I Macro-Exploration uses stability-driven clustering to determine an intrinsic manifold resolution $K^*$ and global sampling budgets, while Stage-II Micro-Mining refines within each cluster via probe-based semantics, a structural penalty, and a cohesion gate to select high-quality, on-manifold samples. The framework is backed by a Wasserstein-based theoretical bound linking global quantization and local pruning, and is validated by training 8B and 16B MoE models on 100B tokens, yielding $2.0\times$ data efficiency and improved reasoning and multilingual generalization over baselines. Empirically, UniGeM outperforms adapted SOTA baselines on code benchmarks and exhibits robust cross-language generalization, with careful ablations showing the indispensable roles of both stages and the value of the intrinsic resolution, cohesion, and structure penalties. The work demonstrates that preserving manifold topology and local dependencies during data curation can meaningfully enhance large-model performance while reducing data requirements, suggesting practical pathways for scalable, structure-preserving data pipelines.
Abstract
The scaling of Large Language Models (LLMs) is increasingly limited by data quality. Most methods handle data mixing and sample selection separately, which can break the structure in code corpora. We introduce \textbf{UniGeM}, a framework that unifies mixing and selection by treating data curation as a \textit{manifold approximation} problem without training proxy models or relying on external reference datasets. UniGeM operates hierarchically: \textbf{Macro-Exploration} learns mixing weights with stability-based clustering; \textbf{Micro-Mining} filters high-quality instances by their geometric distribution to ensure logical consistency. Validated by training 8B and 16B MoE models on 100B tokens, UniGeM achieves \textbf{2.0$\times$ data efficiency} over a random baseline and further improves overall performance compared to SOTA methods in reasoning-heavy evaluations and multilingual generalization.
