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

信号插值的扩展图学习

Learning Expanding Graphs for Signal Interpolation

Delft University of Technology(代尔夫特理工大学)

Bishwadeep Das, Elvin Isufi

摘要:

在图上执行信号处理需要了解底层的固定拓扑。然而,随着时间的推移,随着新节点的出现,图的大小通常会增加,其连接性通常是未知的;因此,在冷启动推荐等应用中,下游任务更具挑战性。我们解决这样的挑战,信号插值在传入节点盲目的拓扑连接的特定节点。具体来说,我们提出了一个随机附件模型参数化的附件概率和边权重的传入节点。我们估计这些参数的数据驱动的方式,仅依赖于早期传入节点的连接行为,目标是内插信号值。我们研究手头的问题的非凸性,推导出条件时,它可以边际convexified,并提出了一个交替的预测下降的方法之间的估计附件的概率和边缘的权重。冷启动协同过滤的合成和真实数据处理的数值实验证实了我们的研究结果。

英文摘要:

Performing signal processing over graphs requires knowledge of the underlying fixed topology. However, graphs often grow in size with new nodes appearing over time, whose connectivity is typically unknown; hence, making more challenging the downstream tasks in applications like cold start recommendation. We address such a challenge for signal interpolation at the incoming nodes blind to the topological connectivity of the specific node. Specifically, we propose a stochastic attachment model for incoming nodes parameterized by the attachment probabilities and edge weights. We estimate these parameters in a data-driven fashion by relying only on the attachment behaviour of earlier incoming nodes with the goal of interpolating the signal value. We study the non-convexity of the problem at hand, derive conditions when it can be marginally convexified, and propose an alternating projected descent approach between estimating the attachment probabilities and the edge weights. Numerical experiments with synthetic and real data dealing in cold start collaborative filtering corroborate our findings.

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

↑