帕累托原理
多目标优化
偏爱
计算机科学
方案(数学)
空格(标点符号)
数学优化
工作(物理)
生物信息学
机器学习
数学
工程类
化学
机械工程
生物化学
基因
数学分析
统计
操作系统
作者
Julien Roy,Pierre‐Luc Bacon,Christopher Pal,Emmanuel Bengio
标识
DOI:10.48550/arxiv.2306.04620
摘要
In recent years, in-silico molecular design has received much attention from the machine learning community. When designing a new compound for pharmaceutical applications, there are usually multiple properties of such molecules that need to be optimised: binding energy to the target, synthesizability, toxicity, EC50, and so on. While previous approaches have employed a scalarization scheme to turn the multi-objective problem into a preference-conditioned single objective, it has been established that this kind of reduction may produce solutions that tend to slide towards the extreme points of the objective space when presented with a problem that exhibits a concave Pareto front. In this work we experiment with an alternative formulation of goal-conditioned molecular generation to obtain a more controllable conditional model that can uniformly explore solutions along the entire Pareto front.
科研通智能强力驱动
Strongly Powered by AbleSci AI