CLEAR: Contrastive-Prototype Learning with Drift Estimation for Resource Constrained Stream Mining
Zhuoyi Wang, Yuqiao Chen, Chen Zhao, Yu Lin, Xujiang Zhao, Hemeng Tao, Yigong Wang, Latifur Khan
Abstract
Non-stationary data stream mining aims to classify large scale online instances that emerge continuously. The most apparent challenge compared with the offline learning manner is the issue of consecutive emergence of new categories, when tackling non-static categorical distribution. Non-stationary stream settings often appear in real-world applications, e.g., online classification in E-commerce systems that involves the incoming productions, or the summary of news topics on social networks (Twitter). Ideally, a learning model should be able to learn novel concepts from labeled data (in new tasks) and reduce the abrupt degradation of model performance on the old concept (also named catastrophic forgetting problem). In this work, we focus on improving the performance of the stream mining approach under the constrained resources, where both the memory resource of old data and labeled new instances are limited/scarce. We propose a simple yet efficient resource-constrained framework CLEAR to facilitate previous challenges during the one-pass stream mining. Specifically, CLEAR focuses on creating and calibrating the class representation (the prototype) in the embedding space. We first apply the contrastive-prototype learning on large amount of unlabeled data, and generate the discriminative prototype for each class in the embedding space. Next, for updating on new tasks/categories, we propose a drift estimation strategy to calibrate/compensate for the drift of each class representation, which could reduce the knowledge forgetting without storing any previous data. We perform experiments on public datasets (e.g., CUB200, CIFAR100) under stream setting, our approach is consistently and clearly better than many state-of-the-art methods, along with both the memory and annotation restriction.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 831def7e-e3ff-45c3-8e5b-847b3e3fac6dCited by top-tier papers6
- COCOA: Cross Modality Contrastive Learning for Sensor DataShohreh Deldari, Hao Xue, Aaqib Saeed, Daniel V. Smith et al.UbiComp 2022 · 88 citations
- Fairness-Aware Online Meta-learningChen Zhao, Feng Chen, Bhavani ThuraisinghamKDD 2021 · 27 citations
- Adaptive Fairness-Aware Online Meta-Learning for Changing EnvironmentsChen Zhao, Feng Mi, Xintao Wu, Kai Jiang et al.KDD 2022 · 20 citations
- Online Drift Detection with Maximum Concept DiscrepancyKe Wan, Yi Liang, Susik YoonKDD 2024 · 4 citations
- Evolving Proxy Kills Drift: Data-Efficient Streaming Time Series Anomaly DetectionQing Wei, Hao Miao, Yan Zhao, Kai Zheng et al.WWW 2026 · 1 citation
Related papers
- Non-exemplar Online Class-Incremental Continual Learning via Dual-Prototype Self-Augment and RefinementFushuo Huo, Wenchao Xu, Jingcai Guo, Haozhao Wang et al.AAAI 2024 · 25 citations
- Online Prototype Learning for Online Continual LearningYujie Wei, Jiaxin Ye, Zhizhong Huang, Junping Zhang et al.ICCV 2023 · 78 citations
- Progressive Prototype Evolving for Dual-Forgetting Mitigation in Non-Exemplar Online Continual LearningQiwei Li, Yuxin Peng, Jiahuan ZhouACM MM 2024 · 4 citations
- Incremental Learning in Online ScenarioJiangpeng He, Runyu Mao, Zeman Shao, Fengqing ZhuCVPR 2020
- Few-Sample and Adversarial Representation Learning for Continual Stream MiningZhuoyi Wang, Yigong Wang, Yu Lin, Evan Delord et al.WWW 2020 · 15 citations
