Localized Linear Regression in Networked Data

Alexander Jung*, Nguyen Tran

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

6 Citations (Scopus)


The network Lasso (nLasso) has been proposed recently as an efficient learning algorithm for massive networked data sets (big data over networks). It extends the well-known least absolute shrinkage and selection operator (Lasso) from learning sparse (generalized) linear models to network models. Efficient implementations of the nLasso have been obtained using convex optimization methods lending to scalable message passing protocols. In this letter, we analyze the statistical properties of nLasso when applied to localized linear regression problems involving networked data. Our main result is a sufficient condition on the network structure and available label information such that nLasso accurately learns a localized linear regression model from a few labeled data points. We also provide an implementation of nLasso for localized linear regression by specializing a primal-dual method for solving the convex (non-smooth) nLasso problem.

Original languageEnglish
Article number8721536
Pages (from-to)1090-1094
Number of pages5
JournalIEEE Signal Processing Letters
Issue number7
Publication statusPublished - 1 Jul 2019
MoE publication typeA1 Journal article-refereed


  • Compressed sensing
  • learning systems
  • machine learning
  • optimization
  • prediction methods
  • statistical learning

Fingerprint Dive into the research topics of 'Localized Linear Regression in Networked Data'. Together they form a unique fingerprint.

Cite this