Graph neural networks (GNNs) are popular to use for classifying structured data in the context of machine learning. But surprisingly, they are rarely applied to regression problems. In this work, we adopt GNN for a classic but challenging nonlinear regression problem, namely the network localization. Our main findings are in order. First, GNN is potentially the best solution to large-scale network localization in terms of accuracy, robustness and computational time. Second, proper thresholding of the communication range is essential to its superior performance. Simulation results corroborate that the proposed GNN based method outperforms all state-of-the-art benchmarks by far. Such inspiring results are theoretically justified in terms of data aggregation, non-line-of-sight (NLOS) noise removal and low-pass filtering effect, all affected by the threshold for neighbor selection. Code is available at https://github.com/Yanzongzi/GNN-For-localization.
翻译:图像神经网络(GNNs)很受欢迎,可用于在机器学习的背景下对结构化数据进行分类。但令人惊讶的是,它们很少应用于回归问题。在这项工作中,我们采用GNN, 解决一个经典但具有挑战性的非线性回归问题,即网络本地化。我们的主要结论是有序的。首先,GNN可能是大规模网络本地化的最佳解决方案,在准确性、稳健性和计算时间方面。第二,正确设定通信范围是其优异性表现的关键。模拟结果证实,拟议的基于GNN方法远超了所有最新基准。从理论上讲,这种令人鼓舞的结果在数据汇总、非线性视觉(NLOS)噪音清除和低通道过滤效果方面是合理的,所有这些都受到邻居选择门槛的影响。代码可在 https://github.com/Yanzongzi/GNN-For-localization查阅 http://github.com/Yanzongzi/GNN-For-For-location上查阅。