Localized Linear Regression in Networked Data
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 paper, 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 primaldual method for solving the convex (non-smooth) nLasso problem.
Code (1)
Tasks
regressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Localized Learning of Robust Controllers for Networked Systems with Dynamic Topology
This paper addresses the problem of controller synthesis for networked systems with dynamic and unknown topology. Such networked systems arise in applications such as the power grid when lines between consumers are downe…
Multi-omic Network Regression: Methodology, Tool and Case Study
The analysis of biological networks is characterized by the definition of precise linear constraints used to cumulatively reduce the solution space of the computed states of a multi-omic (for instance metabolic, transcri…
regressionConsensus-based Networked Tracking in Presence of Heterogeneous Time-Delays
We propose a distributed (single) target tracking scheme based on networked estimation and consensus algorithms over static sensor networks. The tracking part is based on linear time-difference-of-arrival (TDOA) measurem…
Fault DetectionConvergence Rates for Localized Actor-Critic in Networked Markov Potential Games
We introduce a class of networked Markov potential games in which agents are associated with nodes in a network. Each agent has its own local potential function, and the reward of each agent depends only on the states an…
Decentralized and Compositional Interconnection Topology Synthesis for Linear Networked Systems
In this paper, we consider networked systems comprised of interconnected sets of linear subsystems and propose a decentralized and compositional approach to stabilize or dissipativate such linear networked systems via op…