Robust Bayesian inference is the calculation of posterior probability bounds given perturbations in a probabilistic model. This paper focuses on perturbations that can be expressed locally in Bayesian networks through convex sets of distributions. Two approaches for combination of local models are considered. The first approach takes the largest set of joint distributions that is compatible with the local sets of distributions; we show how to reduce this type of robust inference to a linear programming problem. The second approach takes the convex hull of joint distributions generated from the local sets of distributions; we demonstrate how to apply interior-point optimization methods to generate posterior bounds and how to generate approximations that are guaranteed to converge to correct posterior bounds. We also discuss calculation of bounds for expected utilities and variances, and global perturbation models.
Univ Lyon, UJM-Saint-Etienne, CNRS, Institut d Optique Graduate School, Laboratoire Hubert Curien UMR 5516(里昂大学,圣埃蒂安让·莫内大学,法国国家科学研究中心,光学研究生院,于贝尔·居里安实验室 UMR 5516);Airbus Opération S.A.S(空中客车运营公司);University of Toulouse, Institut de Recherche en Informatique de Toulouse(图卢兹大学,图卢兹信息研究所)
Robustness of accelerated first-order algorithms for strongly convex optimization problems
Ming Hsieh Department of Electrical and Computer Engineering(明希德电气与计算机工程系);Daniel J. Epstein Department of Industrial and Systems Engineering(丹尼尔·J·埃普斯坦工业与系统工程系)
On the Robustness of Bayesian Neural Networks to Adversarial Attacks
University of Trieste(的里雅斯特大学);TU Delft University(代尔夫特理工大学);SISSA, International School of Advanced Studies(国际高等研究学院(SISSA));University of Edinburgh(爱丁堡大学);University of Oxford(牛津大学)