arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.04425stat.MLcs.LG
收藏

贝叶斯加性回归网络

Bayesian Additive Regression Networks

University of Arizona(亚利桑那大学);Data Diversity Lab, University of Arizona(亚利桑那大学数据多样性实验室)

Danielle Van Boxel

AI总结:

本文提出BARN,将BART的贝叶斯加性思想用于单隐藏层神经网络集成,通过MCMC与吉布斯残差采样提升回归精度。

摘要:

我们将贝叶斯加性回归树(BART)原理应用于训练用于回归任务的小型神经网络集成。利用马尔可夫链蒙特卡洛方法,我们从具有单个隐藏层的神经网络的后验分布中采样。为了构建这些网络的集成,我们应用吉布斯采样,根据残差目标值(即减去其他网络的影响)更新每个网络。我们在多个基准回归问题上展示了该技术的有效性,并将其与等效的浅层神经网络、BART和普通最小二乘法进行比较。我们的贝叶斯加性回归网络(BARN)提供了更一致且通常更准确的结果。在测试数据基准上,BARN的均方根误差平均降低5%至20%。然而,这种误差性能确实以更长的计算时间为代价。BARN有时需要约一分钟,而竞争方法只需一秒或更短时间。但是,不进行交叉验证超参数调优的BARN所需的计算时间与经过调优的其他方法大致相同,而BARN通常仍然更准确。

英文摘要:

We apply Bayesian Additive Regression Tree (BART) principles to training an ensemble of small neural networks for regression tasks. Using Markov Chain Monte Carlo, we sample from the posterior distribution of neural networks that have a single hidden layer. To create an ensemble of these, we apply Gibbs sampling to update each network against the residual target value (i.e. subtracting the effect of the other networks). We demonstrate the effectiveness of this technique on several benchmark regression problems, comparing it to equivalent shallow neural networks, BART, and ordinary least squares. Our Bayesian Additive Regression Networks (BARN) provide more consistent and often more accurate results. On test data benchmarks, BARN averaged between 5 to 20 percent lower root mean square error. This error performance does come at the cost, however, of greater computation time. BARN sometimes takes on the order of a minute where competing methods take a second or less. But, BARN without cross-validated hyperparameter tuning takes about the same amount of computation time as tuned other methods. Yet BARN is still typically more accurate.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑