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

线性估计中子集选择的改进贪婪算法

An Improved Greedy Algorithm for Subset Selection in Linear Estimation

University of Waterloo(滑铁卢大学);Delft University of Technology(代尔夫特理工大学)

Shamak Dutta, Nils Wilde, Stephen L. Smith

摘要:

在本文中,我们考虑一个空间域中的子集选择问题,我们试图找到一组k个位置,其观测提供了在有限集的预测位置的字段值的最佳估计。可以在连续场中的任何位置进行测量,并且在不同点处的场值之间的协方差由广泛使用的平方指数协方差函数给出。一种用于观测选择的方法是执行空间的网格离散化并且使用贪婪算法获得近似解。解的质量随着网格分辨率的提高而提高,但代价是增加了计算量。我们提出了一种方法,以减少计算复杂性,或相反,以提高解决方案的质量,通过考虑搜索空间的预测位置和质心的预测位置形成的集团的贪婪算法。我们证明了我们所提出的方法在仿真中的有效性,无论是在解决方案的质量和运行时间。

英文摘要:

In this paper, we consider a subset selection problem in a spatial field where we seek to find a set of k locations whose observations provide the best estimate of the field value at a finite set of prediction locations. The measurements can be taken at any location in the continuous field, and the covariance between the field values at different points is given by the widely used squared exponential covariance function. One approach for observation selection is to perform a grid discretization of the space and obtain an approximate solution using the greedy algorithm. The solution quality improves with a finer grid resolution but at the cost of increased computation. We propose a method to reduce the computational complexity, or conversely to increase solution quality, of the greedy algorithm by considering a search space consisting only of prediction locations and centroids of cliques formed by the prediction locations. We demonstrate the effectiveness of our proposed approach in simulation, both in terms of solution quality and runtime.

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

↑