TY - JOUR
T1 - A polynomial chaos efficient global optimization approach for Bayesian optimal experimental design
AU - Carlon, Andre Gustavo
AU - de Carvalho Dantas Maia, Cibelle Dias
AU - Lopez, Rafael Holdorf
AU - Torii, André Jacomel
AU - Miguel, Leandro Fleck Fadel
N1 - KAUST Repository Item: Exported on 2023-05-03
Acknowledgements: The authors also gratefully acknowledge the financial support of: Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brazil (CAPES) - Finance Code 001, the Alexander von Humboldt (AvH) foundation, USA, and Conselho Nacional de Desenvolvimento Científico e Técnológico - Brazil (CNPq) - grants 307133/2020-6 and 407349/2021-9.
PY - 2023/4/14
Y1 - 2023/4/14
N2 - This paper proposes a global optimization framework to address the high computational cost and non convexity of Optimal Experimental Design (OED) problems. To reduce the computational burden and the presence of noise in the evaluation of the Shannon expected information gain (SEIG), this framework proposes the coupling of Laplace approximation and polynomial chaos expansions (PCE). The advantage of this procedure is that PCE allows large samples to be employed for the SEIG estimation, practically vanishing the noisy introduced by the sampling procedure. Consequently, the resulting optimization problem may be treated as deterministic. Then, an optimization approach based on Kriging surrogates is employed as the optimization engine to search for the global solution with limited computational budget. Four numerical examples are investigated and their results are compared to state-of-the-art stochastic gradient descent algorithms. The proposed approach obtained better results than the stochastic gradient algorithms in all situations, indicating its efficiency and robustness in the solution of OED problems.
AB - This paper proposes a global optimization framework to address the high computational cost and non convexity of Optimal Experimental Design (OED) problems. To reduce the computational burden and the presence of noise in the evaluation of the Shannon expected information gain (SEIG), this framework proposes the coupling of Laplace approximation and polynomial chaos expansions (PCE). The advantage of this procedure is that PCE allows large samples to be employed for the SEIG estimation, practically vanishing the noisy introduced by the sampling procedure. Consequently, the resulting optimization problem may be treated as deterministic. Then, an optimization approach based on Kriging surrogates is employed as the optimization engine to search for the global solution with limited computational budget. Four numerical examples are investigated and their results are compared to state-of-the-art stochastic gradient descent algorithms. The proposed approach obtained better results than the stochastic gradient algorithms in all situations, indicating its efficiency and robustness in the solution of OED problems.
UR - http://hdl.handle.net/10754/691409
UR - https://linkinghub.elsevier.com/retrieve/pii/S0266892023000437
UR - http://www.scopus.com/inward/record.url?scp=85152378309&partnerID=8YFLogxK
U2 - 10.1016/j.probengmech.2023.103454
DO - 10.1016/j.probengmech.2023.103454
M3 - Article
SN - 1878-4275
VL - 72
SP - 103454
JO - Probabilistic Engineering Mechanics
JF - Probabilistic Engineering Mechanics
ER -