FastODT: A tree-based framework for efficient continual learning
Not on the map. Why?
Abstract (arXiv)
Machine learning models deployed in real-world settings must operate under evolving data distributions and constrained computational resources. This challenge is particularly acute in non-stationary domains such as energy time series, weather monitoring, and environmental sensing. To remain effective, models must support adaptability, continuous learning, and long-term knowledge retention. This paper introduces a oblivious tree-based model with Hoeffding bound controlling its growth. It seamlessly integrates rapid learning and inference with efficient memory management and robust knowledge preservation, thus allowing for online learning. Extensive experiments across energy and environmental sensing time-series benchmarks demonstrate that the proposed framework achieves performance competitive with, and in several cases surpassing, existing online and batch learning methods, while maintaining superior computational efficiency. Collectively, these results demonstrate that the proposed approach fulfills the core objectives of adaptability, continual updating, and efficient retraining without full model retraining. The framework provides a scalable and resource-aware foundation for deployment in real-world non-stationary environments where resources are constrained and sustained adaptation is essential.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 23 references that are in the map. First posted on arXiv 27 Feb 2026.
Builds on
6 of 23 references.
References · 6
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2024Continual Learning for Large Language Models: A Surveycited by 144
- 2018Extremely Fast Decision Treecited by 42
- 2015A review of learning vector quantization classifierscited by 11
- 2018Bayesian Incremental Learning for Deep Neural Networkscited by 6
Built on by
Not cited yet.