Online Learning Of Expanding Graphs
<|reference_start|>Online Learning Of Expanding Graphs: This paper addresses the problem of online network topology inference for expanding graphs from a stream of spatiotemporal signals. Online algorithms for dynamic graph learning are crucial in delay-sensitive applications or when changes in topology occur rapidly. While existing works focus on inferring the connectivity within a fixed set of nodes, in practice, the graph can grow as new nodes join the network. This poses additional challenges like modeling temporal dynamics involving signals and graphs of different sizes. This growth also increases the computational complexity of the learning process, which may become prohibitive. To the best of our knowledge, this is the first work to tackle this setting. We propose a general online algorithm based on projected proximal gradient descent that accounts for the increasing graph size at each iteration. Recursively updating the sample covariance matrix is a key aspect of our approach. We introduce a strategy that enables different types of updates for nodes that just joined the network and for previously existing nodes. To provide further insights into the proposed method, we specialize it in Gaussian Markov random field settings, where we analyze the computational complexity and characterize the dynamic cumulative regret. Finally, we demonstrate the effectiveness of the proposed approach using both controlled experiments and real-world datasets from epidemic and financial networks.<|reference_end|>
@article{rey2024online,
    title={Online Learning Of Expanding Graphs},
    author={Samuel Rey, Bishwadeep Das, Elvin Isufi},
    journal={arXiv preprint arXiv:2409.08660},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.08660},
    primaryClass={cs.LG eess.SP}
}