Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Cockayne, C. Oates, T. Sullivan, M. Girolami (2017)
Bayesian Probabilistic Numerical MethodsSIAM Rev., 61
Workshop on Unsupervised and Transfer Learning Autoencoders, Unsupervised Learning, and Deep Architectures
GH Golub, C Reinsch (1971)
Singular value decomposition and least squares solutionsLinear Algebra
N. Huang, Zheng Shen, S. Long, Manli Wu, Hsing Shih, Q. Zheng, N. Yen, C. Tung, Henry Liu (1998)
The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysisProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454
S. Ounpraseuth (2008)
Gaussian Processes for Machine LearningJournal of the American Statistical Association, 103
P. Constantine, E. Dow, Qiqi Wang (2013)
Erratum: Active Subspace Methods in Theory and Practice: Applications to Kriging SurfacesSIAM J. Sci. Comput., 36
H. Owhadi (2015)
Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information GamesArXiv, abs/1503.03467
G. Golub, C. Reinsch (1970)
Singular value decomposition and least squares solutionsNumerische Mathematik, 14
H. Owhadi, G. Yoo (2018)
Kernel Flows: from learning kernels from data into the abyssJ. Comput. Phys., 389
Michael Jordan (1999)
Learning in Graphical Models, 89
Yifan Chen, H. Owhadi, A. Stuart (2020)
Consistency of Empirical Bayes And Kernel Flow For Hierarchical Parameter EstimationMath. Comput., 90
H. Owhadi, C. Scovel (2019)
Operator-Adapted Wavelets, Fast Solvers, and Numerical Homogenization
M. Urner (2016)
Scattered Data Approximation
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
유정완 (2011)
Learning with Kernels, 59
D. Fensel, Umutcan Simsek, Kevin Angele, Elwin Huaman, Elias Kärle, Oleksandra Panasiuk, I. Toma, Jürgen Umbrich, Alexander Wahler (2020)
Knowledge Graphs: Methodology, Tools and Selected Use CasesKnowledge Graphs
G. Yoo, H. Owhadi (2020)
Deep regularization and direct training of the inner layers of Neural Networks with Kernel FlowsArXiv, abs/2002.08335
Yankai Lin, Zhiyuan Liu, Maosong Sun, Yang Liu, Xuan Zhu (2015)
Learning Entity and Relation Embeddings for Knowledge Graph Completion
Wray Buntine (1994)
Learning with Graphical Models
Florian Schäfer, M. Katzfuss, H. Owhadi (2020)
Sparse Cholesky factorization by Kullback-Leibler minimizationSIAM J. Sci. Comput., 43
H. Owhadi, C. Scovel, G. Yoo (2021)
Kernel Mode Decomposition and the Programming of KernelsSurveys and Tutorials in the Applied Mathematical Sciences
L. Brown (1992)
A survey of image registration techniquesACM Comput. Surv., 24
Lucas Rusnak (2012)
Oriented Hypergraphs: Introduction and BalanceElectron. J. Comb., 20
Kaiming He, X. Zhang, Shaoqing Ren, Jian Sun (2015)
Deep Residual Learning for Image Recognition2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
(2021)
Kernel flows to infer the structure of convective storms from satellite passive microwave observations
H. Owhadi (2020)
Do ideas have shape? Plato's theory of forms as the continuous limit of artificial neural networksArXiv, abs/2008.03920
C. Micchelli, T. Rivlin (1977)
Optimal Estimation in Approximation TheoryMathematics of Computation, 33
M. Raissi, P. Perdikaris, G. Karniadakis (2016)
Inferring solutions of dierential equations using noisy multi-delity data
Matthieu Darcy, B. Hamzi, J. Susiluoto, A. Braverman, Houman, Owhadi (2021)
Learning dynamical systems from data: a simple cross-validation perspective, part II: nonparametric kernel flows
U. Grenander, M. Miller (1998)
Computational anatomy: an emerging disciplineQuarterly of Applied Mathematics, 56
Philipp Hennig, Michael Osborne, M. Girolami (2015)
Probabilistic numerics and uncertainty in computationsProceedings. Mathematical, Physical, and Engineering Sciences / The Royal Society, 471
B. Hamzi, H. Owhadi (2020)
Learning dynamical systems from data: a simple cross-validation perspectiveArXiv, abs/2007.05074
M. Raissi, P. Perdikaris, G. Karniadakis (2016)
Inferring solutions of differential equations using noisy multi-fidelity dataJ. Comput. Phys., 335
Matthew Dunlop, T. Helin, A. Stuart (2019)
Hyperparameter Estimation in Bayesian MAP Estimation: Parameterizations and ConsistencyThe SMAI journal of computational mathematics
B. Hamzi, R. Maulik, H. Owhadi (2021)
Simple, low-cost and accurate data-driven geophysical forecasting with learned kernelsProceedings of the Royal Society A, 477
C. Micchelli, T. Rivlin (1977)
A Survey of Optimal Recovery
Nitish Srivastava, Geoffrey Hinton, A. Krizhevsky, Ilya Sutskever, R. Salakhutdinov (2014)
Dropout: a simple way to prevent neural networks from overfittingJ. Mach. Learn. Res., 15
Matthieu Darcy, B. Hamzi, G. Livieri, H. Owhadi, P. Tavallali (2022)
One-Shot Learning of Stochastic Differential Equations with Computational Graph CompletionArXiv, abs/2209.12086
Natasha Noy, Yuqing Gao, Anshu Jain, A. Narayanan, A. Patterson, Jamie Taylor (2019)
Industry-scale knowledge graphsCommunications of the ACM, 62
S. Mika, B. Scholkopf, Alex Smola, K. Müller, Matthias Scholz, Gunnar Rätsch (1998)
Kernel PCA and De-Noising in Feature Spaces
Amir Atiya (2005)
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and BeyondIEEE Transactions on Neural Networks, 16
Yifan Chen, Bamdad Hosseini, H. Owhadi, A. Stuart (2021)
Solving and Learning Nonlinear PDEs with Gaussian ProcessesArXiv, abs/2103.12959
N. Cressie (1988)
Spatial prediction and ordinary krigingMathematical Geology, 20
B Scholkopf, AJ Smola (2018)
10.7551/mitpress/4175.001.0001Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
H. Owhadi, C. Scovel, Florian Schäfer (2019)
Statistical Numerical ApproximationNotices of the American Mathematical Society
H. Owhadi (2014)
Bayesian Numerical HomogenizationMultiscale Model. Simul., 13
M. Reisert, H. Burkhardt (2007)
Learning Equivariant Functions with Matrix Valued KernelsJ. Mach. Learn. Res., 8
G. Tinhofer, E. Mayr, H. Noltemeier, M. Syslo (2002)
Computational Graph Theory
H. Owhadi (2021)
NOTES ON OPERATOR VALUED KERNELS, FEATURE MAPS AND GAUSSIAN PROCESSES
M. Raissi, P. Perdikaris, G. Karniadakis (2019)
Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equationsJ. Comput. Phys., 378
Jonghyeon Lee, E. Brouwer, B. Hamzi, H. Owhadi (2021)
Learning dynamical systems from data: A simple cross-validation perspective, part III: Irregularly-Sampled Time SeriesArXiv, abs/2111.13037
H. Owhadi (2018)
A Game Theoretic Approach to Numerical Approximation and Algorithm Design
M. Belkin (2021)
Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationActa Numerica, 30
L. Younes (2010)
Shapes and Diffeomorphisms
We introduce a framework for generating, organizing, and reasoning with computational knowledge. It is motivated by the observation that most problems in Computational Sciences and Engineering (CSE) can be described as that of completing (from data) a computational graph (or hypergraph) representing dependencies between functions and variables. In that setting nodes represent variables and edges (or hyperedges) represent functions (or functionals). Functions and variables may be known, unknown, or random. Data come in the form of observations of distinct values of a finite number of subsets of the variables of the graph (satisfying its functional dependencies). The underlying problem combines a regression problem (approximating unknown functions) with a matrix completion problem (recovering unobserved variables in the data). Replacing unknown functions by Gaussian processes and conditioning on observed data provides a simple but efficient approach to completing such graphs. Since the proposed framework is highly expressive, it has a vast potential application scope. Since the completion process can be automatized, as one solves 2+3\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\sqrt{\sqrt{2}+\sqrt{3}}$$\end{document} on a pocket calculator without thinking about it, one could, with the proposed framework, solve a complex CSE problem by drawing a diagram. Compared to traditional regression/kriging, the proposed framework can be used to recover unknown functions with much scarcer data by exploiting interdependencies between multiple functions and variables. The computational graph completion (CGC) problem addressed by the proposed framework could therefore also be interpreted as a generalization of that of solving linear systems of equations to that of approximating unknown variables and functions with noisy, incomplete, and nonlinear dependencies. Numerous examples illustrate the flexibility, scope, efficacy, and robustness of the CGC framework and show how it can be used as a pathway to identifying simple solutions to classical CSE problems. These examples include the seamless CGC representation of known methods (for solving/learning PDEs, surrogate/multiscale modeling, mode decomposition, deep learning) and the discovery of new ones (digital twin modeling, dimension reduction).
Research in the Mathematical Sciences – Springer Journals
Published: Jun 1, 2022
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.