paper-with-me

Papers

Sequential Learning of Active Subspaces

2019-07-26 · Nathan Wycoff, Mickael Binois, Stefan M. Wild

In recent years, active subspace methods (ASMs) have become a popular means of performing subspace sensitivity analysis on black-box functions. Naively applied, however, ASMs require gradient evaluations of the target function. In the event of noisy, expensive, or stochastic simulators, evaluating gradients via finite differencing may be infeasible. In such cases, often a surrogate model is employed, on which finite differencing is performed. When the surrogate model is a Gaussian process, we show that the ASM estimator is available in closed form, rendering the finite-difference approximation unnecessary. We use our closed-form solution to develop acquisition functions focused on sequential learning tailored to sensitivity analysis on top of ASMs. We also show that the traditional ASM estimator may be viewed as a method of moments estimator for a certain class of Gaussian processes. We demonstrate how uncertainty on Gaussian process hyperparameters may be propagated to uncertainty on the sensitivity analysis, allowing model-based confidence intervals on the active subspace. Our methodological developments are illustrated on several examples.

📄 PDF Abstract BibTeX arXiv:1907.11572

Code (1)

belakaria/al-gsa-dgsms pytorch

Tasks

Gaussian ProcessesSensitivitysubspace methods

Methods 이 논문이 사용한 방법론

Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Similar Papers 제목 키워드 기반

Surrogate Active Subspaces for Jump-Discontinuous Functions

2023-10-17 · Nathan Wycoff

Surrogate modeling and active subspaces have emerged as powerful paradigms in computational science and engineering. Porting such techniques to computational models in the social sciences brings into sharp relief their l…

Segmentation of Subspaces in Sequential Data

2015-04-16 · Stephen Tierney, Yi Guo, Junbin Gao

We propose Ordered Subspace Clustering (OSC) to segment data drawn from a sequentially ordered union of subspaces. Similar to Sparse Subspace Clustering (SSC) we formulate the problem as one of finding a sparse represent…

ClusteringSegmentation

Pursuit of a Discriminative Representation for Multiple Subspaces via Sequential Games

2022-06-18 · Druv Pai, Michael Psenka, Chih-Yuan Chiu, Manxi Wu 외

We consider the problem of learning discriminative representations for data in a high-dimensional space with distribution supported on or around multiple low-dimensional linear subspaces. That is, we wish to compute a li…

Representation Learning

Active Sampling of Interpolation Points to Identify Dominant Subspaces for Model Reduction

2024-09-05 · Celine Reddig, Pawan Goyal, Igor Pontes Duff, Peter Benner

Model reduction is an active research field to construct low-dimensional surrogate models of high fidelity to accelerate engineering design cycles. In this work, we investigate model reduction for linear structured syste…

Deep active subspaces - a scalable method for high-dimensional uncertainty propagation

2019-02-27 · Rohit Tripathy, Ilias Bilionis

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 Prediction