Learning to Optimize with Distributional Shift Constraints: A Novel Framework for Safe Domain Adaptation in Machine Learning | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Learning to Optimize with Distributional Shift Constraints: A Novel Framework for Safe Domain Adaptation in Machine Learning Li Wei, Zhangzhi Ying, Chenchen Feng, Liu Jun, Ziwang Qian, Zhao Li, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7250445/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Domain adaptation remains a significant challenge in machine learning, particularly in real-world applications where distributional shifts between training and testing domains can lead to drastic performance degradation. This paper presents a novel framework that integrates explicit constraints for worst-case distributional shifts into the empirical risk minimization process, employing integral probability metrics. By characterizing the optimization problem through optimal transport theory, we derive a mathematically rigorous solution that ensures robustness and safety in the adaptation process. Our approach is scrutinized through comprehensive theoretical analysis, establishing guarantees for the performance of adapted models. Extensive experimental evaluations on synthetic and real-world datasets demonstrate the framework's efficacy, revealing substantial improvements over existing domain adaptation methods in scenarios with severe distributional shifts. We underscore the importance of robust domain adaptation methodologies in fostering trust in AI systems deployed across sensitive domains. The proposed framework not only enhances the reliability of machine learning models but also paves the way for future research addressing the complexities of distributional uncertainty. Distributional Shift Safe Domain Adaptation Optimal Transport Constrained Optimization Integral Probability Metrics Empirical Risk Minimization Full Text Additional Declarations The authors declare no competing interests. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7250445","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":500894124,"identity":"4ef58a56-4bc0-4b20-a6f0-c0c5505c5468","order_by":0,"name":"Li Wei","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Li","middleName":"","lastName":"Wei","suffix":""},{"id":500894125,"identity":"ea2726c0-4b6b-4019-8628-b8a05e72d944","order_by":1,"name":"Zhangzhi Ying","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Zhangzhi","middleName":"","lastName":"Ying","suffix":""},{"id":500894126,"identity":"01e234e9-14be-4f80-90ef-d7c85eb0778f","order_by":2,"name":"Chenchen Feng","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Chenchen","middleName":"","lastName":"Feng","suffix":""},{"id":500894127,"identity":"86c7f7d9-725c-43c9-a789-36aa5433ac95","order_by":3,"name":"Liu Jun","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Liu","middleName":"","lastName":"Jun","suffix":""},{"id":500894128,"identity":"f6c13f6d-1071-4dfa-b3b6-bec8e62dc315","order_by":4,"name":"Ziwang Qian","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Ziwang","middleName":"","lastName":"Qian","suffix":""},{"id":500894129,"identity":"b054c5fc-ba99-4b12-9bd7-267230f7873d","order_by":5,"name":"Zhao Li","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Zhao","middleName":"","lastName":"Li","suffix":""},{"id":500894130,"identity":"022d4f69-6b43-4340-93cf-cd8c08f6a8d8","order_by":6,"name":"Shen Zhou","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABFElEQVRIiWNgGAWjYDACCSBmbEASMGAH8QwsSNHCcwBESpCiRSIBJo4dyM9uPvbw5w6bxAbpw4c/fKi5J28u+fzqhh8FEgz87d0J2LQY3DmWbiB5Ji2xgS8tTXLGsWLDnbNzym72AB0mcebsBqxaJHLMJAzbDic28PCYMfOwJSQY3M5Ju8ED1GIgkYtVi/yM/G8SiWAt/J8///kH1HLzTNrNP3i0MNzIYZM4CLGFQZqxDajlBvux2/hsMbiRZibZ2JZm3MbDZibZ25dguOFMDtttGQMJHlx+kZ+R/EzyZ5uNbD8P8+MPP74lyBscP/7s5ps/NnL87b3YHQYDbAgmjwGYxKscDbA/IEX1KBgFo2AUDH8AAA8DYpsNUdNBAAAAAElFTkSuQmCC","orcid":"","institution":"","correspondingAuthor":true,"prefix":"","firstName":"Shen","middleName":"","lastName":"Zhou","suffix":""}],"badges":[],"createdAt":"2025-07-30 08:32:46","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-7250445/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7250445/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":89280975,"identity":"690f5d8d-0cf0-4920-83fc-e087baec8b44","added_by":"auto","created_at":"2025-08-18 10:33:34","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":266796,"visible":true,"origin":"","legend":"","description":"","filename":"paper.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7250445/v1_covered_fff1a86e-d5da-40f9-a55a-43b13eca2444.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eLearning to Optimize with Distributional Shift Constraints: A Novel Framework for Safe Domain Adaptation in Machine Learning\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Distributional Shift, Safe Domain Adaptation, Optimal Transport, Constrained Optimization, Integral Probability Metrics, Empirical Risk Minimization","lastPublishedDoi":"10.21203/rs.3.rs-7250445/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7250445/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eDomain adaptation remains a significant challenge in machine learning, particularly in real-world applications where distributional shifts between training and testing domains can lead to drastic performance degradation. This paper presents a novel framework that integrates explicit constraints for worst-case distributional shifts into the empirical risk minimization process, employing integral probability metrics. By characterizing the optimization problem through optimal transport theory, we derive a mathematically rigorous solution that ensures robustness and safety in the adaptation process. Our approach is scrutinized through comprehensive theoretical analysis, establishing guarantees for the performance of adapted models. Extensive experimental evaluations on synthetic and real-world datasets demonstrate the framework's efficacy, revealing substantial improvements over existing domain adaptation methods in scenarios with severe distributional shifts. We underscore the importance of robust domain adaptation methodologies in fostering trust in AI systems deployed across sensitive domains. The proposed framework not only enhances the reliability of machine learning models but also paves the way for future research addressing the complexities of distributional uncertainty.\u003c/p\u003e","manuscriptTitle":"Learning to Optimize with Distributional Shift Constraints: A Novel Framework for Safe Domain Adaptation in Machine Learning","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-08-18 10:25:28","doi":"10.21203/rs.3.rs-7250445/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"ed81d30f-bcb1-4766-8ad1-01209863f3ff","owner":[],"postedDate":"August 18th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-08-18T10:25:28+00:00","versionOfRecord":[],"versionCreatedAt":"2025-08-18 10:25:28","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7250445","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7250445","identity":"rs-7250445","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.