paper-with-me

Papers

Stochastic spectral embedding

2020-04-09 · S. Marelli, P. -R. Wagner, C. Lataniotis, B. Sudret

Constructing approximations that can accurately mimic the behavior of complex models at reduced computational costs is an important aspect of uncertainty quantification. Despite their flexibility and efficiency, classical surrogate models such as Kriging or polynomial chaos expansions tend to struggle with highly non-linear, localized or non-stationary computational models. We hereby propose a novel sequential adaptive surrogate modeling method based on recursively embedding locally spectral expansions. It is achieved by means of disjoint recursive partitioning of the input domain, which consists in sequentially splitting the latter into smaller subdomains, and constructing a simpler local spectral expansions in each, exploiting the trade-off complexity vs. locality. The resulting expansion, which we refer to as "stochastic spectral embedding" (SSE), is a piece-wise continuous approximation of the model response that shows promising approximation capabilities, and good scaling with both the problem dimension and the size of the training set. We finally show how the method compares favorably against state-of-the-art sparse polynomial chaos expansions on a set of models with different complexity and input dimension.

📄 PDF Abstract BibTeX arXiv:2004.04480

Code (0)

등록된 구현이 없습니다.

Tasks

Uncertainty Quantification

Similar Papers 제목 키워드 기반

Privacy Preserving Adjacency Spectral Embedding on Stochastic Blockmodels

2019-05-16 · Li Chen

For graphs generated from stochastic blockmodels, adjacency spectral embedding is asymptotically consistent. Further, adjacency spectral embedding composed with universally consistent classifiers is universally consisten…

Privacy Preserving

Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding

2013-10-02 · Vince Lyzinski, Daniel Sussman, Minh Tang, Avanti Athreya 외

Vertex clustering in a stochastic blockmodel graph has wide applicability and has been the subject of extensive research. In thispaper, we provide a short proof that the adjacency spectral embedding can be used to obtain…

Clustering

Rare event estimation using stochastic spectral embedding

2021-06-09 · P. -R. Wagner, S. Marelli, I. Papaioannou, D. Straub 외

Estimating the probability of rare failure events is an essential step in the reliability assessment of engineering systems. Computing this failure probability for complex non-linear systems is challenging, and has recen…

Active Learning

Stochastic Gradient Descent for Spectral Embedding with Implicit Orthogonality Constraint

2018-12-13 · Mireille El Gheche, Giovanni Chierchia, Pascal Frossard

In this paper, we propose a scalable algorithm for spectral embedding. The latter is a standard tool for graph clustering. However, its computational bottleneck is the eigendecomposition of the graph Laplacian matrix, wh…

ClusteringGraph ClusteringStochastic Optimization

Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel

2020-11-09 · Francesco Sanna Passino, Nicholas A. Heard, Patrick Rubin-Delanchy

Spectral clustering is a popular method for community detection in network graphs: starting from a matrix representation of the graph, the nodes are clustered on a low dimensional projection obtained from a truncated spe…

ClusteringCommunity DetectionModel Selection