Research map / Graph learning / Graph algorithms and clustering
Structure Learning with Side Information: Sample Complexity
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 changed | Where | Measured | Effect |
|---|---|---|---|
| increase distortion tolerance d in recovered graph | ML decoder · Simulated Ising graphs, p in [50,500], alpha=20, eta=0.5, n=40 | probability of error | Helped |
| increase graph size p with number of edges k fixed | ML decoder · Simulated Ising graphs, alpha=20, eta=0.5, n=40 | probability of error | Hurt |
Closest papers by meaning
- Learning to Discover Sparse Graphical Models (ICML 2017 · similarity 0.89)
- Learning the Finer Things: Bayesian Structure Learning at the Instantiation Level (AAAI 2023 · similarity 0.88)
- A Generic Family of Graphical Models: Diversity, Efficiency, and Heterogeneity (ICML 2025 · similarity 0.86)
- Graph Structure Inference with BAM: Neural Dependency Processing via Bilinear Attention (NeurIPS 2024 · similarity 0.85)
- Rethinking Cancer Gene Identification Through Graph Anomaly Analysis (AAAI 2025 · similarity 0.85)
- Learning Latent Graph Structures and their Uncertainty (ICML 2025 · similarity 0.85)
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.