Combinatorial Library Design Using a Multiobjective Genetic Algorithm

Slides:



Advertisements
Similar presentations
GA Approaches to Multi-Objective Optimization
Advertisements

Topic Outline ? Black-Box Optimization Optimization Algorithm: only allowed to evaluate f (direct search) decision vector x objective vector f(x) objective.
Mathematical Analysis of Robustness Sensitivity analysis allows the linking of robustness to network structure. However, it yields only local properties.
A Multiobjective Approach to Combinatorial Library Design Val Gillet University of Sheffield, UK.
Multi-objective optimization multi-criteria decision-making.
Generating Diverse Opponents with Multi-Objective Evolution Generating Diverse Opponents with Multi-Objective Evolution Alexandros Agapitos, Julian Togelius,
Spring, 2013C.-S. Shieh, EC, KUAS, Taiwan1 Heuristic Optimization Methods Pareto Multiobjective Optimization Patrick N. Ngatchou, Anahita Zarei, Warren.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #35 4/26/02 Multi-Objective Optimization.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Genetic Algorithms in Materials Processing N. Chakraborti Department of Metallurgical & Materials Engineering Indian Institute of Technology Kharagpur.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #36 4/29/02 Multi-Objective Optimization.
Design of Curves and Surfaces by Multi Objective Optimization Rony Goldenthal Michel Bercovier School of Computer Science and Engineering The Hebrew University.
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Classical Exploration Methods for Design Space Exploration (multi-criteria.
Applying Multi-Criteria Optimisation to Develop Cognitive Models Peter Lane University of Hertfordshire Fernand Gobet Brunel University.
A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Optimal Arrangement of Ceiling Cameras for Home Service Robots Using Genetic Algorithms Stefanos Nikolaidis*, ** and Tamio Arai** *R&D Division, Square.
Evolutionary Multi-objective Optimization – A Big Picture Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical.
Evolving Multi-modal Behavior in NPCs Jacob Schrum – Risto Miikkulainen –
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
ALGEBRAIC AND COMBINATORIAL APPROACHES IN SYSTEMS BIOLOGY, MAY 24, 2015 COMBINATORIAL OPTIMIZATION METHODS FOR AGENT-BASED MODELING Matthew Oremland Mathematical.
Robin McDougall Scott Nokleby Mechatronic and Robotic Systems Laboratory 1.
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
Niching Genetic Algorithms Motivation The Idea Ecological Meaning Niching Techniques.
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
DIVERSITY PRESERVING EVOLUTIONARY MULTI-OBJECTIVE SEARCH Brian Piper1, Hana Chmielewski2, Ranji Ranjithan1,2 1Operations Research 2Civil Engineering.
Evolutionary Design (2) Boris Burdiliak. Topics Representation Representation Multiple objectives Multiple objectives.
Chapter 3 Response Charts.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
Design of a Compound Screening Collection Gavin Harper Cheminformatics, Stevenage.
Multiobjective Optimization for Locating Multiple Optimal Solutions of Nonlinear Equation Systems and Multimodal Optimization Problems Yong Wang School.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Multiobjective Optimization  Particularities of multiobjective optimization  Multiobjective.
Evolutionary multi-objective algorithm design issues Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
Asteroseismology of Sun-like Stars
Fitness Guided Fault Localization with Coevolutionary Automated Software Correction Case Study ISC Graduate Student: Josh Wilkerson, Computer Science ISC.
Multimodal Problems and Spatial Distribution A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 9.
Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho.
Pareto-Optimality of Cognitively Preferred Polygonal Hulls for Dot Patterns Antony Galton University of Exeter UK.
CEng 713, Evolutionary Computation, Lecture Notes parallel Evolutionary Computation.
Paper Review for ENGG6140 Memetic Algorithms
Lipinski’s rule of five
21st Mediterranean Conference on Control and Automation
Particle Swarm Optimization (2)
Innovization: A Multi-Objective Optimization and Data Analysis Procedure for Unveiling Innovative Design Principles Kalyanmoy Deb and Aravind Srinivasan.
School of Computer Science & Engineering
Presented by: Dr Beatriz de la Iglesia
C.-S. Shieh, EC, KUAS, Taiwan
Artificial Intelligence (CS 370D)
Speciation/Niching The original SGA (Simple GA) is designed to rapidly search the landscape (exploration) and zoom in (exploitation) on a single solution.
Neural Networks A neural network is a network of simulated neurons that can be used to recognize instances of patterns. NNs learn by searching through.
Advanced Artificial Intelligence Evolutionary Search Algorithm
Design Space Exploration
7th Grade Cells Natural Selection
Virtual Screening.
Multiple Regression Analysis: Further Issues
Heuristic Optimization Methods Pareto Multiobjective Optimization
Multi-Objective Optimization
Innovization: A Multi-Objective Optimization and Data Analysis Procedure for Unveiling Innovative Design Principles Kalyanmoy Deb and Aravind Srinivasan.
Linear Model Selection and regularization
Chen-Yu Lee, Jia-Fong Yeh, and Tsung-Che Chiang
○ Hisashi Shimosaka (Doshisha University)
Methods and Materials (cont.)
Machine Learning: UNIT-4 CHAPTER-2
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm BISCuit EDA Seminar
Lecture 4. Niching and Speciation (1)
Modeling and Analysis Tutorial
Multiobjective Optimization
Presentation transcript:

Combinatorial Library Design Using a Multiobjective Genetic Algorithm Valerie J. Gillet, Wael Khatib, Peter Willett, Peter J. Fleming, and Darren V. S. Green. J. Chem. Inf. Comput. Sci. 2002, 42, 375-385 Krebs Institute for Biomolecular Research and Department of Information Studies, University of Sheffield, Western Bank, Sheffield S10 2TN, United Kingdom, Department of Automatic Control and Systems Engineering, University of Sheffield, Western Bank, Sheffield S10 2TN, United Kingdom, and GlaxoSmithKline, Gunnels Wood Road, Stevenage, SG1 2NY, United Kingdom Presented by Greg Goldgof

Problem: How to Optimize Library Design? Solution: A Multiobjective Genetic Algorithm Based that determines Pareto Frontiers

Traditionally… Library design algorithms focused on diversity. Failed to deliver sufficiently improved hit rates. Generated chemicals that make undesirable lead compounds.

Single-Objective SELECT

SELECT Extended for Multiple Objectives

Limitations of MO Search The definition of the fitness function can be difficult especially with noncommensurable objectives; for example, in library design it is not obvious how diversity should be combined with cost. The setting of the weights is nonintuitive; for example, in the SELECT program several trial-and-error experiments may be required to choose appropriate weights.22 The fitness function determines the regions of the search space that are explored, and combining objectives via weights can result in some regions being obscured. The progress of the search or optimization process is not easy to follow since there are many objectives to monitor simultaneously. (The objectives may be coupled, thus implying conflict and competition, which can make it more difficult for the optimization process to achieve reasonable or acceptable results.

Limitations of MO Search cont. A single solution is found which is typically one among a family of solutions that are all equivalent in terms of the overall fitness, although they may have different values of the individual objectives. For example, consider a two-objective problem where the fitness function is defined as: f(n) ) w1x + w2y where x and y are hypothetical objectives and w1 and w2 are both set to unity. The solution x ) 0.4, y ) 0.5 has the same fitness (0.9) as the potential solution x ) 0.5, y ) 0.4, and thus both solutions can be considered as equivalent; typically, however, only one of them will be found.

Pareto Frontier and Dominated versus Nondominated

MoSELECT Evolutionary algorithms, however, operate with a population of individuals and are thus well suited to search for multiple solutions in parallel; hence they can be readily adapted to deal with multiobjective search and optimization.

Charting the results of MoSELECT with two parameters

SELECT Verses MoSELECT

Convergence Criteria “The second convergence criterion that was investigated involves calculating the percentage of nondominated solutions in the Pareto set as the search progresses… …This method, however, did not prove to be effective since there was no clear trend to indicate what a valid threshold should be.”

Niche Induction Genetic Drift or Speciation If the (absolute) difference in the objectives of the next solution and the objectives of any solution that already forms the center of a niche is within a given threshold, for all objectives, the fitness (or dominance) of the current solution is penalized; otherwise it forms the center of a new niche. The threshold is also known as the niche radius.

Increasing the Number of Objectives Diversity Cost Molecular weight (MW) Occurrence of rotatable bonds (RB) Occurrence of hydrogen bond donors (HBD) Occurrence of hydrogen bond acceptors (HBA) etc.

No Niching

With Niching

Future Work Future work will investigate the possibility of interacting with the search process so that the relationships between objectives are explored during the search. This will allow the user to observe which objectives are relatively hard to improve, which are more easily optimized, and which objectives are in competition. The search process itself could then be altered to take account of these characteristics.

Discussion Questions MoSELECT allows the user to determine the importance of each parameter. Is this reasonable? How does the “Future Work” present solutions to this problem? Does it solve it? Why is there no formal analysis of runtime?