{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T15:49:10Z","timestamp":1749052150687,"version":"3.37.3"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,4]]},"DOI":"10.1109\/icassp49357.2023.10095984","type":"proceedings-article","created":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T17:28:30Z","timestamp":1683307710000},"page":"1-5","source":"Crossref","is-referenced-by-count":3,"title":["Is Multi-Task Learning an Upper Bound for Continual Learning?"],"prefix":"10.1109","author":[{"given":"Zihao","family":"Wu","sequence":"first","affiliation":[{"name":"Vanderbilt University,Department of Computer Science,Nashville,TN"}]},{"given":"Huy","family":"Tran","sequence":"additional","affiliation":[{"name":"Vanderbilt University,Department of Computer Science,Nashville,TN"}]},{"given":"Hamed","family":"Pirsiavash","sequence":"additional","affiliation":[{"name":"University of California,Department of Computer Science,Davis,CA"}]},{"given":"Soheil","family":"Kolouri","sequence":"additional","affiliation":[{"name":"Vanderbilt University,Department of Computer Science,Nashville,TN"}]}],"member":"263","reference":[{"key":"ref13","first-page":"15173","article-title":"Supermasks in superposition","volume":"33","author":"wortsman","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01225-0_5"},{"key":"ref15","first-page":"12310","article-title":"Barlow twins: Self-supervised learning via redundancy reduction","author":"zbontar","year":"2021","journal-title":"International Conference on Machine Learning"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-022-00452-0"},{"key":"ref20","article-title":"Linear mode connectivity in multitask and continual learning","author":"mirzadeh","year":"2020","journal-title":"International Conference on Learning Representations"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00810"},{"key":"ref10","first-page":"4528","article-title":"Progress & compress: A scalable framework for continual learning","author":"schwarz","year":"2018","journal-title":"International Conference on Machine Learning"},{"article-title":"Adam: A method for stochastic optimization","year":"2014","author":"kingma","key":"ref21"},{"key":"ref2","first-page":"3987","article-title":"Continual learning through synaptic intelligence","author":"zenke","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"3521","DOI":"10.1073\/pnas.1611835114","article-title":"Overcoming catastrophic forgetting in neural networks","volume":"114","author":"kirkpatrick","year":"2017","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00938"},{"article-title":"Three scenarios for continual learning","year":"2019","author":"van de ven","key":"ref16"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00940"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW56347.2022.00432"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6006"},{"key":"ref7","article-title":"Experience replay for continual learning","volume":"32","author":"rolnick","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref9","first-page":"3762","article-title":"Orthogonal gradient descent for continual learning","author":"farajtabar","year":"2020","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref4","article-title":"Sliced cramer synaptic consolidation for preserving deeply learned representations","author":"kolouri","year":"2020","journal-title":"International Conference on Learning Representations"},{"key":"ref3","article-title":"Memory aware synapses: Learning what (not) to forget","author":"aljundi","year":"2018","journal-title":"ECCV"},{"key":"ref6","first-page":"2994","article-title":"Continual learning with deep generative replay","author":"shin","year":"2017","journal-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems"},{"key":"ref5","article-title":"Lifelong learning with sketched structural regularization","volume":"157","author":"li","year":"2021","journal-title":"Proceedings of Machine Learning Research PMLR"}],"event":{"name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2023,6,4]]},"location":"Rhodes Island, Greece","end":{"date-parts":[[2023,6,10]]}},"container-title":["ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10094559\/10094560\/10095984.pdf?arnumber=10095984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T18:57:01Z","timestamp":1700506621000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10095984\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/icassp49357.2023.10095984","relation":{},"subject":[],"published":{"date-parts":[[2023,6,4]]}}}