A near-stationary subspace for ridge approximation
From MaRDI portal
Publication:2310068
DOI10.1016/j.cma.2017.07.038zbMath1439.65023arXiv1606.01929OpenAlexW2412182992MaRDI QIDQ2310068
Rachel Ward, Jeffrey Hokanson, Paul G. Constantine, Armin Eftekhari
Publication date: 6 April 2020
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.01929
Related Items (13)
Linear/ridge expansions: enhancing linear approximations by ridge functions ⋮ Generalized bounds for active subspaces ⋮ Modified Active Subspaces Using the Average of Gradients ⋮ Sequential Learning of Active Subspaces ⋮ Data-Driven Polynomial Ridge Approximation Using Variable Projection ⋮ Dimension Reduction via Gaussian Ridge Functions ⋮ Inverse regression for ridge recovery: a data-driven approach for parameter reduction in computer experiments ⋮ Sparse mixture models inspired by ANOVA decompositions ⋮ Gaussian Quadrature and Polynomial Approximation for One-Dimensional Ridge Functions ⋮ A Lipschitz Matrix for Parameter Reduction in Computational Science ⋮ Nonlinear Level Set Learning for Function Approximation on Sparse Data with Applications to Parametric Differential Equations ⋮ Generalization bounds for sparse random feature expansions ⋮ Interpretable Approximation of High-Dimensional Data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- Learning functions of few arbitrary linear parameters in high dimensions
- Gaussian processes with built-in dimensionality reduction: applications to high-dimensional uncertainty propagation
- Learning non-parametric basis independent models from point queries via low-rank methods
- Projection pursuit
- An inequality for the multivariate normal distribution
- Tractability and strong tractability of linear multivariate problems
- The design and analysis of computer experiments.
- A note on the Poincaré inequality for convex domains
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- A taxonomy of global optimization methods based on response surfaces
- Exploiting active subspaces to quantify uncertainty in the numerical simulation of the hyshot II scramjet
- Capturing ridge functions in high dimensions from point queries
- Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiation
- Active Subspaces
- Introduction to Uncertainty Quantification
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Exploring Regression Structure Using Nonparametric Functional Estimation
- On Nonlinear Functions of Linear Combinations
- Nested Latin hypercube designs
- Algorithms for Separable Nonlinear Least Squares Problems
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- The Geometry of Algorithms with Orthogonality Constraints
- Weighted Poincaré and Friedrichs Inequalities
- Applied Linear Regression
- Predicting the output from a complex computer code when fast approximations are available
- Ridge Functions
- Orthogonal Polynomials of Several Variables
This page was built for publication: A near-stationary subspace for ridge approximation
