{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:31:50Z","timestamp":1787329910505,"version":"build-2736575974"},"reference-count":32,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["611675"],"award-info":[{"award-number":["611675"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009059","name":"Pacific Institute for the Mathematical Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009059","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2023,2,28]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>Many problems arising in computational science and engineering can be described in terms of approximating a smooth function of [Formula: see text] variables, defined over an unknown domain of interest [Formula: see text], from sample data. Here both the underlying dimensionality of the problem (in the case [Formula: see text]) as well as the lack of domain knowledge\u2014with [Formula: see text] potentially irregular and\/or disconnected\u2014are confounding factors for sampling-based methods. Na\u00efve approaches for such problems often lead to wasted samples and inefficient approximation schemes. For example, uniform sampling can result in upward of 20% wasted samples in some problems considered herein. In applications such as surrogate model construction in computational uncertainty quantification, the high cost of computing samples necessitates a more efficient sampling procedure. Over the last several years methods for computing such approximations from sample data have been studied in the case of irregular domains, and the advantages of computing sampling measures depending on an approximation space [Formula: see text] of [Formula: see text] have been shown. More specifically, such approaches confer advantages such as stability and well-conditioning, with an asymptotically optimal sample complexity scaling [Formula: see text]. The recently proposed adaptive sampling for general domains (ASGD) strategy is one such technique to construct these sampling measures. The main contribution of this paper is a procedure to improve upon the ASGD approach by adaptively updating the sampling measure in the case of unknown domains. We achieve this by first introducing a general domain adaptivity strategy, which computes an approximation of the function and domain of interest from the sample points. Second, we propose an adaptive sampling strategy, termed adaptive sampling for unknown domains (ASUD), which generates sampling measures over a domain that may not be known in advance, based on the ideas introduced in the ASGD approach. We then derive (weighted) least squares and augmented least squares techniques for polynomial approximation on unknown domains. We present numerical experiments demonstrating the efficacy of the adaptive sampling techniques with least squares\u2013based polynomial approximation schemes. Our results show that the ASUD approach consistently achieves errors the same as or smaller than uniform sampling, but using fewer, and often significantly fewer, function evaluations.<\/jats:p>","DOI":"10.1137\/22m1472693","type":"journal-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T13:15:52Z","timestamp":1677071752000},"page":"A200-A225","source":"Crossref","is-referenced-by-count":3,"title":["An Adaptive Sampling and Domain Learning Strategy for Multivariate Function Approximation on Unknown Domains"],"prefix":"10.1137","volume":"45","author":[{"given":"Ben","family":"Adcock","sequence":"first","affiliation":[{"name":"Department of Mathematics, Simon Fraser University, Burnaby V5A 1S6, BC, Canada."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1368-9276","authenticated-orcid":true,"given":"Juan M.","family":"Cardenas","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Simon Fraser University, Burnaby V5A 1S6, BC, Canada."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2418-4735","authenticated-orcid":true,"given":"Nick","family":"Dexter","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Simon Fraser University, Burnaby V5A 1S6, BC, Canada."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"ref1","unstructured":"B. Adcock , \nS. Brugiapaglia , \nN. Dexter , and \nS. Moraga , Deep neural networks are effective at learning high-dimensional Hilbert-valued functions from limited data, in Proceedings of the Second Annual Conference on Mathematical and Scientific Machine Learning, Proc. Mach. Learn. Res. 145, \nJ. Bruna , \nJ. S. Hesthaven , and \nL. Zdeborov\u00e1 , eds. PMLR, 2021, pp. 1\u201336."},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"B. Adcock , \nS. Brugiapaglia , and \nC. G. Webster , Compressed sensing approaches for polynomial approximation of high-dimensional functions, in Compressed Sensing and Its Applications: Second International MATHEON Conference 2015, Appl. Numer. Harmon. Anal. \nH. Boche , \nG. Caire , \nR. Calderbank , \nM. M\u00e4rz , \nG. Kutyniok , and \nR. Mathar , eds. Birkh\u00e4user, Cham, Switzerland, 2017, pp. 93\u2013124.","DOI":"10.1007\/978-3-319-69802-1_3"},{"key":"ref3","series-title":"Comput. Sci. Eng. 25","volume-title":"Sparse Polynomial Approximation of High-Dimensional Functions","author":"Adcock B.","year":"2021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/19M1279459"},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"B. Adcock , \nJ. M. Cardenas , and \nN. Dexter , CAS4DL: Christoffel Adaptive Sampling for Function Approximation via Deep Learning, https:\/\/arxiv.org\/abs\/2208.12190, 2022.","DOI":"10.1007\/s43670-022-00040-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-00832-0_2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/20M131309X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/fms.2020.23"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/18M1189749"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2020.05.011"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.5802\/smai-jcm.24"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72456-0_12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-021-09558-x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1051\/m2an\/2011045"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s003650010020"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1090\/mcom\/3710","volume":"91","author":"Haberstich C.","year":"2022","journal-title":"Math. Comput."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2015.02.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2019.03.049"},{"key":"ref19","first-page":"393","volume":"24","author":"Ky V. K.","year":"2016","journal-title":"Int. Trans. Oper. Res."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-3520-2"},{"key":"ref21","first-page":"467","volume":"7","author":"Lee H.","year":"2011","journal-title":"Pacific J. Optim."},{"key":"ref22","unstructured":"G. Migliorati , Polynomial Approximation by Means of the Random Discrete \\(L^2\\) Projection and Application to Inverse Problems for PDEs with Stochastic Data, Ph.D. thesis, Politecnico di Milano, 2013."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10705-9_54"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/18M1198387"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/draa023"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0864"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9045(86)90016-X"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1615\/Int.J.UncertaintyQuantification.2013006821"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973228"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827503424505"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23395-6"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-017-9370-x"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/22M1472693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:39:02Z","timestamp":1787326742000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/22M1472693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,23]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2,28]]}},"alternative-id":["10.1137\/22M1472693"],"URL":"https:\/\/doi.org\/10.1137\/22m1472693","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,23]]}}}