Bayesian optimization with known experimental and design constraints for chemistry applications
نویسندگان
چکیده
Optimization strategies driven by machine learning, such as Bayesian optimization, are being explored across experimental sciences an efficient alternative to traditional design of experiment. When combined with automated laboratory hardware and high-performance computing, these enable next-generation platforms for autonomous experimentation. However, the practical application approaches is hampered a lack flexible software algorithms tailored unique requirements chemical research. One aspect pervasive presence constraints in conditions when optimizing processes or protocols, space that accessible designing functional molecules materials. Although many known priori, they can be interdependent, non-linear, result non-compact optimization domains. In this work, we extend our experiment planning Phoenics Gryffin handle arbitrary via intuitive interface. We benchmark extended on continuous discrete test functions diverse set constraints, demonstrating their flexibility robustness. addition, illustrate utility two simulated research scenarios: synthesis o-xylenyl Buckminsterfullerene adducts under constrained flow conditions, redox active batteries synthetic accessibility constraints. The tools developed constitute simple, yet versatile strategy model-based contributing its applicability core component scientific discovery.
منابع مشابه
Bayesian Optimization with Inequality Constraints
Bayesian optimization is a powerful framework for minimizing expensive objective functions while using very few function evaluations. It has been successfully applied to a variety of problems, including hyperparameter tuning and experimental design. However, this framework has not been extended to the inequality-constrained optimization setting, particularly the setting in which evaluating feas...
متن کاملBayesian Optimization with Unknown Constraints
Recent work on Bayesian optimization has shown its effectiveness in global optimization of difficult black-box objective functions. Many real-world optimization problems of interest also have constraints which are unknown a priori. In this paper, we study Bayesian optimization for constrained problems in the general case that noise may be present in the constraint functions, and the objective a...
متن کاملBayesian optimization with shape constraints
In typical applications of Bayesian optimization, minimal assumptions are made about the objective function being optimized. This is true even when researchers have prior information about the shape of the function with respect to one or more argument. We make the case that shape constraints are often appropriate in at least two important application areas of Bayesian optimization: (1) hyperpar...
متن کاملDesign and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملBayesian Optimization with Resource Constraints and Production
In this paper, we aim to take a step toward a tighter integration of automated planning and Bayesian Optimization (BO). BO is an approach for optimizing costlyto-evaluate functions by selecting a limited number of experiments that each evaluate the function at a specified input. Typical BO formulations assume that experiments are selected one at a time, or in fixed batches, and that experiments...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digital discovery
سال: 2022
ISSN: ['2635-098X']
DOI: https://doi.org/10.1039/d2dd00028h