Paired Multimodal Scaling Laws
cs.LG, cs.AI
Submitted: 2026-09-28
Updated: 2026-09-28
Code: https://github.com/airsplay/lxmert
License: http://creativecommons.org/licenses/by/4.0/
The gist: Existing multimodal scaling laws fit multimodality terms empirically after testing and never vary how much data is multimodally paired at fixed data budgets.
Terminology
Abstract
Existing multimodal scaling laws fit multimodality terms empirically after testing and never vary how much data is multimodally paired at fixed data budgets. We investigate how, under the same total data per modality, changing the number of paired data affects loss curves in multimodal classification tasks. We train models in three different environments and run experiment sweeps varying data sizes and pairing budget. Pairing ratios have a dramatic impact on loss and this impact is directly tied to how much information synergy the task contains. Only paired data is able to reduce synergistic loss, while unpaired data can reduce redundant or unimodal information up until unimodal floors. Unlike traditional scaling laws where loss drops immediately in power law decay, synergy acquisition is gated, requiring a critical threshold of paired data before synergistic loss falls at all. We introduce a new family of multimodal scaling laws where total data-attributable loss is the sum of four individual power laws corresponding to the four different information channels of redundancy, a unique channel per modality, and synergy, and show how this law is both more theoretically sound and empirically valid across our experiments. This law predicts multimodal loss in our experiments more accurately than existing laws, with 3.2% error on fit tests versus 10.4% error for the best pairing extension of published laws.
Sources
- Efficient Online Data Mixing For Language Model Pre-Training
- Scaling Law Hypothesis for Multimodal Model
- Aioli: A Unified Optimization Framework for Language Model Data Mixing
- Deep Learning Scaling is Predictable, Empirically
- Adaptive Data Optimization: Dynamic Sample Selection with Scaling Laws
- Scaling Laws for Neural Language Models
- PiKE: Adaptive Data Mixing for Large-Scale Multi-Task Learning Under Low Gradient Conflicts
- RegMix: Data Mixture as Regression for Language Model Pre-training
- D-CPT Law: Domain-specific Continual Pre-Training Scaling Law for Large Language Models
- Scaling Laws for Optimal Data Mixtures
- Nonnegative Decomposition of Multivariate Information
- Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performance
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks