In this paper, we formulate the new multi-objective coverage (MOC) problem where our goal is to identify a small set of representative samples whose predicted outcomes broadly cover the feasible multi-objective space. This problem is of great importance in many critical real-world applications, e.g., drug discovery and materials design, as this representative set can be evaluated much faster than the whole feasible set, thus significantly accelerating the scientific discovery process. Existing works cannot be directly applied as they either focus on sample space coverage or multi-objective optimization that targets the Pareto front. However, chemically diverse samples often yield identical objective profiles, and safety constraints are usually defined on the objectives. To solve this MOC problem, we propose a novel search algorithm, MOC-CAS, which employs an upper confidence bound-based acquisition function to select optimistic samples guided by Gaussian process posterior predictions. For enabling efficient optimization, we develop a smoothed relaxation of the hard feasibility test and derive an approximate optimizer. Compared to the competitive baselines, we show that our MOC-CAS empirically achieves superior performances across large-scale protein-target datasets for SARS-CoV-2 and cancer, each assessed on five objectives derived from SMILES-based features.
Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition
Department of Computer Science, Aalto University, Espoo, Finland(阿尔托大学计算机科学系,芬兰 Espoo);ELLIS Institute Finland(芬兰 ELLIS 机构);Department of Computer Science, University of Manchester, Manchester, United Kingdom(曼彻斯特大学计算机科学系,英国 Manchester)
Importance Weighted Score Matching for Diffusion Samplers with Enhanced Mode Coverage
School of Data Science, The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)数据科学学院);Shenzhen Research Institute of Big Data(深圳大数据研究院);The Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院);The School of Statistics and Data Science, LPMC & KLMDASR, Nankai University(南开大学统计与数据科学学院)
A Single Deep Preference-Conditioned Policy for Learning Pareto Coverage Sets
International Research Center for Neurointelligence, The University of Tokyo(国际神经智能研究中心,东京大学);ATR Neural Information Analysis Laboratories(ATR神经信息分析实验室);Department of Information Science, Kyoto University(京都大学信息科学系)
Learning Objective-Specific Active Learning Strategies with Attentive Neural Processes
University of Amsterdam(阿姆斯特丹大学);Canadian Institute for Advanced Research(加拿大高等研究院);European Lab for Learning and Intelligent Systems(欧洲学习与智能系统实验室);Microsoft Research(微软研究院)
Active Preference Learning over Latent Preference Archetypes for Many-Objective Bayesian Optimization
University of Manchester(曼彻斯特大学);University of Edinburgh(爱丁堡大学);Aalto University(阿尔托大学);University of Amsterdam(阿姆斯特丹大学);ELLIS Institute Finland(芬兰ELLIS研究所)
Group-invariant Coresets for Data-efficient Active Learning
Universidade Federal de Santa Catarina(圣卡塔琳娜联邦大学);Universidade Católica de Pelotas(佩洛塔斯天主教大学);Université de Lorraine, CNRS, CRAN(洛林大学,法国国家科学研究中心,自动控制与信号处理研究中心)
Barrier-enforced multi-objective optimization for direct point and sharp interval forecasting
Department of Electrical Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand(电子工程系,工程学院,朱拉隆功大学,曼谷,泰国);Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand(计算机工程系,工程学院,朱拉隆功大学,曼谷,泰国)