pith. sign in

arxiv: 1710.03942 · v1 · pith:WTJQ7KGWnew · submitted 2017-10-11 · 💻 cs.LG

When is Network Lasso Accurate: The Vector Case

classification 💻 cs.LG
keywords datainformationlassonetworknlassolabelnetwork-structuredaccurate
0
0 comments X
read the original abstract

A recently proposed learning algorithm for massive network-structured data sets (big data over networks) is the network Lasso (nLasso), which extends the well- known Lasso estimator from sparse models to network-structured datasets. Efficient implementations of the nLasso have been presented using modern convex optimization methods. In this paper, we provide sufficient conditions on the network structure and available label information such that nLasso accurately learns a vector-valued graph signal (representing label information) from the information provided by the labels of a few data points.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.