Bridging Streaming Continual Learning via In-Context Large Tabular Models
Not on the map. Why?
Abstract (arXiv)
In streaming scenarios, models must learn continuously, adapting to concept drifts without erasing previously acquired knowledge. However, existing research communities address these challenges in isolation. Continual Learning (CL) focuses on long-term retention and mitigating catastrophic forgetting, often without strict real-time constraints. Stream Learning (SL) emphasizes rapid, efficient adaptation to high-frequency data streams, but typically neglects forgetting. Recent efforts have tried to combine these paradigms, yet no clear algorithmic overlap exists. We argue that large in-context tabular models (LTMs) provide a natural bridge for Streaming Continual Learning (SCL). In our view, unbounded streams should be summarized on-the-fly into compact sketches that can be consumed by LTMs. This recovers the classical SL motivation of compressing massive streams with fixed-size guarantees, while simultaneously aligning with the experience-replay desiderata of CL. To clarify this bridge, we show how the SL and CL communities implicitly adopt a divide-to-conquer strategy to manage the tension between plasticity (performing well on the current distribution) and stability (retaining past knowledge), while also imposing a minimal complexity constraint that motivates diversification (avoiding redundancy in what is stored) and retrieval (re-prioritizing past information when needed). Within this perspective, we propose structuring SCL with LTMs around two core principles of data selection for in-context learning: (1) distribution matching, which balances plasticity and stability, and (2) distribution compression, which controls memory size through diversification and retrieval mechanisms.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 76 of its 129 references that are in the map. First posted on arXiv 12 Dec 2025.
Builds on
76 of 129 references.
References · 76
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
- 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 643
- 2021Learning To Retrieve Prompts for In-Context Learningcited by 641
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
- 2018End-to-End Incremental Learningcited by 596
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
38 more
- 2020Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamicscited by 423
- 2022Anomaly Detection via Reverse Distillation from One-Class Embeddingcited by 419
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2022Dynamic Prompt Learning via Policy Gradient for Semi-structured Mathematical Reasoningcited by 347
- 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
- 2019Continual learning with hypernetworkscited by 267
- 2025TabICL: A Tabular Foundation Model for In-Context Learning on Large Datacited by 267
- 2024A Survey on Data Selection for Language Modelscited by 230
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
- 2020Mnemonics Training: Multi-Class Incremental Learning without Forgettingcited by 220
- 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 218
- 2018Adversarially Learned One-Class Classifier for Novelty Detectioncited by 202
- 2022Active Example Selection for In-Context Learningcited by 195
- 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 191
- 2023The Dormant Neuron Phenomenon in Deep Reinforcement Learningcited by 171
- 2023Understanding plasticity in neural networkscited by 170
- 2022Self-Adaptive In-Context Learning: An Information Compression Perspective for In-Context Example Selection and Orderingcited by 158
- 2020Continual Prototype Evolution: Learning Online from Non-Stationary Data Streamscited by 143
- 2022Diverse Demonstrations Improve In-context Compositional Generalizationcited by 136
- 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 132
- 2023Finding Support Examples for In-Context Learningcited by 104
- 2024Why Tabular Foundation Models Should Be a Research Prioritycited by 103
- 2017Online Deep Learning: Learning Deep Neural Networks on the Flycited by 86
- 2020Optimal Continual Learning has Perfect Memory and is NP-hardcited by 86
- 2021Continual Backprop: Stochastic Gradient Descent with Persistent Randomnesscited by 79
- 2022A Theoretical Study on Solving Continual Learningcited by 78
- 2023In-Context Learning with Iterative Demonstration Selectioncited by 74
- 2022On the Relation between Sensitivity and Accuracy in In-context Learningcited by 71
- 2023Theory on Forgetting and Generalization of Continual Learningcited by 69
- 2023Data Pruning via Moving-one-Sample-outcited by 67
- 2023Statistical Foundations of Prior-Data Fitted Networkscited by 59
- 2024Retrieval & Fine-Tuning for In-Context Tabular Modelscited by 58
- 2022Continual evaluation for lifelong learning: Identifying the stability gapcited by 55
- 2019Routing Networks and the Challenges of Modular and Compositional Computationcited by 49
- 2024Addressing Loss of Plasticity and Catastrophic Forgetting in Continual Learningcited by 49
- 2021Natural continual learning: success is a journey, not (just) a destinationcited by 46
- 2021A study on the plasticity of neural networkscited by 44
- 2018Extremely Fast Decision Treecited by 42
50 most cited of 76 All 76 (JSON)
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026Pitfalls of Unlabeled Disagreement-Based Drift Detection in Streaming Tree Ensemblescited by 2
- 2026Axle Sensor Fusion for Online Continual Wheel Fault Detection in Wayside Railway Monitoringcited by 1
- 2026Tree of Concepts: Interpretable Continual Learners in Non-Stationary Clinical Domainscited by 1
- 2026Bounded Context Management for Tabular Foundation Models on Stream Learningcited by 1
- 2026Streaming Hierarchical Inference with Tabular Foundation Modelscited by 1
- 2026Collaborative Streaming Anomaly Detection with Interactive Explanations and Ensemble Consensuscited by 0
- 2026Collaborative Streaming Anomaly Detection with Interactive Explanations and Ensemble Consensus20 Sep 2026
- 2026Streaming Hierarchical Inference with Tabular Foundation Models7 Sep 2026
- 2026Bounded Context Management for Tabular Foundation Models on Stream Learning17 Jun 2026
- 2026Pitfalls of Unlabeled Disagreement-Based Drift Detection in Streaming Tree Ensembles12 May 2026
- 2026Tree of Concepts: Interpretable Continual Learners in Non-Stationary Clinical Domains18 Apr 2026
- 2026Axle Sensor Fusion for Online Continual Wheel Fault Detection in Wayside Railway Monitoring18 Feb 2026