dc.contributor.author | Meireles Elias, Vitor Rosa | |
dc.contributor.author | Gogineni, Vinay Chakravarthi | |
dc.contributor.author | Martins, Wallace | |
dc.contributor.author | Werner, Stefan | |
dc.date.accessioned | 2022-02-11T13:11:30Z | |
dc.date.available | 2022-02-11T13:11:30Z | |
dc.date.created | 2022-02-10T10:06:51Z | |
dc.date.issued | 2022 | |
dc.identifier.issn | 1053-587X | |
dc.identifier.uri | https://hdl.handle.net/11250/2978501 | |
dc.description.abstract | This paper proposes efficient batch-based and online strategies for kernel regression over graphs (KRG). The proposed algorithms do not require the input signal to be a graph signal, whereas the target signal is defined over the graph. We first use random Fourier features (RFF) to tackle the complexity issues associated with kernel methods employed in the conventional KRG. For batch-based approaches, we also propose an implementation that reduces complexity by avoiding the inversion of large matrices. Then, we derive two distinct online strategies using RFF, namely, the mini-batch gradient KRG (MGKRG) and the recursive least squares KRG (RLSKRG). The stochastic-gradient KRG (SGKRG) is introduced as a particular case of the MGKRG. The MGKRG and the SGKRG are low-complexity algorithms that employ stochastic gradient approximations in the regression-parameter update. The RLSKRG is a recursive implementation of the RFF-based batch KRG. A detailed stability analysis is provided for the proposed online algorithms, including convergence conditions in both mean and mean-squared senses. A discussion on complexity is also provided. Numerical simulations include a synthesized-data experiment and real-data experiments on temperature prediction, brain activity estimation, and image reconstruction. Results show that the RFF-based batch implementation offers competitive performance with a reduced computational burden when compared to the conventional KRG. The MGKRG offers a convenient trade-off between performance and complexity by varying the number of mini-batch samples. The RLSKRG has a faster convergence than the MGKRG and matches the performance of the batch implementation. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
dc.title | Kernel Regression over Graphs using Random Fourier Features | en_US |
dc.type | Peer reviewed | en_US |
dc.type | Journal article | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | © IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | en_US |
dc.source.journal | IEEE Transactions on Signal Processing | en_US |
dc.identifier.doi | 10.1109/TSP.2022.3149134 | |
dc.identifier.cristin | 1999829 | |
dc.relation.project | Norges forskningsråd: 274717 | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 2 | |