Research map / Graph learning / Graph algorithms and clustering
Sparse Quadratic Approximation for Graph Learning
Dimosthenis Pasadakis, Matthias Bollhöfer, Olaf Schenk
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Nonconvex Sparse Graph Learning under Laplacian Constrained Graphical Model (NeurIPS 2020 · similarity 0.91)
- A Completely Tuning-Free and Robust Approach to Sparse Precision Matrix Estimation (ICML 2022 · similarity 0.88)
- Learning Laplacian Matrix from Graph Signals with Sparse Spectral Representation (JMLR 2021 · similarity 0.88)
- Adaptive Estimation of Graphical Models under Total Positivity (ICML 2023 · similarity 0.87)
- Estimation of Sparse Gaussian Graphical Models with Hidden Clustering Structure (JMLR 2024 · similarity 0.87)
- Scalable Probabilistic Matrix Factorization with Graph-Based Priors (AAAI 2020 · similarity 0.86)
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.
