Active Subspaces in Infinite Dimension
Active subspace analysis uses the leading eigenspace of the gradient's second moment to conduct supervised dimension reduction. In this article, we extend this methodology to real-valued functionals on Hilbert space. We define an operator which coincides with the active subspace matrix when applied to a Euclidean space. We show that many of the desirable properties of Active Subspace analysis extend directly to the infinite dimensional setting. We also propose a Monte Carlo procedure and discuss its convergence properties. Finally, we deploy this methodology to create visualizations and improve modeling and optimization on complex test problems.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Multi-fidelity data fusion for the approximation of scalar functions with low intrinsic dimensionality through active subspaces
Gaussian processes are employed for non-parametric regression in a Bayesian setting. They generalize linear regression, embedding the inputs in a latent manifold inside an infinite-dimensional reproducing kernel Hilbert …
Gaussian ProcessesregressionAnalyzing Linear Dynamical Systems: From Modeling to Coding and Learning
Encoding time-series with Linear Dynamical Systems (LDSs) leads to rich models with applications ranging from dynamical texture recognition to video segmentation to name a few. In this paper, we propose to represent LDSs…
Dictionary LearningGeneral ClassificationTime SeriesTime Series Analysis+3Deep active subspaces - a scalable method for high-dimensional uncertainty propagation
A problem of considerable importance within the field of uncertainty quantification (UQ) is the development of efficient methods for the construction of accurate surrogate models. Such efforts are particularly important …
Dimensionality ReductionUncertainty QuantificationVocal Bursts Intensity PredictionIntrinsic Grassmann Averages for Online Linear, Robust and Nonlinear Subspace Learning
Principal Component Analysis (PCA) and Kernel Principal Component Analysis (KPCA) are fundamental methods in machine learning for dimensionality reduction. The former is a technique for finding this approximation in fini…
Dimensionality ReductionExploiting Active Subspaces in Global Optimization: How Complex is your Problem?
When applying optimization method to a real-world problem, the possession of prior knowledge and preliminary analysis on the landscape of a global optimization problem can give us an insight into the complexity of the pr…
global-optimization