Research map / Learning theory and algorithms / Combinatorial and search optimization
HS-CAI: A Hybrid DCOP Algorithm via Combining Search with Context-Based Inference
Dingding Chen, Yanchen Deng, Ziyu Chen, Wenxing Zhang, Zhongshi He
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 |
|---|---|---|---|
| Add context-based inference to HS-AI (ablation) | HS-AI · Sparse random DCOPs | message number | Improved |
| Add context-based inference to HS-AI (ablation) | HS-AI · Sparse random DCOPs | network load | Improved |
| Add context-based inference to HS-AI (ablation) | HS-AI · Sparse random DCOPs, 28 agents | NCLOs | Improved |
| Add context evaluation mechanism (ablation) | HS-CAI(-M) · Random DCOPs, 22 agents | network load | Improved |
| Use context evaluation to select patterns rather than infer for all contexts (ablation) | HS-CAI · Random DCOPs, 22 agents | network load | Improved |
| Increase memory limit from k=6 to k=10 (ablation) | HS-CAI · Dense random DCOPs | message number | Improved |
| Increase memory limit from k=6 to k=10 (ablation) | HS-CAI · Dense random DCOPs | NCLOs | Hurt |
| Vary the context evaluation threshold parameter rho (ablation) | HS-CAI · Random DCOPs, 22 agents | network load | Mixed |
| Use hybrid search and context-based inference | HS-CAI · Sparse random DCOPs | network load | Improved |
| Use hybrid search and context-based inference | HS-CAI · Sparse random DCOPs | message number | Improved |
| Use hybrid search with context-based inference under k=6 | HS-CAI · Sparse random DCOPs | problem size solved | Improved |
| Select context patterns instead of inferring for every cycle-cut-variable context | HS-CAI · Dense random DCOPs | network load | Improved |
Closest papers by meaning
- A Generic Approach to Accelerating Belief Propagation Based Incomplete Algorithms for DCOPs via a Branch-and-Bound Technique (AAAI 2019 · similarity 0.89)
- Pretrained Cost Model for Distributed Constraint Optimization Problems (AAAI 2022 · similarity 0.89)
- CoCoA: A Non-Iterative Approach to a Local Search (A)DCOP Solver (AAAI 2017 · similarity 0.88)
- GDBA Revisited: Unleashing the Power of Guided Local Search for Distributed Constraint Optimization (AAAI 2026 · similarity 0.87)
- Anchor Search: A Unified Framework for Suboptimal Bidirectional Search (AAAI 2025 · similarity 0.84)
- Step-by-Step Optimization-like Reasoning in LLMs over Expanding Search Spaces (NeurIPS 2026 · 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.
