DeepAI AI Chat
Log In Sign Up

An active-learning algorithm that combines sparse polynomial chaos expansions and bootstrap for structural reliability analysis

by   Stefano Marelli, et al.

Polynomial chaos expansions (PCE) have seen widespread use in the context of uncertainty quantification. However, their application to structural reliability problems has been hindered by the limited performance of PCE in the tails of the model response and due to the lack of local metamodel error estimates. We propose a new method to provide local metamodel error estimates based on bootstrap resampling and sparse PCE. An initial experimental design is iteratively updated based on the current estimation of the limit-state surface in an active learning algorithm. The greedy algorithm uses the bootstrap-based local error estimates for the polynomial chaos predictor to identify the best candidate set of points to enrich the experimental design. We demonstrate the effectiveness of this approach on a well-known analytical benchmark representing a series system, on a truss structure and on a complex realistic slope-stability problem.


page 1

page 2

page 3

page 4


Quantifying the uncertainty of variance partitioning estimates of ecological datasets

An important objective of experimental biology is the quantification of ...

Active Learning with Logged Data

We consider active learning with logged data, where labeled examples are...

Ensemble-SINDy: Robust sparse model discovery in the low-data, high-noise limit, with active learning and control

Sparse model identification enables the discovery of nonlinear dynamical...

A generalized framework for active learning reliability: survey and benchmark

Active learning methods have recently surged in the literature due to th...

Deep Active Learning with Adaptive Acquisition

Model selection is treated as a standard performance boosting step in ma...