@article {28392,
	title = {Sparse Online Learning with Kernels using Random Features for Estimating Nonlinear Dynamic Graphs},
	journal = {IEEE Transactions on Signal Processing},
	volume = {71},
	year = {2023},
	note = {This work is a joint collaboration between SimulaMet and University of Agder. This work was supported by the IKTPLUSS INDURB grant 270730/O70 and the SFI Offshore Mechatronics grant 237896/O30 from the Research Council of Norway.\&nbsp;},
	month = {06/2023},
	pages = {2027-2042},
	publisher = {IEEE},
	abstract = {Online topology estimation of graph-connected time series is challenging in practice, particularly because the dependencies between the time series in many real-world scenarios are nonlinear. To address this challenge, we introduce a novel kernel-based algorithm for online graph topology estimation. Our proposed algorithm also performs a Fourier-based random feature approximation to tackle the curse of dimensionality associated with kernel representations. Exploiting the fact that real-world networks often exhibit sparse topologies, we propose a group-Lasso based optimization framework, which is solved using an iterative composite objective mirror descent method, yielding an online algorithm with fixed computational complexity per iteration. We provide theoretical guarantees for our algorithm and prove that it can achieve sublinear dynamic regret under certain reasonable assumptions. In experiments conducted on both real and synthetic data, our method outperforms existing state-of-the-art competitors.},
	issn = {1941-0476},
	doi = {10.1109/TSP.2023.3282068},
	url = {https://ieeexplore.ieee.org/document/10141675},
	author = {Money, Rohan and Krishnan, Joshin and Beferull-Lozano, Baltasar}
}
