We present two sampling algorithms for probabilistic confidence inference in Bayesian networks. These two algorithms (we call them AIS-BN-mu and AIS-BN-sigma algorithms) guarantee that estimates of posterior probabilities are with a given probability within a desired precision bound. Our algorithms are based on recent advances in sampling algorithms for (1) estimating the mean of bounded random variables and (2) adaptive importance sampling in Bayesian networks. In addition to a simple stopping rule for sampling that they provide, the AIS-BN-mu and AIS-BN-sigma algorithms are capable of guiding the learning process in the AIS-BN algorithm. An empirical evaluation of the proposed algorithms shows excellent performance, even for very unlikely evidence.
Bayesian inference for data-efficient, explainable, and safe robotic motion planning: A review
University of Eastern Finland(东芬兰大学);School of Computing(计算机学院);Shenzhen Technology University(深圳技术大学);College of Big Data and Internet(大数据与互联网学院);Chengdu University of Information Technology(成都信息工程大学);College of Blockchain industry(区块链产业学院);College of Health Science and Environmental Engineering(健康科学与环境工程学院)
Calibrating Bayesian Learning via Regularization, Confidence Minimization, and Selective Inference
King’s Communications, Learning & Information Processing (KCLIP) lab(国王通讯、学习与信息处理(KCLIP)实验室);Centre for Intelligent Information Processing Systems (CIIPS)(智能信息处理系统中心);Department of Engineering, King’s College London(伦敦国王学院工程系)
Spintronics based Stochastic Computing for Efficient Bayesian Inference System
Fert Beijing Research Institute, BDBC, School of Electronic and Information Engineering(费尔北京研究院,大数据科学与脑机智能高精尖创新中心,电子信息工程学院);Fert Beijing Research Institute, BDBC, School of Computer Science and Engineering(费尔北京研究院,大数据科学与脑机智能高精尖创新中心,计算机科学与工程学院);Department of Electrical and Computer Engineering, Duke University(杜克大学电气与计算机工程系);Beihang University(北京航空航天大学)