AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Pursuit of the Cluster Structure of Network Lasso: Recovery Condition and Non-convex Extension

Shotaro Yagishita, Jun-ya Gotoh

JMLR 2024 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use network trimmed lasso instead of CFLA(S)clustering of linear-model clients · 100 clients, N=4, nu=100max adjusted Rand index: 0.3913 -> 0.9289Improved
use network trimmed lasso instead of CFLA(G)clustering of linear-model clients · 100 clients, N=8, nu=100max adjusted Rand index: 0.5568 -> 0.8189Improved
use NTL instead of CFLA(S) with abundant dataclustering of linear-model clients · 100 clients, N=8, nu=1000max adjusted Rand index: 0.8676 -> 0.9698Improved
use NTL instead of CFLA(G) with scarce dataclustering of linear-model clients · 100 clients, N=4, nu=10max adjusted Rand index: 0.4682 -> 0.2392Hurt
use NTL instead of CFLA(S) with abundant dataclustering of linear-model clients · 100 clients, N=4, nu=1000max adjusted Rand index: 0.9488 -> 0.9773Improved
use NTL instead of uniform-weight convex clusteringclustering · irismax adjusted Rand index: 0.0015 -> 0.5778Improved
use NTL instead of weighted convex clustering w2clustering · digits (n = 500)max adjusted Rand index: 0.5346 -> 0.3967Hurt
use NTL instead of weighted convex clustering w2clustering · winemax adjusted Rand index: 0.7994 -> 0.8260Improved
sparser prior weights w2 instead of w1 (ablation)convex clustering · digits (n = 100)max adjusted Rand index: 0.4577 -> 0.5101Improved
use NTL instead of network lasso with ample prior weightspiecewise constant fitting · 1000 noisy signalslevel estimation accuracyImproved
use NTL instead of convex clustering w2 (computation)ADMM runtime · digits (n = 500)CPU seconds per ADMM run: 59.0054 -> 81.8792Hurt
initialize NTL from the network lasso midpoint solution (ablation)NTL · two-cluster regressioncluster recoveryImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy