Research map / Learning theory and algorithms / Combinatorial and search optimization
Non-approximate Inference for Collective Graphical Models on Path Graphs via Discrete Difference of Convex Algorithm
Yasunori Akagi, Naoki Marumo, Hideaki Kim, Takeshi Kurashima, Hiroyuki Toda
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 |
|---|---|---|---|
| Replace approximate relaxed inference with exact integer-valued DCA inference | CGM MAP inference on path graphs · Synthetic instances, uniform and distance potentials; small population | objective function: -7.19e+01 -> -9.97e+01; 3.20e+01 -> 3.35e-01 | Improved |
| Replace approximate relaxed inference with exact integer-valued DCA inference | CGM MAP inference on path graphs · Real-world car trajectories, M=10^1, R=56 and R=208 | objective function: 2.76e+02 -> 2.30e+00; 3.83e+02 -> 2.30e+00 | Improved |
| Use the left-endpoint slope rather than the midpoint slope for the surrogate (ablation) | Proposed DCA · Synthetic instances | objective function: -9.81e+01 -> -9.97e+01 | Improved |
| Use the left-endpoint slope rather than the right-endpoint slope for the surrogate (ablation) | Proposed DCA · Synthetic instances | objective function: -9.64e+01 -> -9.97e+01 | Improved |
| Use the midpoint slope rather than the right-endpoint slope for the surrogate (ablation) | Proposed DCA · Synthetic, distance potential (M=10^1, R=10) | objective function: 3.35e-01 -> 3.35e-01 | No clear effect |
| Use exact integer-valued inference instead of continuous relaxation | CGM MAP inference on path graphs · Synthetic instances (R=20, M=10^2) | sparsity: 0% -> 76%; 0% -> 83% | Improved |
Closest papers by meaning
- Maximum A Posteriori Inference in Sum-Product Networks (AAAI 2018 · similarity 0.87)
- Exact Inference on Gaussian Graphical Models of Arbitrary Topology using Path-Sums (JMLR 2016 · similarity 0.86)
- Inference in Graphical Models via Semidefinite Programming Hierarchies (NeurIPS 2017 · similarity 0.86)
- Generalized Probabilistic Graphical Modeling for Multi-View Bipartite Graph Clustering (TPAMI 2025 · similarity 0.86)
- From Fields to Random Trees (ICLR 2026 · similarity 0.85)
- Cooperative Graphical Models (NeurIPS 2016 · 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.
