Research map / Learning theory and algorithms / Combinatorial and search optimization
Learning Chordal Markov Networks via Branch and Bound
Kari Rantanen, Antti Hyttinen, Matti Järvisalo
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 |
|---|---|---|---|
| Use branch and bound (BBMarkov) instead of GOBNILP integer programming | BBMarkov · 54 real-world datasets | runtime | Improved |
| Use BBMarkov instead of Junctor DP on small n | BBMarkov · Wine n=13 | runtime (s): 6 -> <1 | Improved |
| Use BBMarkov instead of Junctor on Letter | BBMarkov · Letter n=16 | runtime (s): 592 -> >3600 | Hurt |
| Use BBMarkov instead of Junctor on Voting | BBMarkov · Voting n=17 | runtime (s): 3050 -> 281 | Improved |
| Use BBMarkov instead of Junctor on Tumor | BBMarkov · Tumor n=18 | runtime (s): 12019 -> 610 | Improved |
| Use BBMarkov instead of Junctor at n=19 | BBMarkov · Alarm n=19 | runtime (s): 52130 -> 10274 | Improved |
| Use BBMarkov instead of Junctor at n=20 | BBMarkov · Alarm n=20 | runtime (s): mo -> 49610 | Improved |
| Use BBMarkov instead of Junctor on Water10000 | BBMarkov · Water10000 n=17 | runtime (s): 2928 -> >3600 | Hurt |
| Use BBMarkov instead of Junctor on Water1000 | BBMarkov · Water1000 n=17 | runtime (s): 2592 -> 2731 | No clear effect |
| Use BBMarkov instead of Junctor in memory | BBMarkov · n=19 memory | memory: approx. 1 GB vs close to 30 GB | Improved |
| Increase sample size on Water (100, 1000, 10000) for BBMarkov (ablation) | BBMarkov · Water n=17 | runtime (s): 100 -> 2731 -> >3600 | Hurt |
| Tighter upper bounds that account for immoralities relaxedly (ablation) | BBMarkov · search | overall runtime | Improved |
Closest papers by meaning
- DMCP: Differentiable Markov Channel Pruning for Neural Networks (CVPR 2020 · similarity 0.85)
- $\texttt{STRCMP}$: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization (NeurIPS 2025 · similarity 0.84)
- Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound (AAAI 2025 · similarity 0.84)
- Markov Equivalence and Consistency in Differentiable Structure Learning (NeurIPS 2024 · similarity 0.83)
- A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems (ICML 2024 · similarity 0.83)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.83)
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.
