{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T18:10:01Z","timestamp":1749665401135,"version":"3.41.0"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["2139304","2146838"],"award-info":[{"award-number":["2139304","2146838"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/jstsp.2024.3507371","type":"journal-article","created":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T19:34:55Z","timestamp":1732736095000},"page":"208-220","source":"Crossref","is-referenced-by-count":0,"title":["Representation Transfer Learning via Multiple Pre-Trained Models for Linear Regression"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-2915","authenticated-orcid":false,"given":"Navjot","family":"Singh","sequence":"first","affiliation":[{"name":"Department of Electrical, Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7313-9861","authenticated-orcid":false,"given":"Suhas","family":"Diggavi","sequence":"additional","affiliation":[{"name":"Department of Electrical, Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"403","article-title":"Meta-transfer learning for few-shot learning","volume-title":"Proc. 2018 IEEE Conf. Comput. Vis. Pattern Recognit.","author":"Liu","year":"2019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"ref3","first-page":"17","article-title":"Deep learning of representations for unsupervised and transfer learning","volume-title":"Proc. ICML Workshop Unsupervised Transfer Learn. JMLR Workshop Conf. Proc.","author":"Bengio","year":"2012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2022.3184480"},{"key":"ref5","article-title":"Transfer learning from speaker verification to multispeaker text-to-speech synthesis","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"31","author":"Jia","year":"2018"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-5573-2"},{"key":"ref7","article-title":"Learning bounds for domain adaptation","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"20","author":"Blitzer","year":"2007"},{"key":"ref8","article-title":"Domain adaptation: Learning bounds and algorithms","volume-title":"Proc. 22nd Conf. Learn. Theory","author":"Mansour","year":"2009"},{"key":"ref9","article-title":"Few-shot learning via learning the representation, provably","volume-title":"Proc. 9th Int. Conf. Learn. Representations,","author":"Du","year":"2021"},{"key":"ref10","first-page":"8871","article-title":"How fine-tuning allows for effective meta-learning","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"34","author":"Chua","year":"2021"},{"key":"ref11","first-page":"10434","article-title":"Provable meta-learning of linear representations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Tripuraneni","year":"2021"},{"issue":"81","key":"ref12","first-page":"1","article-title":"The benefit of multitask representation learning","volume":"17","author":"Maurer","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref13","article-title":"Overfitting or perfect fitting? Risk bounds for classification and regression rules that interpolate","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"31","author":"Belkin","year":"2018"},{"key":"ref14","first-page":"322","article-title":"Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Arora","year":"2019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1907378117"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2133"},{"article-title":"On generalization of adaptive methods for over-parameterized linear regression","year":"2020","author":"Shah","key":"ref17"},{"key":"ref18","article-title":"Direction matters: On the implicit bias of stochastic gradient descent with moderate learning rate","volume-title":"Proc. 9th Int. Conf. Learn. Representations, 2021, Virtual Event","author":"Wu","year":"2021"},{"key":"ref19","first-page":"1832","article-title":"Characterizing implicit bias in terms of optimization geometry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gunasekar","year":"2018"},{"key":"ref20","first-page":"1126","article-title":"Model-agnostic meta-learning for fast adaptation of deep networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Finn","year":"2017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3178128"},{"key":"ref22","first-page":"2373","article-title":"Risk bounds for transferring representations with and without fine-tuning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"McNamara","year":"2017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaw008"},{"key":"ref24","first-page":"7523","article-title":"On learning invariant representations for domain adaptation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhao","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0022"},{"key":"ref26","first-page":"24791","article-title":"Domain adaptation with invariant representation learning: What transformations to learn?","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"34","author":"Stojanov","year":"2021"},{"key":"ref27","first-page":"7404","article-title":"Bridging theory and algorithm for domain adaptation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang","year":"2019"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2021.3111034"},{"key":"ref29","article-title":"Domain adaptation with multiple sources","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"21","author":"Mansour","year":"2008"},{"key":"ref30","first-page":"6028","article-title":"Do we really need to access the source data? Source hypothesis transfer for unsupervised domain adaptation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liang","year":"2020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00997"},{"key":"ref32","first-page":"15382","article-title":"A theoretical analysis of fine-tuning with linear teachers","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"34","author":"Shachaf","year":"2021"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/20M1336072"},{"key":"ref34","first-page":"4028","article-title":"How catastrophic can catastrophic forgetting be in linear regression?","volume-title":"Proc. Conf. Learn. Theory","author":"Evron","year":"2022"},{"key":"ref35","first-page":"2089","article-title":"Exploiting shared representations for personalized federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Collins","year":"2021"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3150\/15-BEJ730"},{"issue":"263","key":"ref38","first-page":"1","article-title":"The interplay between implicit bias and benign overfitting in two-layer linear networks","volume":"23","author":"Chatterji","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref39","first-page":"5089","article-title":"CLDA: Contrastive learning for semi-supervised domain adaptation","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Singh","year":"2021"},{"article-title":"Surprisingly simple semi-supervised domain adaptation with pretraining and consistency","volume-title":"Proc. NeurIPS 2021 Workshop Distrib. Shifts: Connecting Methods Appl.","author":"Mishra","key":"ref40"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/4200690\/10906680\/10769036-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4200690\/10906680\/10769036.pdf?arnumber=10769036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T17:44:24Z","timestamp":1749663864000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10769036\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":40,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2024.3507371","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"type":"print","value":"1932-4553"},{"type":"electronic","value":"1941-0484"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}