Research map / Learning theory and algorithms / Combinatorial and search optimization
Anytime Anyspace AND/OR Search for Bounding the Partition Function
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 |
|---|---|---|---|
| use AND/OR search tree instead of OR (chain) search (ablation) | Best-first partition function bounding with gap priority · Protein, tight tolerance, 16GB | instances solved: 13 -> 19 | Helped |
| use AND/OR search tree instead of OR (chain) search (ablation) | Best-first bounding, gap priority · BN, loose tolerance, 1GB | instances solved: 35 -> 39 | Helped |
| use gap priority instead of upper priority (ablation) | AOBFS · Protein, tight tolerance, 1GB | instances solved: 15 -> 16 | Helped |
| use gap priority instead of upper priority (ablation) | AOBFS · CPD, tight tolerance, 4GB | instances solved: 95 -> 98 | Helped |
| use gap priority instead of upper priority (ablation) | AOBFS · Loose tolerance, all benchmarks | instances solved | No clear effect |
| use AOBFS best-first search instead of Z*_eps | Partition function bounding · Protein, tight tolerance, 16GB | instances solved: 12 -> 19 | Helped |
| use AOBFS best-first search instead of Z*_eps | Partition function bounding · CPD, tight tolerance, 1GB | instances solved: 100 -> 95 | Hurt |
| use AOBFS instead of VEC | Partition function bounding · CPD, tight tolerance, 1GB | instances solved: 36 -> 95 | Helped |
| increase memory budget from 1GB to 16GB | AOBFS (A-G) · BN, tight tolerance | instances solved: 32 -> 42 | Helped |
| increase memory budget from 1GB to 16GB | MMAP-DFS · Protein, tight tolerance | instances solved: 9 -> 11 | Helped |
Closest papers by meaning
- Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP (AAAI 2018 · similarity 0.91)
- Dynamic Importance Sampling for Anytime Bounds of the Partition Function (NeurIPS 2017 · similarity 0.91)
- Anytime Best+Depth-First Search for Bounding Marginal MAP (AAAI 2017 · similarity 0.89)
- Anytime Recursive Best-First Search for Bounding Marginal MAP (AAAI 2019 · similarity 0.88)
- A Unified Framework for Entropy Search and Expected Improvement in Bayesian Optimization (ICML 2025 · similarity 0.84)
- Bayesian Optimization of Functions over Node Subsets in Graphs (NeurIPS 2024 · 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.