Fast Multiscale Diffusion On Graphs
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)(2022)
摘要
Diffusing a graph signal at multiple scales requires to compute the action of the exponential of as many versions of the Laplacian matrix. Considering the truncated Chebyshev polynomial approximation of the exponential, we derive a tightened bound on the approximation error, allowing thus for a better estimate of the polynomial degree that reaches a prescribed error. We leverage the properties of these approximations to factorize the computation of the action of the diffusion operator over multiple scales, thus drastically reducing its computational cost.
更多查看译文
关键词
Approximate computing,Chebyshev approximation,Computational efficiency,Estimation error
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要