Learning Over Multitask Graphs—Part I: Stability Analysis
This paper formulates a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. The smoothness condition softens the transition in the tasks among adjacent nodes and...
Main Authors: | Roula Nassif, Stefan Vlaski, Cedric Richard, Ali H. Sayed |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Open Journal of Signal Processing |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9075197/ |
Similar Items
-
Learning Over Multitask Graphs—Part II: Performance Analysis
by: Roula Nassif, et al.
Published: (2020-01-01) -
COMBINING LAPLACIAN AND SOBEL GRADIENT FOR GREATER SHARPENING
by: Suneet Gupta, et al.
Published: (2016-05-01) -
The Effect of Background Noise on Multitasking
by: Moor, Jaclyn Marie, et al.
Published: (2017) -
PREDICTORS OF MULTITASKING BEHAVIOR AND THE IMPACT OF MULTITASKING ON LEARNING
by: Chang, Tree
Published: (2012) -
On net-Laplacian energy of signed graphs
by: Nutan G. Nayak
Published: (2017-01-01)