Tackling the NASA and DNV 2025 UQ challenge : an Approximate Bayesian Computation Framework for Surrogate-Based Optimization Under Uncertainty

Performing an optimization task on a complex system can be challenging when input variables are not completely known and when there is inherent randomness in the system response.The first step is therefore to gather information to reduce these uncertainties.In this paper, we use a rejection algorithm based on approximate Bayesian computation to infer input distributions from a limited number of output observations.We define informative metrics to estimate the likelihood of each input variable using a computer model of the real system and variancebased sensitivity analysis.Further, we identify optimal control parameters accounting for both performance and probabilistic constraints.We utilize neural network surrogates to efficiently approximate key relationships, evaluate failure probability, and enable gradient-based optimization approaches.

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.3850/978-981-94-3281-3_esrel-sra-e2025-p9896-cd
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tackling the NASA and DNV 2025 UQ challenge : an Approximate Bayesian Computation Framework for Surrogate-Based Optimization Under Uncertainty

Nikolay Dimitrov, Gatien Chopard, Teodor Åstrand
Advanced Multi-Objective Optimization Algorithms
article

Tackling the NASA and DNV 2025 UQ challenge : an Approximate Bayesian Computation Framework for Surrogate-Based Optimization Under Uncertainty

Nikolay Dimitrov, Gatien Chopard, Teodor Åstrand
article en

Abstract

Performing an optimization task on a complex system can be challenging when input variables are not completely known and when there is inherent randomness in the system response.The first step is therefore to gather information to reduce these uncertainties.In this paper, we use a rejection algorithm based on approximate Bayesian computation to infer input distributions from a limited number of output observations.We define informative metrics to estimate the likelihood of each input variable using a computer model of the real system and variancebased sensitivity analysis.Further, we identify optimal control parameters accounting for both performance and probabilistic constraints.We utilize neural network surrogates to efficiently approximate key relationships, evaluate failure probability, and enable gradient-based optimization approaches.

Openalex Percentile: Top 70%
Advanced Multi-Objective Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.