atlas

Research map / Graph learning / Graph algorithms and clustering

Nonconvex Sparse Graph Learning under Laplacian Constrained Graphical Model

NeurIPS 2020 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 20 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
increase l1 regularization lambda from 0 to 10 (ablation)l1-norm Laplacian constrained graph learning · Barabasi-Albert p=50relative error: 0.14 -> 0.99Hurt
increase l1 regularization lambda (ablation)l1-norm Laplacian constrained graph learning · Barabasi-Albert p=50number of nonzero edges: 135 -> 1225Hurt
replace l1 penalty with nonconvex MCP or SCAD penaltyLaplacian constrained GGM estimation · Barabasi-Albert p=50, n/p=100F-score: F-score 1 at lambda 0.1 or 0.25Helped
replace l1 penalty with nonconvex MCP/SCADLaplacian constrained GGM estimation · Barabasi-Albert, varying n/prelative error and F-scoreHelped
replace GLE-ADMM with NGL-SCAD/NGL-MCPgraph learning · 2019-nCoV datacomputation time (s): 2.9 -> 0.7Helped

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