# Classifying Partially Labeled Networked Data via Logistic Network Lasso

arXiv: https://arxiv.org/abs/1903.10926 · HTML: https://mlsanity.com/paper/1903.10926/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Mar 2019.

## Built on by (most cited first, 1 of 1)

- [A Bayesian approach to multi-task learning with network lasso](https://mlsanity.com/paper/2110.09040/) (2021)

## Abstract (arXiv)

We apply the network Lasso to classify partially labeled data points which are characterized by high-dimensional feature vectors. In order to learn an accurate classifier from limited amounts of labeled data, we borrow statistical strength, via an intrinsic network structure, across the dataset. The resulting logistic network Lasso amounts to a regularized empirical risk minimization problem using the total variation of a classifier as a regularizer. This minimization problem is a non-smooth convex optimization problem which we solve using a primal-dual splitting method. This method is appealing for big data applications as it can be implemented as a highly scalable message passing algorithm.