Article (Scientific journals)
Kernel Regression over Graphs using Random Fourier Features
Elias, Vitor R.M.; Gogineni, Vinay C.; Alves Martins, Wallace et al.
2022In IEEE Transactions on Signal Processing
Peer Reviewed verified by ORBi
 

Files


Full Text
IEEE-TSP-KRG-2022.pdf
Author postprint (1.95 MB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
kernel regression on graphs; random Fourier features; stochastic gradient; recursive least squares
Abstract :
[en] 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.
Disciplines :
Electrical & electronics engineering
Author, co-author :
Elias, Vitor R.M.
Gogineni, Vinay C.
Alves Martins, Wallace ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom
Werner, Stefan
External co-authors :
yes
Language :
English
Title :
Kernel Regression over Graphs using Random Fourier Features
Publication date :
2022
Journal title :
IEEE Transactions on Signal Processing
ISSN :
1053-587X
Publisher :
Institute of Electrical and Electronics Engineers, United States
Peer reviewed :
Peer Reviewed verified by ORBi
Focus Area :
Security, Reliability and Trust
European Projects :
H2020 - 742648 - AGNOSTIC - Actively Enhanced Cognition based Framework for Design of Complex Systems
Funders :
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Grant number: 88887.310189/2018-00
FAPERJ - Brasil
Forskningsrådet [NO]
CE - Commission Européenne [BE]
Available on ORBilu :
since 10 February 2022

Statistics


Number of views
61 (8 by Unilu)
Number of downloads
0 (0 by Unilu)

Scopus citations®
 
11
Scopus citations®
without self-citations
10
WoS citations
 
10

Bibliography


Similar publications



Contact ORBilu