Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.13276 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910052459216896 |
|---|---|
| author | Bretsko, Daniel Walas, Piotr Khulbe, Devashish Stros, Sebastian Sobolevsky, Stanislav Satura, Tomas |
| author_facet | Bretsko, Daniel Walas, Piotr Khulbe, Devashish Stros, Sebastian Sobolevsky, Stanislav Satura, Tomas |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_13276 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | FastODT: A tree-based framework for efficient continual learning Bretsko, Daniel Walas, Piotr Khulbe, Devashish Stros, Sebastian Sobolevsky, Stanislav Satura, Tomas Machine Learning Artificial Intelligence 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. |
| title | FastODT: A tree-based framework for efficient continual learning |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2603.13276 |