Multifidelity conditional value-at-risk estimation by dimensionally decomposed generalized polynomial chaos-Kriging
Dongjin Lee, Boris Kramer

TL;DR
This paper introduces a novel surrogate modeling approach combining polynomial chaos and Kriging for efficient CVaR estimation in high-dimensional dependent systems, improving accuracy and computational speed.
Contribution
The paper develops a new DD-GPCE-Kriging surrogate and integrates it into multifidelity importance sampling for unbiased CVaR estimation in complex high-dimensional problems.
Findings
MFIS-based method outperforms MCS in nonsmooth output scenarios.
Achieves 104x speedup over standard MCS with high accuracy.
Successfully applied to complex engineering problems with many dependent inputs.
Abstract
We propose novel methods for Conditional Value-at-Risk (CVaR) estimation for nonlinear systems under high-dimensional dependent random inputs. We develop a novel DD-GPCE-Kriging surrogate that merges dimensionally decomposed generalized polynomial chaos expansion and Kriging to accurately approximate nonlinear and nonsmooth random outputs. We use DD-GPCE-Kriging (1) for Monte Carlo simulation (MCS) and (2) within multifidelity importance sampling (MFIS). The MCS-based method samples from DD-GPCE-Kriging, which is efficient and accurate for high-dimensional dependent random inputs, yet introduces bias. Thus, we propose an MFIS-based method where DD-GPCE-Kriging determines the biasing density, from which we draw a few high-fidelity samples to provide an unbiased CVaR estimate. To accelerate the biasing density construction, we compute DD-GPCE-Kriging using a cheap-to-evaluate low-fidelity…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbabilistic and Robust Engineering Design · Advanced Multi-Objective Optimization Algorithms · Optimal Experimental Design Methods
