AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

A Unified Framework for Structured Graph Learning via Spectral Constraints

Sandeep Kumar, Jiaxi Ying, José Vinícius de M. Cardoso, Daniel P. Palomar

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

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
enforce Laplacian spectral constraints (SGL) instead of CGLgraph Laplacian learning · Grid graph (p=64)n/p needed for relative error 0.1: 30 -> 5Improved
enforce Laplacian spectral constraints (SGL) instead of QPgraph Laplacian learning · Grid graph (p=64)n/p needed for relative error 0.1: 29 -> 5Improved
enforce Laplacian spectral constraints (SGL) instead of Naive pseudo-inversegraph Laplacian learning · Grid graph (p=64)n/p needed for relative error 0.1: 80 -> 5Improved

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