跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2505.11294 · v4

Bidirectional Information Flow (BIF) - A Sample Efficient Hierarchical Gaussian Process for Bayesian Optimization

首次提交 2025-05-16 22:26
版本更新 2026-11-14 02:55
雷达观测 2026-11-16 13:44
arXiv ↗PDF ↗

摘要

Hierarchical Gaussian Process (H-GP) models divide problems into different subtasks, allowing for different components to address each part, making them well-suited for problems with inherent compositional structure. However, existing H-GP frameworks typically employ one-way information sharing - either top-down or bottom-up - which limits sample efficiency and slows convergence. We propose Bidirectional Information Flow (BIF), which establishes continuous two-way communication. BIF retains the modular structure of hierarchical models - the parent conditions its own posterior on child summaries, treating them as structured priors - while introducing top-down feedback to softly decompose environment observations from the parent into sub-responses. This mutual exchange improves sample efficiency, enables robust training, and allows modular reuse of learned subtask models. We prove analytically the regret of a GP with a learned kernel scales linearly with the mismatch to the true kernel, tightening in the hierarchical case to the sum of child-level errors. Ablation shows removing the downward pathway collapses child R2R^2 by up to 58%. Across synthetic, neurostimulation, and HPO benchmarks, BIF achieves up to 4×4\times higher parent R2R^2 and roughly 100% AUC improvement over vanilla GPBO, and outperforms or is the runner-up in 38/40 tests compared to the state-of-the-art baselines while supporting modular child transfer to novel composite tasks.

作者备注:NeurIPS 2026 Camera Ready

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-14 02:55 · 最新观测版本

Bidirectional Information Flow (BIF) - A Sample Efficient Hierarchical Gaussian Process for Bayesian Optimization

Hierarchical Gaussian Process (H-GP) models divide problems into different subtasks, allowing for different components to address each part, making them well-suited for problems with inherent compositional structure. However, existing H-GP frameworks typically employ one-way information sharing - either top-down or bottom-up - which limits sample efficiency and slows convergence. We propose Bidirectional Information Flow (BIF), which establishes continuous two-way communication. BIF retains the modular structure of hierarchical models - the parent conditions its own posterior on child summaries, treating them as structured priors - while introducing top-down feedback to softly decompose environment observations from the parent into sub-responses. This mutual exchange improves sample efficiency, enables robust training, and allows modular reuse of learned subtask models. We prove analytically the regret of a GP with a learned kernel scales linearly with the mismatch to the true kernel, tightening in the hierarchical case to the sum of child-level errors. Ablation shows removing the downward pathway collapses child R2R^2 by up to 58%. Across synthetic, neurostimulation, and HPO benchmarks, BIF achieves up to 4×4\times higher parent R2R^2 and roughly 100% AUC improvement over vanilla GPBO, and outperforms or is the runner-up in 38/40 tests compared to the state-of-the-art baselines while supporting modular child transfer to novel composite tasks.

查看此版本解读 →查看此版本原文 ↗