Research map / Learning theory and algorithms / Matrix and tensor methods
Newton-Type Methods for Inference in Higher-Order Markov Random Fields
Check 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 |
|---|---|---|---|
| Use trust-region Newton instead of first-order FISTA | Higher-order MRF inference · Tsukuba stereo | Iterations: 594 -> 357 | Helped |
| Use trust-region Newton rather than first-order methods | TRN-MRF · Higher-order MRF problems | convergence behavior | Mixed |
| Use trust-region Newton rather than AD3 | Higher-order MRF inference · House dataset, Frame 110 | convergence | Helped |
Closest papers by meaning
- Accelerated Message Passing for Entropy-Regularized MAP Inference (ICML 2020 · similarity 0.90)
- Continuous Relaxation of MAP Inference: A Nonconvex Perspective (CVPR 2018 · similarity 0.89)
- Lifted Hinge-Loss Markov Random Fields (AAAI 2019 · similarity 0.87)
- Inference of Online Newton Methods with Nesterov's Accelerated Sketching (ICML 2026 · similarity 0.87)
- Distributed Second Order Methods with Fast Rates and Compressed Communication (ICML 2021 · similarity 0.86)
- Efficient semidefinite-programming-based inference for binary and multi-class MRFs (NeurIPS 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.