Trust-Region Adaptive Frequency for Online Continual Learning

被引:1
|
作者
Kong, Yajing [1 ]
Liu, Liu [1 ]
Qiao, Maoying [2 ]
Wang, Zhen [1 ]
Tao, Dacheng [1 ]
机构
[1] Univ Sydney, Fac Engn, Sch Comp Sci, Sydney, NSW 2008, Australia
[2] Univ Technol Sydney, Sydney, NSW, Australia
关键词
Online continual learning; Catastrophic forgetting; Trust-region; Deep learning;
D O I
10.1007/s11263-023-01775-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the paradigm of online continual learning, one neural network is exposed to a sequence of tasks, where the data arrive in an online fashion and previously seen data are not accessible. Such online fashion causes insufficient learning and severe forgetting on past tasks issues, preventing a good stability-plasticity trade-off, where ideally the network is expected to have high plasticity to adapt to new tasks well and have the stability to prevent forgetting on old tasks simultaneously. To solve these issues, we propose a trust-region adaptive frequency approach, which alternates between standard-process and intra-process updates. Specifically, the standard-process replays data stored in a coreset and interleaves the data with current data, and the intra-process updates the network parameters based on the coreset. Furthermore, to improve the unsatisfactory performance stemming from online fashion, the frequency of the intra-process is adjusted based on a trust region, which is measured by the confidence score of current data. During the intra-process, we distill the dark knowledge to retain useful learned knowledge. Moreover, to store more representative data in the coreset, a confidence-based coreset selection is presented in an online manner. The experimental results on standard benchmarks show that the proposed method significantly outperforms state-of-art continual learning algorithms.
引用
收藏
页码:1825 / 1839
页数:15
相关论文
共 50 条
  • [41] A trust-region approach with novel filter adaptive radius for system of nonlinear equations
    Morteza Kimiaei
    Hamid Esmaeili
    Numerical Algorithms, 2016, 73 : 999 - 1016
  • [42] On Lagrange multipliers of trust-region subproblems
    Luksan, Ladislav
    Matonoha, Ctirad
    Vlcek, Jan
    BIT NUMERICAL MATHEMATICS, 2008, 48 (04) : 763 - 768
  • [43] Adaptive Neural Networks for Online Domain Incremental Continual Learning
    Gunasekara, Nuwan
    Gomes, Heitor
    Bifet, Albert
    Pfahringer, Bernhard
    DISCOVERY SCIENCE (DS 2022), 2022, 13601 : 89 - 103
  • [44] A TRUST-REGION ALGORITHM WITH ADAPTIVE STOCHASTIC COLLOCATION FOR PDE OPTIMIZATION UNDER UNCERTAINTY
    Kouri, D. P.
    Heinkenschloss, M.
    Ridzal, D.
    Waanders, B. G. van Bloemen
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2013, 35 (04): : A1847 - A1879
  • [45] ON LAGRANGE MULTIPLIERS OF TRUST-REGION SUBPROBLEMS
    Luksan, Ladislav
    Matonoha, Ctirad
    Vlcek, Jan
    PROGRAMS AND ALGORITHMS OF NUMERICAL MATHEMATICS 14, 2008, : 130 - 137
  • [46] Sensitivity of trust-region algorithms to their parameters
    Gould N.I.M.
    Orban D.
    Sartenaer A.
    Toint P.L.
    4OR, 2005, 3 (3) : 227 - 241
  • [47] Trust-region methods on Riemannian manifolds
    Absil, P-A.
    Baker, C. G.
    Gallivan, K. A.
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2007, 7 (03) : 303 - 330
  • [48] Trust-Region Methods on Riemannian Manifolds
    P.-A. Absil
    C.G. Baker
    K.A. Gallivan
    Foundations of Computational Mathematics, 2007, 7 : 303 - 330
  • [49] A trust-region algorithm for global optimization
    Addis, Bernardetta
    Leyffer, Sven
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2006, 35 (03) : 287 - 304
  • [50] On Lagrange multipliers of trust-region subproblems
    L. Lukšan
    C. Matonoha
    J. Vlček
    BIT Numerical Mathematics, 2008, 48 : 763 - 768