arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.07480eess.SPcs.LG
收藏

用于实现计算高效预测的自适应基函数选择方法

Adaptive Basis Function Selection for Computationally Efficient Predictions

Linköping University(林雪平大学);Delft University of Technology(代尔夫特理工大学);KTH Royal Institute of Technology(瑞典皇家理工学院)

Anton Kullberg, Frida Viset, Isaac Skog, Gustaf Hendeby

AI总结:

针对基函数展开计算预测方差时复杂度随基函数数量二次增长的问题,提出子域内自适应筛选重要基函数的方法,在保证预测精度的同时将计算量降低50%-75%。

摘要:

基函数(BF)展开是工程人员进行计算函数逼近的核心工具,与神经网络和高斯过程均存在关联。尽管基函数展开是一种直观易用的模型,但若要计算预测方差,其计算复杂度会随基函数数量呈二次增长。我们提出了一种方法,可在模型域的子区域内自动筛选对预测最重要的基函数。该方法在保持预测精度的同时,显著降低了预测计算的复杂度。我们通过两个数值算例验证了所提方法,结果表明计算量可降低50%-75%,且不会显著损失预测精度。

英文摘要:

Basis Function (BF) expansions are a cornerstone of any engineer's toolbox for computational function approximation which shares connections with both neural networks and Gaussian processes. Even though BF expansions are an intuitive and straightforward model to use, they suffer from quadratic computational complexity in the number of BFs if the predictive variance is to be computed. We develop a method to automatically select the most important BFs for prediction in a sub-domain of the model domain. This significantly reduces the computational complexity of computing predictions while maintaining predictive accuracy. The proposed method is demonstrated using two numerical examples, where reductions up to 50-75% are possible without significantly reducing the predictive accuracy.

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

↑