arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.04040cs.LGstat.ML

基于GFlowNets的样本高效多目标分子优化

Sample-efficient Multi-objective Molecular Optimization with GFlowNets

Zhejiang University(浙江大学)

Yiheng Zhu, Jialu Wu, Chaowen Hu, Jiahuan Yan, Chang-Yu Hsieh, Tingjun Hou, Jian Wu

AI总结:

本文提出基于超网络GFlowNets的多目标贝叶斯优化算法HN-GFN,通过偏好条件化超网络和事后经验离线策略,从近似Pareto前沿采样多样化候选分子,在候选质量和样本效率上优于现有方法。

摘要:

许多关键科学问题涉及设计具有期望性质的新型分子,这可以被形式化为离散化学空间上的黑箱优化问题。在实践中,多个相互冲突的目标和昂贵的评估(例如湿实验室实验)使得候选分子的多样性至关重要。计算方法已取得初步成功,但在同时考虑目标空间和搜索空间中的多样性方面仍存在困难。为了填补这一空白,我们提出了一种多目标贝叶斯优化(MOBO)算法,利用基于超网络的GFlowNets(HN-GFN)作为采集函数优化器,目的是从近似Pareto前沿中采样一批多样化的候选分子图。通过使用单个偏好条件化的超网络,HN-GFN学习探索目标之间的各种权衡。我们进一步提出了一种类似事后经验的离线策略,在不同偏好之间共享高性能分子,以加速HN-GFN的学习。我们通过实验证明HN-GFN具有足够的泛化能力来处理不同偏好。此外,在各种真实世界MOBO设置中的实验表明,我们的框架在候选质量和样本效率方面主要优于现有方法。代码可在https://github.com/violet-sto/HN-GFN获取。

英文摘要:

Many crucial scientific problems involve designing novel molecules with desired properties, which can be formulated as a black-box optimization problem over the discrete chemical space. In practice, multiple conflicting objectives and costly evaluations (e.g., wet-lab experiments) make the diversity of candidates paramount. Computational methods have achieved initial success but still struggle with considering diversity in both objective and search space. To fill this gap, we propose a multi-objective Bayesian optimization (MOBO) algorithm leveraging the hypernetwork-based GFlowNets (HN-GFN) as an acquisition function optimizer, with the purpose of sampling a diverse batch of candidate molecular graphs from an approximate Pareto front. Using a single preference-conditioned hypernetwork, HN-GFN learns to explore various trade-offs between objectives. We further propose a hindsight-like off-policy strategy to share high-performing molecules among different preferences in order to speed up learning for HN-GFN. We empirically illustrate that HN-GFN has adequate capacity to generalize over preferences. Moreover, experiments in various real-world MOBO settings demonstrate that our framework predominantly outperforms existing methods in terms of candidate quality and sample efficiency. The code is available at https://github.com/violet-sto/HN-GFN.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑