Kam-Yiu Lam

Improved Dynamic Graph Learning through Fault-Tolerant Sparsification

Graph sparsification has been used to improve the computational cost of learning over graphs, e.g., Laplacian-regularized estimation and graph semi-supervised learning (SSL). However, when graphs vary over time, repeated sparsification requires polynomial order computational cost per update. We prop…