The goal of this paper is to propose novel strategies for adaptive learning of signals defined over graphs, which are observed over a (randomly) time-varying subset of vertices. We recast two classical adaptive algorithms in the graph signal processing framework, namely the least mean squares (LMS) and the recursive least squares (RLS) adaptive estimation strategies. For both methods, a detailed mean-square analysis illustrates the effect of random sampling on the adaptive reconstruction capability and the steady-state performance. Then, several probabilistic sampling strategies are proposed to design the sampling probability at each node in the graph, with the aim of optimizing the tradeoff between steady-state performance, graph sampling rate, and convergence rate of the adaptive algorithms. Finally, a distributed RLS strategy is derived and shown to be convergent to its centralized counterpart. Numerical simulations carried out over both synthetic and real data illustrate the good performance of the proposed sampling and recovery strategies for (distributed) adaptive learning of signals defined over graphs.

Adaptive graph signal processing: algorithms and optimal sampling strategies / Di Lorenzo, P.; Banelli, P.; Isufi, E.; Leus, G.; Barbarossa, S.. - In: IEEE TRANSACTIONS ON SIGNAL PROCESSING. - ISSN 1053-587X. - 66:13(2018), pp. 3584-3598. [10.1109/TSP.2018.2835384]

Adaptive graph signal processing: algorithms and optimal sampling strategies

Di Lorenzo, P.;Barbarossa, S.
2018

Abstract

The goal of this paper is to propose novel strategies for adaptive learning of signals defined over graphs, which are observed over a (randomly) time-varying subset of vertices. We recast two classical adaptive algorithms in the graph signal processing framework, namely the least mean squares (LMS) and the recursive least squares (RLS) adaptive estimation strategies. For both methods, a detailed mean-square analysis illustrates the effect of random sampling on the adaptive reconstruction capability and the steady-state performance. Then, several probabilistic sampling strategies are proposed to design the sampling probability at each node in the graph, with the aim of optimizing the tradeoff between steady-state performance, graph sampling rate, and convergence rate of the adaptive algorithms. Finally, a distributed RLS strategy is derived and shown to be convergent to its centralized counterpart. Numerical simulations carried out over both synthetic and real data illustrate the good performance of the proposed sampling and recovery strategies for (distributed) adaptive learning of signals defined over graphs.
File allegati a questo prodotto
File Dimensione Formato  
DiLorenzo_Post-print_Adaptive_2018.pdf

solo gestori archivio

Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 603.2 kB
Formato Adobe PDF
603.2 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
DiLorenzo_Adaptive_2018.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.29 MB
Formato Adobe PDF
1.29 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11573/1163141
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 48
  • ???jsp.display-item.citation.isi??? 41
social impact