Research map / Graph learning / Graph algorithms and clustering
Structured Prediction Theory Based on Factor Graph 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 |
|---|---|---|---|
| apply VRM-based complexity weighting (VCRF) instead of standard CRF | structured prediction on part-of-speech datasets · POS datasets | accuracy | Helped |
Closest papers by meaning
- Towards Sharper Generalization Bounds for Structured Prediction (NeurIPS 2021 · similarity 0.91)
- Structured Prediction with Stronger Consistency Guarantees (NeurIPS 2023 · similarity 0.88)
- A Smoother Way to Train Structured Prediction Models (NeurIPS 2018 · similarity 0.87)
- On Contraction of Sequential and Offset Rademacher Complexities (ICML 2026 · similarity 0.87)
- LP-SparseMAP: Differentiable Relaxed Optimization for Sparse Structured Prediction (ICML 2020 · similarity 0.87)
- On the Expressive Power of Tree-Structured Probabilistic Circuits (NeurIPS 2024 · 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.