Longer Records, Broader Invariance: The Hidden Scaling Problem in Longitudinal Contrastive Learning
cs.LG, cs.AI
Submitted: 2026-09-29
Updated: 2026-09-29
Comments: 53 pages, 6 figures, 54 tables
License: http://creativecommons.org/licenses/by/4.0/
The gist: Longitudinal data are valuable because people change.
Terminology
Abstract
Longitudinal data are valuable because people change. Yet the objectives used to learn from these data can inadvertently erase that change. In person-level contrastive learning, observations from the same person are treated as positives; as records grow, those positives can span increasingly distant---and increasingly different---behavioral states. More history can therefore produce not only more data, but broader invariance. We show that this distinction is fundamental. We separate record span, how much history the learner sees, from supervision span, how far across that history positive-pair supervision reaches. Across in-home sensing records spanning up to 2.7 years, broader supervision systematically suppresses recoverable changing-state information, even when the available history is held fixed. At the broadest span, less than 10% of the information recoverable from an untrained encoder remains. Yet keeping positives local is not sufficient: as records grow, even distant states that are never paired become increasingly similar. Explicitly contrasting other observations from the same person reverses this loss without shortening the record, revealing a second route by which longitudinal scale can broaden invariance. Finally, we prospectively reproduce the supervision-span effect in 199 GLOBEM participants. Longitudinal scale therefore presents a choice: more history need not mean more invariance. By controlling what is held invariant as records grow, we can preserve the change that made the longitudinal data valuable in the first place.
Sources
- Large-scale Training of Foundation Models for Wearable Biosignals
- Training Compute-Optimal Large Language Models
- Scaling Laws for Neural Language Models
- Representation Learning with Contrastive Predictive Coding
- What Should Not Be Contrastive in Contrastive Learning
- A Theory of Usable Information Under Computational Constraints
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