arXiv:2503.00924stat.MLcs.LG2025-03ICLR被引 8

用神经网络加速偏好优化,让人类反馈更高效。

PABBO: Preferential Amortized Black-Box Optimization

  • 用Transformer神经过程联合元学习代理模型和选择策略
  • 比传统高斯过程方法快数十倍,且准确率更高
  • 适合需要快速交互的个性化设计场景

偏好贝叶斯优化(PBO)是一种从成对设计的用户偏好反馈中高效学习潜在用户偏好的方法。它依赖于高斯过程等统计代理模型和选择下一个候选对的获取策略。由于似然函数不共轭,每一步PBO都需要大量计算,需采用多种近似推断技术。这种计算开销与人类与计算机的交互方式不兼容,限制了其在真实场景的应用。我们基于近期的摊销贝叶斯优化进展,提出完全摊销PBO,通过元学习同时训练代理模型和获取函数。方法采用新型Transformer神经过程架构,结合强化学习与定制辅助损失进行训练。在包含合成数据和真实世界数据的基准测试中,该方法比传统的高斯过程策略快数个数量级,且通常表现更优。

原文摘要 · Abstract (English)

Preferential Bayesian Optimization (PBO) is a sample-efficient method to learn latent user utilities from preferential feedback over a pair of designs. It relies on a statistical surrogate model for the latent function, usually a Gaussian process, and an acquisition strategy to select the next candidate pair to get user feedback on. Due to the non-conjugacy of the associated likelihood, every PBO step requires a significant amount of computations with various approximate inference techniques. This computational overhead is incompatible with the way humans interact with computers, hindering the use of PBO in real-world cases. Building on the recent advances of amortized BO, we propose to circumvent this issue by fully amortizing PBO, meta-learning both the surrogate and the acquisition function. Our method comprises a novel transformer neural process architecture, trained using reinforcement learning and tailored auxiliary losses. On a benchmark composed of synthetic and real-world datasets, our method is several orders of magnitude faster than the usual Gaussian process-based strategies and often outperforms them in accuracy.

贝叶斯优化偏好学习神经过程

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。