Nonlinear level set learning for function approximation on sparse data with applications to parametric differential equations

DOI10.4208/NMTMA.OA-2021-0062zbMATH Open1499.65052arXiv2104.14072OpenAlexW3200632266WikidataQ115209276 ScholiaQ115209276MaRDI QIDQ5864754FDOQ5864754

Authors: Anthony Gruber, Max Gunzburger, Lili Ju, Yuankai Teng, Zhu Wang 

Publication date: 8 June 2022

Published in: Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)

Abstract: A dimension reduction method based on the "Nonlinear Level set Learning" (NLL) approach is presented for the pointwise prediction of functions which have been sparsely sampled. Leveraging geometric information provided by the Implicit Function Theorem, the proposed algorithm effectively reduces the input dimension to the theoretical lower bound with minor accuracy loss, providing a one-dimensional representation of the function which can be used for regression and sensitivity analysis. Experiments and applications are presented which compare this modified NLL with the original NLL and the Active Subspaces (AS) method. While accommodating sparse input data, the proposed algorithm is shown to train quickly and provide a much more accurate and informative reduction than either AS or the original NLL on two example functions with high-dimensional domains, as well as two state-dependent quantities depending on the solutions to parametric differential equations.

Full work available at URL: https://arxiv.org/abs/2104.14072

Recommendations

• Level Set Learning with Pseudoreversible Neural Networks for Nonlinear Dimension Reduction in Function Approximation
• Nonlinear dimension reduction for surrogate modeling using gradient information
• Nonintrusive Reduced-Order Models for Parametric Partial Differential Equations via Data-Driven Operator Inference
• Symmetry results for decay solutions of elliptic systems in the whole space
• A deep learning approach to Reduced Order Modelling of parameter dependent partial differential equations

zbMATH Keywords

nonlinear dimensionality reductionsparse datafunction approximationnonlinear level set learning

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Numerical approximation of high-dimensional functions; sparse grids (65D40)

Cites Work

• Reducing the Dimensionality of Data with Neural Networks
• Sufficient dimension reduction and prediction in regression
• Fisher lecture: Dimension reduction in regression
• Sampling Algorithms and Coresets for $\ell_p$ Regression
• Sparse sufficient dimension reduction
• Boundary regularity and the Dirichlet problem for harmonic maps
• Multilayer feedforward networks are universal approximators
• On finite population sampling theory under certain linear regression models
• Approximation by Ridge functions and neural networks with one hidden layer
• Response surface methodology. Process and product optimization using designed experiments
• Title not available (Why is that?)
• Robust kernel Isomap
• Active subspaces. Emerging ideas for dimension reduction in parameter studies
• Active subspace methods in theory and practice: applications to kriging surfaces
• A modified SEIR model for the spread of Ebola in western Africa and metrics for resource allocation
• A review on dimension reduction
• Multifidelity Dimension Reduction via Active Subspaces
• Parallel transport unfolding: a connection-based manifold learning approach
• A near-stationary subspace for ridge approximation

Cited In (2)

• Level Set Learning with Pseudoreversible Neural Networks for Nonlinear Dimension Reduction in Function Approximation
• Nonlinear dimension reduction for surrogate modeling using gradient information

Uses Software

• darch
• Adam
• Active subspaces

This page was built for publication: Nonlinear level set learning for function approximation on sparse data with applications to parametric differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864754)