Reliability analysis of discrete-state performance functions via
adaptive sequential sampling with detection of failure surfaces
- URL: http://arxiv.org/abs/2208.02475v1
- Date: Thu, 4 Aug 2022 05:59:25 GMT
- Title: Reliability analysis of discrete-state performance functions via
adaptive sequential sampling with detection of failure surfaces
- Authors: Miroslav Vo\v{r}echovsk\'y
- Abstract summary: The paper presents a new efficient and robust method for rare event probability estimation.
The method can estimate the probabilities of multiple failure types.
It can accommodate this information to increase the accuracy of the estimated probabilities.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The paper presents a new efficient and robust method for rare event
probability estimation for computational models of an engineering product or a
process returning categorical information only, for example, either success or
failure. For such models, most of the methods designed for the estimation of
failure probability, which use the numerical value of the outcome to compute
gradients or to estimate the proximity to the failure surface, cannot be
applied. Even if the performance function provides more than just binary
output, the state of the system may be a non-smooth or even a discontinuous
function defined in the domain of continuous input variables. In these cases,
the classical gradient-based methods usually fail. We propose a simple yet
efficient algorithm, which performs a sequential adaptive selection of points
from the input domain of random variables to extend and refine a simple
distance-based surrogate model. Two different tasks can be accomplished at any
stage of sequential sampling: (i) estimation of the failure probability, and
(ii) selection of the best possible candidate for the subsequent model
evaluation if further improvement is necessary. The proposed criterion for
selecting the next point for model evaluation maximizes the expected
probability classified by using the candidate. Therefore, the perfect balance
between global exploration and local exploitation is maintained automatically.
The method can estimate the probabilities of multiple failure types. Moreover,
when the numerical value of model evaluation can be used to build a smooth
surrogate, the algorithm can accommodate this information to increase the
accuracy of the estimated probabilities. Lastly, we define a new simple yet
general geometrical measure of the global sensitivity of the rare-event
probability to individual variables, which is obtained as a by-product of the
proposed algorithm.
Related papers
- Anomaly Detection Under Uncertainty Using Distributionally Robust
Optimization Approach [0.9217021281095907]
Anomaly detection is defined as the problem of finding data points that do not follow the patterns of the majority.
The one-class Support Vector Machines (SVM) method aims to find a decision boundary to distinguish between normal data points and anomalies.
A distributionally robust chance-constrained model is proposed in which the probability of misclassification is low.
arXiv Detail & Related papers (2023-12-03T06:13:22Z) - Efficient Model-Free Exploration in Low-Rank MDPs [76.87340323826945]
Low-Rank Markov Decision Processes offer a simple, yet expressive framework for RL with function approximation.
Existing algorithms are either (1) computationally intractable, or (2) reliant upon restrictive statistical assumptions.
We propose the first provably sample-efficient algorithm for exploration in Low-Rank MDPs.
arXiv Detail & Related papers (2023-07-08T15:41:48Z) - Learning to Bound Counterfactual Inference in Structural Causal Models
from Observational and Randomised Data [64.96984404868411]
We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm.
The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources.
It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
arXiv Detail & Related papers (2022-12-06T12:42:11Z) - Robust leave-one-out cross-validation for high-dimensional Bayesian
models [0.0]
Leave-one-out cross-validation (LOO-CV) is a popular method for estimating out-of-sample predictive accuracy.
Here we propose and analyze a novel mixture estimator to compute LOO-CV criteria.
Our method retains the simplicity and computational convenience of classical approaches, while guaranteeing finite variance of the resulting estimators.
arXiv Detail & Related papers (2022-09-19T17:14:52Z) - Multivariate Probabilistic Regression with Natural Gradient Boosting [63.58097881421937]
We propose a Natural Gradient Boosting (NGBoost) approach based on nonparametrically modeling the conditional parameters of the multivariate predictive distribution.
Our method is robust, works out-of-the-box without extensive tuning, is modular with respect to the assumed target distribution, and performs competitively in comparison to existing approaches.
arXiv Detail & Related papers (2021-06-07T17:44:49Z) - Scalable Marginal Likelihood Estimation for Model Selection in Deep
Learning [78.83598532168256]
Marginal-likelihood based model-selection is rarely used in deep learning due to estimation difficulties.
Our work shows that marginal likelihoods can improve generalization and be useful when validation data is unavailable.
arXiv Detail & Related papers (2021-04-11T09:50:24Z) - Towards Feature-Based Performance Regression Using Trajectory Data [0.9281671380673306]
Black-box optimization is a very active area of research, with many new algorithms being developed every year.
The variety of algorithms poses a meta-problem: which algorithm to choose for a given problem at hand?
Past research has shown that per-instance algorithm selection based on exploratory landscape analysis can be an efficient mean to tackle this meta-problem.
arXiv Detail & Related papers (2021-02-10T10:19:13Z) - New Algorithms And Fast Implementations To Approximate Stochastic
Processes [0.0]
We present new algorithms and fast implementations to find efficient approximations for modelling processes.
The goal is always to find a finite model, which represents a given knowledge about the real data process as accurate as possible.
arXiv Detail & Related papers (2020-12-01T06:14:16Z) - Variance based sensitivity analysis for Monte Carlo and importance
sampling reliability assessment with Gaussian processes [0.0]
We propose a methodology to quantify the sensitivity of the probability of failure estimator to two uncertainty sources.
This analysis also enables to control the whole error associated to the failure probability estimate and thus provides an accuracy criterion on the estimation.
The approach is proposed for both a Monte Carlo based method as well as an importance sampling based method, seeking to improve the estimation of rare event probabilities.
arXiv Detail & Related papers (2020-11-30T17:06:28Z) - Goal-directed Generation of Discrete Structures with Conditional
Generative Models [85.51463588099556]
We introduce a novel approach to directly optimize a reinforcement learning objective, maximizing an expected reward.
We test our methodology on two tasks: generating molecules with user-defined properties and identifying short python expressions which evaluate to a given target value.
arXiv Detail & Related papers (2020-10-05T20:03:13Z) - Instability, Computational Efficiency and Statistical Accuracy [101.32305022521024]
We develop a framework that yields statistical accuracy based on interplay between the deterministic convergence rate of the algorithm at the population level, and its degree of (instability) when applied to an empirical object based on $n$ samples.
We provide applications of our general results to several concrete classes of models, including Gaussian mixture estimation, non-linear regression models, and informative non-response models.
arXiv Detail & Related papers (2020-05-22T22:30:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.