Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysis

被引:59
|
作者
Hayes, Tyler L. [1 ]
Kanan, Christopher [1 ,2 ,3 ]
机构
[1] Rochester Inst Technol, Rochester, NY 14623 USA
[2] Paige, New York, NY USA
[3] Cornell Tech, New York, NY USA
来源
2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION WORKSHOPS (CVPRW 2020) | 2020年
基金
美国国家科学基金会;
关键词
NEURAL-NETWORK; ARTMAP; CLASSIFICATION;
D O I
10.1109/CVPRW50498.2020.00118
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
When an agent acquires new information, ideally it would immediately be capable of using that information to understand its environment. This is not possible using conventional deep neural networks, which suffer from catastrophic forgetting when they are incrementally updated, with new knowledge overwriting established representations. A variety of approaches have been developed that attempt to mitigate catastrophic forgetting in the incremental batch learning scenario, where a model learns from a series of large collections of labeled samples. However, in this setting, inference is only possible after a batch has been accumulated, which prohibits many applications. An alternative paradigm is online learning in a single pass through the training dataset on a resource constrained budget, which is known as streaming learning. Streaming learning has been much less studied in the deep learning community. In streaming learning, an agent learns instances one-by-one and can be tested at any time, rather than only after learning a large batch. Here, we revisit streaming linear discriminant analysis, which has been widely used in the data mining research community. By combining streaming linear discriminant analysis with deep learning, we are able to outperform both incremental batch learning and streaming learning algorithms on both ImageNet ILSVRC-2012 and CORe50, a dataset that involves learning to classify from temporally ordered samples(1).
引用
收藏
页码:887 / 896
页数:10
相关论文
共 50 条
  • [31] Sparse overlapped linear discriminant analysis
    Anzarmou, Youssef
    Mkhadri, Abdallah
    Oualkacha, Karim
    TEST, 2023, 32 (01) : 388 - 417
  • [32] ADHERENTLY PENALIZED LINEAR DISCRIMINANT ANALYSIS
    Hino, Hideitsu
    Fujiki, Jun
    JOURNAL JAPANESE SOCIETY OF COMPUTATIONAL STATISTICS, 2015, 28 (01): : 125 - 137
  • [33] Robust Sparse Linear Discriminant Analysis
    Wen, Jie
    Fang, Xiaozhao
    Cui, Jinrong
    Fei, Lunke
    Yan, Ke
    Chen, Yan
    Xu, Yong
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2019, 29 (02) : 390 - 403
  • [34] Linear discriminant analysis: A detailed tutorial
    Tharwat, Alaa
    Gaber, Tarek
    Ibrahim, Abdelhameed
    Hassanien, Aboul Ella
    AI COMMUNICATIONS, 2017, 30 (02) : 169 - 190
  • [35] Regularized complete linear discriminant analysis
    Yang, Wuyi
    Wu, Houyuan
    NEUROCOMPUTING, 2014, 137 : 185 - 191
  • [36] Linear discriminant analysis with spectral regularization
    Shu, Xin
    Lu, Hongtao
    APPLIED INTELLIGENCE, 2014, 40 (04) : 724 - 731
  • [37] Sparse functional linear discriminant analysis
    Park, Juhyun
    Ahn, Jeongyoun
    Jeon, Yongho
    BIOMETRIKA, 2022, 109 (01) : 209 - 226
  • [38] Sensible functional linear discriminant analysis
    Chen, Lu-Hung
    Jiang, Ci-Ren
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2018, 126 : 39 - 52
  • [39] Linear Discriminant Analysis in Classifying Walking Gait of Autistic Children
    Ilias, Suryani
    Tahir, Nooritawati Md
    Jailani, Rozita
    Hasan, Che Zawiyah Che
    UKSIM-AMSS 11TH EUROPEAN MODELLING SYMPOSIUM ON COMPUTER MODELLING AND SIMULATION (EMS 2017), 2017, : 67 - 72
  • [40] Classification of the fragrance properties of chemical compounds based on support vector machine and linear discriminant analysis
    Luan, F.
    Liu, H. T.
    Wen, Y. Y.
    Zhang, X. Y.
    FLAVOUR AND FRAGRANCE JOURNAL, 2008, 23 (04) : 232 - 238