{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:32:04Z","timestamp":1763811124622,"version":"3.37.3"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-18-1-0465"],"award-info":[{"award-number":["FA9550-18-1-0465"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF Career Award","doi-asserted-by":"publisher","award":["CCF:1553075"],"award-info":[{"award-number":["CCF:1553075"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF Research Advanced by Interdisciplinary Science and Engineering","award":["1931978"],"award-info":[{"award-number":["1931978"]}]},{"name":"NSF Engineering Research Center (ERC) Planning","award":["1937057"],"award-info":[{"award-number":["1937057"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3276775","type":"journal-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T19:48:04Z","timestamp":1684266484000},"page":"49226-49240","source":"Crossref","is-referenced-by-count":3,"title":["Barycentric-Alignment and Reconstruction Loss Minimization for Domain Generalization"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3295-0652","authenticated-orcid":false,"given":"Boyang","family":"Lyu","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thuan","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2621-1549","authenticated-orcid":false,"given":"Prakash","family":"Ishwar","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Boston University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0064-2789","authenticated-orcid":false,"given":"Matthias","family":"Scheutz","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Tufts University, Medford, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1049-9795","authenticated-orcid":false,"given":"Shuchin","family":"Aeron","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20828-2"},{"key":"ref35","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","author":"cuturi","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"},{"key":"ref12","first-page":"7523","article-title":"On learning invariant representations for domain adaptation","volume":"97","author":"zhao","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref34","first-page":"2681","article-title":"Interpolating between optimal transport and MMD using sinkhorn divergences","volume":"89","author":"feydy","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref15","article-title":"Invariant risk minimization","author":"arjovsky","year":"2019","journal-title":"arXiv 1907 02893"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.208"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01267-0_38"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.591"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/100805741"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2562630"},{"key":"ref11","first-page":"2030","article-title":"Domain-adversarial training of neural networks","volume":"17","author":"ganin","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref33","first-page":"1","article-title":"POT: Python optimal transport","volume":"22","author":"flamary","year":"2021","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.09.091"},{"key":"ref32","first-page":"685","article-title":"Fast computation of Wasserstein barycenters","volume":"32","author":"cuturi","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSRE.2019.2945794"},{"key":"ref1","first-page":"1","article-title":"In search of lost domain generalization","author":"gulrajani","year":"2021","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref17","first-page":"46","article-title":"Domain generalization by marginal transfer learning","volume":"22","author":"blanchard","year":"2021","journal-title":"J Mach Learn Res"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01270-0_28"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00858"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.572"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71246-8_45"},{"key":"ref18","first-page":"5815","article-title":"Out-of-distribution generalization via risk extrapolation (REx)","volume":"139","author":"krueger","year":"2021","journal-title":"Proc 38th Int Conf Mach Learn"},{"key":"ref24","article-title":"Domain generalization using pretrained models without fine-tuning","author":"li","year":"2022","journal-title":"arXiv 2203 04600"},{"key":"ref46","first-page":"1","article-title":"Wasserstein iterative networks for barycenter estimation","author":"korotin","year":"2022","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58607-2_12"},{"key":"ref45","first-page":"1571","article-title":"Scalable computations of Wasserstein barycenter via input convex neural networks","volume":"139","author":"fan","year":"2021","journal-title":"Proc 38th Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3178128"},{"key":"ref48","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref25","first-page":"22405","article-title":"SWAD: Domain generalization by seeking flat minima","volume":"34","author":"cha","year":"2021","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11784"},{"key":"ref42","first-page":"16096","article-title":"Domain generalization via entropy regularization","author":"zhao","year":"2020","journal-title":"Proc 34th Int Conf Neural Inf Process Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49409-8_35"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR48806.2021.9412735"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA55696.2022.00132"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"ref43","first-page":"527","article-title":"Support and invertibility in domain-invariant representations","volume":"89","author":"johansson","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref28","first-page":"6872","article-title":"Domain adaptation with asymmetrically-relaxed distribution alignment","volume":"97","author":"wu","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref27","first-page":"4396","article-title":"Domain generalization: A survey","volume":"45","author":"zhou","year":"2023","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50019-X"},{"key":"ref8","first-page":"1","article-title":"Domain generalization via model-agnostic learning of semantic features","volume":"32","author":"dou","year":"2019","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref7","article-title":"Generalizing to unseen domains via distribution matching","author":"albuquerque","year":"2019","journal-title":"arXiv 1911 00804"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00566"},{"key":"ref4","first-page":"137","article-title":"Analysis of representations for domain adaptation","volume":"19","author":"ben-david","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1117\/1.JBO.26.2.022908"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5152-4"},{"key":"ref5","first-page":"2178","article-title":"Generalizing from several related classification tasks to a new unlabeled sample","volume":"24","author":"blanchard","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/72.788640"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6287639\/10005208\/10126078-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10126078.pdf?arnumber=10126078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T18:22:44Z","timestamp":1686594164000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10126078\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3276775","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}