R&B: Domain Regrouping and Data Mixture Balancing for Efficient Foundation Model Training
원문 초록
Data mixing strategies have successfully reduced the costs involved in training language models. While promising, such methods suffer from two flaws. First, they rely on predetermined data domains (e.g., data sources, task types), which may fail to capture critical semantic nuances, leaving performance on the table. Second, these methods scale with the number of domains in a computationally prohibitive way. We address these challenges via R&B, a framework that re-partitions training data based on semantic similarity (Regroup) to create finer-grained domains, and efficiently optimizes the data composition (Balance) by leveraging a Gram matrix induced by domain gradients obtained throughout training. Unlike prior works, it removes the need for additional compute to obtain evaluation information such as losses or gradients. We analyze this technique under standard regularity conditions and provide theoretical insights that justify R&B's effectiveness compared to non-adaptive mixing approaches. Empirically, we demonstrate the effectiveness of R&B on five diverse datasets ranging from natural language to reasoning and multimodal tasks. With as little as 0.01% additional compute overhead, R&B matches or exceeds the performance of state-of-the-art data mixing strategies.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
FA: Forced Prompt Learning of Vision-Language Models for Out-of-Distribution Detection
ImpliRet: Benchmarking the Implicit Fact Retrieval Challenge
Inv-Entropy: A Fully Probabilistic Framework for Uncertainty Quantification in Language Models
Trend-Aware Fashion Recommendation with Visual Segmentation and Semantic Similarity
KNN-Defense: Defense against 3D Adversarial Point Clouds using Nearest-Neighbor Search
IRT-Router: Effective and Interpretable Multi-LLM Routing via Item Response Theory
토론
이 논문과 연결된 포럼 글이 아직 없습니다.