Metraipolis › archive › dc_184b2fc863ce
AgentCBO: Causal Belief Routing for Bayesian Optimization under Unknown Graphs — arXiv:2611.01317
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01317
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:36:48.055Z
- SHA-256 of the archived text
56702a8faeada2edba40bb7f79021f12072a476708b51b35ee1b8f788d1da70f- Stable URL of this page
https://metraipolis.com/documento/dc_184b2fc863ce
How to cite
AgentCBO: Causal Belief Routing for Bayesian Optimization under Unknown Graphs — arXiv:2611.01317 — arXiv (en), https://arxiv.org/abs/2611.01317 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_184b2fc863ce (Metraipolis archive dc_184b2fc863ce, sha256 56702a8faeada2edba40bb7f79021f12072a476708b51b35ee1b8f788d1da70f)
BibTeX
@misc{dc184b2fc863ce,
title = {AgentCBO: Causal Belief Routing for Bayesian Optimization under Unknown Graphs — arXiv:2611.01317},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01317},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_184b2fc863ce; sha256 56702a8faeada2edba40bb7f79021f12072a476708b51b35ee1b8f788d1da70f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01317. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Causal Bayesian optimization (CBO) typically relies on the unrealistic assumption of a perfectly known causal graph. Recent methods relax this constraint by coupling optimization with structure learning, but they often waste sample budgets on structural uncertainties that are irrelevant to the optimizer. In this paper, we formalize routing-equivalence to shift the objective from full causal-graph recovery to causal belief routing, where structural differences only matter when they alter optimizer-facing objects such as admissible exploration sets and do-priors. Furthermore, we propose agentcbo, a graph-belief routing framework that incorporates LLM causal priors through guarded proposal and commit mechanisms. Specifically, a Language-Prior Agent combines LLM beliefs with constraint-based discovery to extract a protected causal backbone alongside residual uncertain edges. A Calibration Agent and a Residual Repair Agent then refine only these uncertain structures through score-gated bounded local edits. Finally, a deterministic commit gate evaluates candidate updates using routing-proxy checks before allowing them to influence intervention selection. Across ten benchmarks, agentcbo performs comparably to known-graph CBO, demonstrating that guarded LLM priors can improve fixed-budget CBO performance. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2611.01317 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T18:12:54.488Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).