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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| enforce Laplacian spectral constraints (SGL) instead of CGL | graph Laplacian learning · Grid graph (p=64) | n/p needed for relative error 0.1: 30 -> 5 | Improved |
| enforce Laplacian spectral constraints (SGL) instead of QP | graph Laplacian learning · Grid graph (p=64) | n/p needed for relative error 0.1: 29 -> 5 | Improved |
| enforce Laplacian spectral constraints (SGL) instead of Naive pseudo-inverse | graph Laplacian learning · Grid graph (p=64) | n/p needed for relative error 0.1: 80 -> 5 | Improved |
Closest papers by meaning
- Structured Graph Learning Via Laplacian Spectral Constraints (NeurIPS 2019 · similarity 0.96)
- Graph Structure Inference with BAM: Neural Dependency Processing via Bilinear Attention (NeurIPS 2024 · similarity 0.88)
- On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks (ICML 2025 · similarity 0.88)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.88)
- Structural Entropy Based Graph Structure Learning for Node Classification (AAAI 2024 · similarity 0.87)
- Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective (NeurIPS 2024 · similarity 0.87)
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.
