{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T18:19:57Z","timestamp":1765995597215,"version":"build-2065373602"},"reference-count":83,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF-Simons Research Collaborations on the Mathematical and Scientific Foundations of Deep Learning","award":["2031985"],"award-info":[{"award-number":["2031985"]}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8650-18-2-7834","HR0011-18-2-0025"],"award-info":[{"award-number":["FA8650-18-2-7834","HR0011-18-2-0025"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Kavli Neuroscience Discovery Institute"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tpami.2025.3595364","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T18:45:09Z","timestamp":1754333109000},"page":"10033-10046","source":"Crossref","is-referenced-by-count":1,"title":["Simple Lifelong Learning Machines"],"prefix":"10.1109","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2487-6237","authenticated-orcid":false,"given":"Joshua T.","family":"Vogelstein","sequence":"first","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6713-7402","authenticated-orcid":false,"given":"Jayanta","family":"Dey","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9475-8100","authenticated-orcid":false,"given":"Hayden S.","family":"Helm","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"given":"Will","family":"LeVine","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8347-6519","authenticated-orcid":false,"given":"Ronak D.","family":"Mehta","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5479-4940","authenticated-orcid":false,"given":"Tyler M.","family":"Tomita","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8235-4950","authenticated-orcid":false,"given":"Haoyin","family":"Xu","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9224-1105","authenticated-orcid":false,"given":"Ali","family":"Geisa","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"given":"Qingyang","family":"Wang","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5239-5660","authenticated-orcid":false,"given":"Gido M.","family":"van de Ven","sequence":"additional","affiliation":[{"name":"Baylor College of Medicine, Houston, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2098-3035","authenticated-orcid":false,"given":"Chenyu","family":"Gao","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4385-3636","authenticated-orcid":false,"given":"Weiwei","family":"Yang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3659-6988","authenticated-orcid":false,"given":"Bryan","family":"Tower","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8865-9306","authenticated-orcid":false,"given":"Jonathan","family":"Larson","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Christopher M.","family":"White","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0139-7201","authenticated-orcid":false,"given":"Carey E.","family":"Priebe","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/319382.319388"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref5","first-page":"640","article-title":"Is learning the n-th thing any easier than learning the first?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Thrun"},{"volume-title":"Learn. Learn","year":"2012","author":"Thrun","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/s0079-7421(08)60536-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1037\/\/0033-295x.102.3.419"},{"key":"ref9","first-page":"1072","article-title":"A theoretical analysis of catastrophic forgetting through the NTK overlap matrix","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Doan"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/dys.1530"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611835114"},{"article-title":"Progress & compress: A scalable framework for continual learning","year":"2018","author":"Schwarz","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01252-6_33"},{"key":"ref14","first-page":"3987","article-title":"Continual learning through synaptic intelligence","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Zenke"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2773081"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956778"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-73209-6_18"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273521"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/5326.983933"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-022-00568-3"},{"key":"ref21","article-title":"Model Zoo: A growing brain that learns continually","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Ramesh","year":"2022"},{"article-title":"Progressive neural networks","year":"2016","author":"Rusu","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/393"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00810"},{"article-title":"Efficient continual learning with modular networks and task-driven priors","year":"2020","author":"Veniat","key":"ref25"},{"key":"ref26","first-page":"30298","article-title":"Continual learning via local module composition","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ostapenko"},{"key":"ref27","first-page":"100","article-title":"Continual learning using a bayesian nonparametric dictionary of weight factors","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Mehta"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00303"},{"key":"ref29","first-page":"10734","article-title":"Forget-free continual learning with winning subnetworks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kang"},{"article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","year":"2018","author":"Frankle","key":"ref30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-17866-2"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/09540099550039318"},{"key":"ref33","first-page":"2990","article-title":"Continual learning with deep generative replay","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shin"},{"article-title":"On tiny episodic memories in continual learning","year":"2019","author":"Chaudhry","key":"ref34"},{"key":"ref35","first-page":"15920","article-title":"Dark experience for general continual learning: A strong, simple baseline","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Buzzega"},{"key":"ref36","first-page":"17156","article-title":"Augmented memory replay-based continual learning approaches for network intrusion detection","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Channappayya"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126621500961"},{"article-title":"Continual learning with hypernetworks","year":"2019","author":"Von Oswald","key":"ref38"},{"article-title":"Learning to learn without forgetting by maximizing transfer and minimizing interference","year":"2018","author":"Riemer","key":"ref39"},{"article-title":"Towards a theory of out-of-distribution learning","year":"2021","author":"Dey","key":"ref40"},{"key":"ref41","first-page":"6467","article-title":"Gradient episodic memory for continual learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Lopez-Paz","year":"2017"},{"key":"ref42","first-page":"1","article-title":"Measuring cumulative gain of knowledgeable lifelong learners","volume-title":"Proc. Proc. Int. Conf. Neural Inf. Process. Syst. Continual Learn. Workshop","author":"Benavides-Prado"},{"article-title":"Don\u2019t forget, there is more than forgetting: New metrics for continual learning","year":"2018","author":"D\u00edaz-Rodr\u00edguez","key":"ref43"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1515\/jci-2018-0005"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1201\/9781315369266"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW56347.2022.00469"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3057446"},{"issue":"12","key":"ref48","first-page":"10891","article-title":"A survey on continual semantic segmentation: Theory","volume":"46","author":"Yuan","year":"2024","journal-title":"Challenge Method Appl."},{"volume-title":"Optimal Reliability Modeling: Principles and Applications","year":"2003","author":"Kuo","key":"ref49"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3446776"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1406.1078"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","year":"2018","author":"Devlin","key":"ref54"},{"volume-title":"Classification and Regression Trees","year":"1984","author":"Breiman","key":"ref55"},{"key":"ref56","first-page":"665","article-title":"Narrowing the Gap: Random forests in theory and in practice","volume-title":"Proc. 31st Int. Conf. Mach. Learn.","author":"Denil"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1709"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1136"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.29172\/7c2a6982-6d72-4cd8-bba6-2fccb06a7011"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.7.1545"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01219-9_9"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19809-0_15"},{"key":"ref64","first-page":"37988","article-title":"RanDumb: Random representations outperform online continually learned representations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Prabhu"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58536-5_31"},{"article-title":"Efficient lifelong learning with A-GEM","year":"2018","author":"Chaudhry","key":"ref66"},{"article-title":"TAG: Task-based accumulated gradients for lifelong learning","year":"2021","author":"Malviya","key":"ref67"},{"article-title":"Three scenarios for continual learning","year":"2019","author":"van de Ven","key":"ref68"},{"article-title":"Learning multiple layers of features from tiny images","year":"2012","author":"Krizhevsky","key":"ref69"},{"journal-title":"Free Spoken Digit Dataset","year":"2017","author":"Jackson","key":"ref70"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3237871"},{"article-title":"Keras","year":"2015","author":"Chollet","key":"ref72"},{"article-title":"An image is worth 16 \u00d7 16 words: Transformers for image recognition at scale","year":"2020","author":"Dosovitskiy","key":"ref73"},{"key":"ref74","first-page":"17","article-title":"CORe50: A new dataset and benchmark for continuous object recognition","volume-title":"Proc. Conf. Robot Learn.","author":"Lomonaco"},{"key":"ref75","first-page":"16532","article-title":"Online fast adaptation and knowledge accumulation (OSAKA): A new approach to continual learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Caccia"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1017\/9781107358331"},{"issue":"5","key":"ref78","first-page":"7","article-title":"Reading digits in natural images with unsupervised feature learning","volume-title":"Proc. NIPS Workshop Deep Learn. Unsupervised Feature Learn.","volume":"2011","author":"Netzer","year":"2011"},{"article-title":"notMNIST dataset","year":"2011","author":"Bulatov","key":"ref79"},{"article-title":"Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms","year":"2017","author":"Xiao","key":"ref80"},{"issue":"1","key":"ref81","first-page":"1558","article-title":"Explaining the success of adaboost and random forests as interpolating classifiers","volume":"18","author":"Wyner","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143865"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015432"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/34\/11192800\/11108956-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11192800\/11108956.pdf?arnumber=11108956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T17:37:00Z","timestamp":1759772220000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11108956\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":83,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3595364","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"},{"type":"electronic","value":"1939-3539"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}