Research map / Graph learning / Graph algorithms and clustering
Exact inference in structured prediction
Kevin Bello, Jean Honorio
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 |
|---|---|---|---|
| Add Erdős-Rényi edges to a connected graph with poor expansion | SDP exact inference · Perturbed connected graphs | exact recovery | Improved |
| Use graph structure with sufficient expansion relative to maximum degree | SDP exact inference · General connected graphs | exact recovery probability | Improved |
| Use node observations to choose between the two globally sign-flipped candidates | Two-stage SDP and node-observation inference · n-node label vector | probability of choosing the correct global sign | Improved |
Closest papers by meaning
- Fairness constraints can help exact inference in structured prediction (NeurIPS 2020 · similarity 0.92)
- Unraveling the Impact of Heterophilic Structures on Graph Positive-Unlabeled Learning (ICML 2024 · similarity 0.86)
- Conformal Structured Prediction (ICLR 2025 · similarity 0.85)
- Graph Structure Inference with BAM: Neural Dependency Processing via Bilinear Attention (NeurIPS 2024 · similarity 0.85)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.85)
- On the Expressive Power of Tree-Structured Probabilistic Circuits (NeurIPS 2024 · 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.
