Projection-based multifidelity linear regression for data-scarce applications
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
[2508.08517] Projection-based multifidelity linear regression for data-scarce applications Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Statistics > Machine Learning arXiv:2508.08517 (stat) [Submitted on 11 Aug 2025 ( v1 ), last revised 14 Aug 2026 (this version, v2)] Title: Projection-based multifidelity linear regression for data-scarce applications Authors: Vignesh Sella , Julie Pham , Karen Willcox , Anirban Chaudhuri View a PDF of the paper titled Projection-based multifidelity linear regression for data-scarce applications, by Vignesh Sella and 3 other authors View PDF HTML (experimental) Abstract: Surrogate modeling for systems with high-dimensional quantities of interest remains challenging, particularly when training data are costly to acquire. This work develops multifidelity methods for multiple-input multiple-output linear regression targeting data-limited applications with high-dimensional outputs. Multifidelity methods integrate many inexpensive low-fidelity model evaluations with limited, costly high-fidelity evaluations. We introduce two projection-based multifidelity linear regression approaches with linear and nonlinear features that leverage principal component basis vectors for dimensionality reduction and combine multifidelity data through: (i) a direct data augmentation using low-fidelity data, and (ii) a data augmentation incorporating explicit linear corrections between low-fidelity and high-fidelity data. The data augmentation approaches combine high-fidelity and low-fidelity data into a unified training set and train the linear regression model through weighted least squares with fidelity-specific weights. We introduce a proximity-based weighting scheme with automatic weight selection strategy through cross-validation. The proposed multifidelity linear regression methods are demonstrated on approximating the surface pressure field of a hypersonic vehicle in flight and the temperature field on an aircraft disc braking system. In an ultra low-data regime of no more than twelve high-fidelity samples, multifidelity linear regression achieves approximately 2%-12% improvement in median accuracy and a higher $R^2$ score relative to single-fidelity methods at comparable computational cost. Comments: 36 pages, 16 figures, accepted in Machine Learning for Computational Science and Engineering special issue Accelerating Numerical Methods With Scientific Machine Learning Subjects: Machine Learning (stat.ML) ; Computational Engineering, Finance, and Science (cs.CE); Machine Learning (cs.LG) Cite as: arXiv:2508.08517 [stat.ML] (or arXiv:2508.08517v2 [stat.ML] for this version) https://doi.org/10.48550/arXiv.2508.08517 Focus to learn more arXiv-issued DOI via DataCite Journal reference: Mach. Learn. Comput. Sci. Eng. 1, 47 (2025) Related DOI : https://doi.org/10.1007/s44379-025-00049-5 Focus to learn more DOI(s) linking to related resources Submission history From: Vignesh Sella [ view email ] [v1] Mon, 11 Aug 2025 22:55:04 UTC (1,946 KB) [v2] Fri, 14 Aug 2026 19:27:27 UTC (6,923 KB) Full-text links: Access Paper: View a PDF of the paper titled Projection-based multifidelity linear regression for data-scarce applications, by Vignesh Sella and 3 other authors View PDF HTML (experimental) TeX Source view license Current browse context: stat.ML < prev | next > new | recent | 2025-08 Change to browse by: cs cs.CE cs.LG stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from
Related documents
- Multivariate linear regression without prior assumptions#997355
- Infernal state#761254
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Fréchet Regression for Random Objects with Euclidean Predictors#1130418
- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers#1156354
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive