Summarizing Stream Data for Memory-Constrained Online Continual Learning

被引:0
|
作者
Gu, Jianyang [1 ,2 ]
Wang, Kai [2 ]
Jiang, Wei [1 ]
You, Yang [2 ]
机构
[1] Zhejiang Univ, Hangzhou, Peoples R China
[2] Natl Univ Singapore, Singapore, Singapore
基金
中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Replay-based methods have proved their effectiveness on online continual learning by rehearsing past samples from an auxiliary memory. With many efforts made on improving training schemes based on the memory, however, the information carried by each sample in the memory remains under-investigated. Under circumstances with restricted storage space, the informativeness of the memory becomes critical for effective replay. Although some works design specific strategies to select representative samples, by only employing a small number of original images, the storage space is still not well utilized. To this end, we propose to Summarize the knowledge from the Stream Data (SSD) into more informative samples by distilling the training characteristics of real images. Through maintaining the consistency of training gradients and relationship to the past tasks, the summarized samples are more representative for the stream data compared to the original images. Extensive experiments are conducted on multiple online continual learning benchmarks to support that the proposed SSD method significantly enhances the replay effects. We demonstrate that with limited extra computational overhead, SSD provides more than 3% accuracy boost for sequential CIFAR-100 under extremely restricted memory buffer. Code in https://github.com/vimar-gu/SSD.
引用
收藏
页码:12217 / 12225
页数:9
相关论文
共 50 条
  • [41] Flexible Intrusion Detection Systems for Memory-Constrained Embedded Systems
    Tabrizi, Farid Molazem
    Pattabiraman, Karthik
    2015 ELEVENTH EUROPEAN DEPENDABLE COMPUTING CONFERENCE (EDCC), 2015, : 1 - 12
  • [42] TASO: Time and Space Optimization for Memory-Constrained DNN Inference
    Wen, Yuan
    Anderson, Andrew
    Radu, Valentin
    O'Boyle, Michael F. P.
    Gregg, David
    2020 IEEE 32ND INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD 2020), 2020, : 199 - 208
  • [43] MEMORY-CONSTRAINED TASK SCHEDULING ON A NETWORK OF DUAL PROCESSORS.
    Fuchs, Ken
    Kafura, Dennis
    Journal of the ACM, 1985, 32 (01): : 102 - 129
  • [44] Tracking Recurrent Concepts Using Context in Memory-constrained Devices
    Bartolo Gomes, Joao
    Menasalvas, Ernestina
    Sousa, Pedro A. C.
    UBICOMM 2010: THE FOURTH INTERNATIONAL CONFERENCE ON MOBILE UBIQUITOUS COMPUTING, SYSTEMS, SERVICES AND TECHNOLOGIES, 2010, : 446 - 451
  • [45] Using Tabu Search for Optimization of Memory-Constrained Hybrid BIST
    Kruus, Helena
    Jervan, Gert
    Ubar, Raimund
    BEC 2008: 2008 INTERNATIONAL BIENNIAL BALTIC ELECTRONICS CONFERENCE, PROCEEDINGS, 2008, : 155 - 158
  • [46] Memory efficient data-free distillation for continual learning
    Li, Xiaorong
    Wang, Shipeng
    Sun, Jian
    Xu, Zongben
    PATTERN RECOGNITION, 2023, 144
  • [47] Partitioning Sporadic Task Systems upon Memory-Constrained Multiprocessors
    Baruah, Sanjoy
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2013, 12 (03)
  • [48] VOICE TO ACTION : SPOKEN LANGUAGE UNDERSTANDING FOR MEMORY-CONSTRAINED SYSTEMS
    Gupta, Ashutosh
    Jayasimha, Aditya
    Maghan, Aman
    Singh, Shatrughan
    Gowda, Dhananjaya
    Kim, Chanwoo
    2021 IEEE AUTOMATIC SPEECH RECOGNITION AND UNDERSTANDING WORKSHOP (ASRU), 2021, : 473 - 479
  • [49] Training of Deep Learning Pipelines on Memory-Constrained GPUs via Segmented Fused-Tiled Execution
    Xu, Yufan
    Raje, Saurabh
    Rountev, Atanas
    Sabin, Gerald
    Sukumaran-Rajam, Aravind
    Sadayappan, P.
    CC'22: PROCEEDINGS OF THE 31ST ACM SIGPLAN INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION, 2022, : 104 - 116
  • [50] Memory Bounds for Continual Learning
    Chen, Xi
    Papadimitriou, Christos
    Peng, Binghui
    2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 519 - 530