Kumara Sastry1, D.D. Johnson2, A. L. Thompson3,

Slides:



Advertisements
Similar presentations
Computational Intelligence Winter Term 2009/10 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Advertisements

Topic Outline ? Black-Box Optimization Optimization Algorithm: only allowed to evaluate f (direct search) decision vector x objective vector f(x) objective.
Non-dominated Sorting Genetic Algorithm (NSGA-II)
MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR OBJECTIVE: Accelerate.
Elitist Non-dominated Sorting Genetic Algorithm: NSGA-II
Chemistry 6440 / 7440 Semi-Empirical Molecular Orbital Methods.
Computational Chemistry
Supported by the NSF Division of Materials Research The Materials Computation Center Duane D. Johnson and Richard M. Martin (PIs) Funded by NSF DMR
Multiobjective Optimization Chapter 7 Luke, Essentials of Metaheuristics, 2011 Byung-Hyun Ha R1.
Genetic Algorithms in Materials Processing N. Chakraborti Department of Metallurgical & Materials Engineering Indian Institute of Technology Kharagpur.
Optimal Tag SNP Selection for Haplotype Reconstruction Jin Jun and Ion Mandoiu Computer Science & Engineering Department University of Connecticut.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Design of Curves and Surfaces by Multi Objective Optimization Rony Goldenthal Michel Bercovier School of Computer Science and Engineering The Hebrew University.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR This work is supported.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Optimal Arrangement of Ceiling Cameras for Home Service Robots Using Genetic Algorithms Stefanos Nikolaidis*, ** and Tamio Arai** *R&D Division, Square.
Computational Chemistry. Overview What is Computational Chemistry? How does it work? Why is it useful? What are its limits? Types of Computational Chemistry.
An Introduction to Molecular Orbital Theory. Levels of Calculation Classical (Molecular) Mechanics quick, simple; accuracy depends on parameterization;
Genetic Algorithm.
Multiobjective Genetic Algorithms for Multiscaling Excited-State Direct Dynamics in Photochemistry Kumara Sastry 1, D.D. Johnson 2, A. L. Thompson 3, D.
Efficient Model Selection for Support Vector Machines
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
Multiobjective Genetic Algorithms for Multiscaling Excited-State Direct Dynamics in Photochemistry Kumara Sastry 1, D.D. Johnson 2, A. L. Thompson 3, D.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Omni-Optimizer A Procedure for Single and Multi-objective Optimization Prof. Kalyanmoy Deb and Santosh Tiwari.
Predictive Design Space Exploration Using Genetically Programmed Response Surfaces Henry Cook Department of Electrical Engineering and Computer Science.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
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.
Edge Assembly Crossover
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR OBJECTIVE: To accelerate.
2101INT – Principles of Intelligent Systems Lecture 11.
2/29/20121 Optimizing LCLS2 taper profile with genetic algorithms: preliminary results X. Huang, J. Wu, T. Raubenhaimer, Y. Jiao, S. Spampinati, A. Mandlekar,
Optimization Problems
Role of Theory Model and understand catalytic processes at the electronic/atomistic level. This involves proposing atomic structures, suggesting reaction.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
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.
CS-ROSETTA Yang Shen et al. Presented by Jonathan Jou.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Power Magnetic Devices: A Multi-Objective Design Approach
Chapter 14 Genetic Algorithms.
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Genetic Algorithms.
Optimization Of Robot Motion Planning Using Genetic Algorithm
An Evolutionary Approach
MIRA, SVM, k-NN Lirong Xia. MIRA, SVM, k-NN Lirong Xia.
Bulgarian Academy of Sciences
Presented by: Dr Beatriz de la Iglesia
C.-S. Shieh, EC, KUAS, Taiwan
Comparing Genetic Algorithm and Guided Local Search Methods
Multi-Objective Optimization
Chen-Yu Lee, Jia-Fong Yeh, and Tsung-Che Chiang
Searching for solutions: Genetic Algorithms
Introduction to Genetic Algorithm and Some Experience Sharing
Artificial Intelligence CIS 342
Traveling Salesman Problem by Genetic Algorithm
MIRA, SVM, k-NN Lirong Xia. MIRA, SVM, k-NN Lirong Xia.
Presentation transcript:

Multiobjective Genetic Algorithms for Multiscaling Excited-State Direct Dynamics in Photochemistry Kumara Sastry1, D.D. Johnson2, A. L. Thompson3, D. E. Goldberg1, T. J. Martinez3, J. Leiding3, J. Owens3 1Illinois Genetic Algorithms Laboratory, Industrial and Enterprise Systems Engineering 2Materials Science and Engineering 3Chemistry and Beckman Institute University of Illinois at Urbana-Champaign Supported by AFOSR F49620-03-1-0129, NSF/DMR at MCC DMR-03-76550

Multiscaling Photochemical Reaction Dynamics Multi-scale modeling is ubiquitous in science & engineering Phenomena of interest are usually multiscale Powerful modeling methodologies on single scale Multiscaling photochemical reaction dynamics Accurate but slow (hours-days) Ab Initio Quantum Chemistry methods Tune Semiempirical Potentials Fast (secs-mins). Accuracy depends on semiempirical potentials Semiempirical Methods Use multiobjective genetic algorithm for tuning semiempirical potentials for multiscaling reaction dynamics

Outline Introduction: Background and Purpose Method for multiscaling reaction dynamics Limitations of existing methods Problem formulation Overview of NSGA-II Results and Discussion Summary and Conclusions

Photochemical Reaction Vision Excited state Ground state Photosynthesis Pollution Solar energy

Accurate Simulation of Reaction Dynamics Isn’t Easy Ab initio quantum chemistry methods: Ab initio multiple spawning methods [Ben-Nun & Martinez, 2002] Solve nuclear and electronic Schrödinger’s equations. Accurate, but prohibitively expensive (hours-days) Semiempirical methods: Solve Schrodinger’s equations with expensive parts replaced with parameters. Fast (secs-mins), accuracy depends on semiempirical potentials Tuning semiempirical potentials is non-trivial Energy & shape of energy landscape matter Two objectives at the bare minimum Minimizing errors in energy and energy gradient

Why Does This Matter? Multiscaling speeds all modeling of physical problems: Solids, fluids, thermodynamics, kinetics, etc., Example: GP used for multi-timescaling Cu-Co alloy kinetics [Sastry, et al (2006), Physical Review B] Here we use MOGA to enable fast and accurate modeling Retain ab initio accuracy, but exponentially faster Enabling technology: Science and Synthesis Fast, accurate models permit larger quantity of scientific studies Fast, accurate models permit synthesis via repeated analysis This study potentially enables: Biophysical basis of vision Biophysical basis of photosynthesis Protein folding and drug design Rapid design of functional materials (zeolites, LCDs, etc.,)

Methodology: Limited Ab Initio and Expermiental Results to Tune Semiempirical Parameters Perform ab initio computations for a few configurations Both excited- and ground-state configurations Augmented with experimental measurements Standard parameter sets don’t yield accurate potential energy surfaces (PESs) Example: AM1, PM3, MNDO, CNDO, INDO, etc. Accurately describe ground-state properties Yields wrong description of excited-state dynamics Parameter sets need to be reoptimized Maintain accurate description of ground-state properties Yield globally accurate PES and hence physical dynamics

Current Reparameterization Methods Fall Short Staged single objective optimization First minimize error in energies Subsequently minimize weighted error in energy and gradient Reparameterization involves multiple objectives Don’t know the weights of different objectives Reparameterization is highly multimodal Local search gets stuck in low-quality optima Current methods still fall short Often doesn’t yield globally accurate PES Yield uninterpretable semiempirical potentials Semiempirical potentials are not transferable Use parameters optimized for simple molecules in complex environments without complete reoptimization.

Fitness: Errors in Energy and Energy Gradient Choose a few ground- and excited-state configurations Fitness #1: Error in energy and geometry For each configuration, compute energy and geometry Via ab initio and semiempirical methods Fitness #2: Error in energy gradient For each configuration compute energy gradient

Chromosome: Real-Valued Encoding of Semiempirical Parameters Consists of 11 semiempirical parameters for carbon Most important parameters affecting excited-state PES Semiempirical parameters for hydrogen is not reoptimized Set to their PM3 values Core-core repulsion parameters are not optimized Real-valued encoding of chromosomes Variable ranges: 20-50% around PM3 values Retain reasonable representation of ground state PES

Multiobjective GA: NSGAII with Binary Tournament, SBX, and Polynomial Mutation Non-dominated sorting GA-II (NSGA-II) [Deb et al, 2000] Binary tournament selection (s = 2) [Goldberg, Deb, & Korb, 1989] Simulated binary crossover (SBX) (ƞc=5, pc = 0.9) [Deb & Agarwal, 1995; Deb & Kumar, 1995] Polynomial Mutation (ƞm=10, pm = 0.1) [Deb et al, 2000] Results reported are best over 5, 10, and 30 NSGA-II runs

Overview of NSGA-II Initialize Population Evaluate fitness of individuals Selection: “Survival of the non-dominated” Non-dominated sorting Individual comparison Recombination: Combine traits of parents Mutation: Random walk around an individual Evaluate offspring solutions Replacement: Best among parents and offspring

Non-dominated Sorting Procedure Indentify the best non-dominated set A set of solutions that are not dominated by any individual in the population Discard them from the population temporarily Identify the next best non-dominated set Continue till all solutions are classified F1: Rank = 1 F1: Rank = 1 F2: Rank = 2

Crowding In NSGA-II for Niche Preservation Crowding (niche-preservation) in objective space Each solution is assigned a crowding distance Crowding distance = front density in the neighborhood Distance of each solution from its nearest neighbors Solution B is more crowded than A

Elitist Replacement in NSGA-II Combine parent and offspring population Select better ranking individuals and use crowding distance to break the tie Non-dominated sorting F1 Population in next generation Parent population F2 F3 Offspring population Crowding distance sorting

Test Molecules: Ethylene and Benzene Tune semiempirical potentials for ethylene and benzene Fundamental building blocks of organic molecules Play important role in photochemistry of aromatic systems Extensively studied both theoretically and experimentally Simple and thus amenable to rapid analysis Verification using ab initio results Exhaustive dynamics simulations Transferability to more complex molecules Expect less complex results thus easy interpretability Complex enough and thus can test for validity of semiempirical methods on untested, yet critical configurations

Population Size of 800 Yields Good Solutions 5 independent runs with n = 2000 for 200 generations Best non-dominated set assumed to be true Pareto front Mahfoud’s population-sizing model suggests n = 750 Maintain at least one copy of each optimum with 98% probability Empirical results agree with the model prediction 10 independent runs with n = 50, 100, 200, 400, and 800 Fixed total number of evaluations at 80,000 With n = 800, NSGA-II finds almost all Pareto-optimal solutions Suggests operators are appropriate for the search problem

Population Size of 800 Yields Good Solutions

Run Duration of 100 Generations Is Appropriate 10 independent runs with n = 800 Rapid improvement up to gen. 25 Gradual improvement up to gen. 100

Ethylene: GA Finds Physical and Accurate PES 226% lower error in energy 32.5% lower error in energy gradient All solutions below 1.2eV error in energy yield globally accurate PES Significant reduction in errors Globally accurate potential energy surfaces Resulting in physical reaction dynamics Evidence of transferability: “Holy Grail” in molecular dynamics

GA Optimized Semiempirical Potentials are Physical Dynamics agree with ab initio results Energetics on untested, yet critical configurations cis-trans isomerization in ethylene AM1, PM3, and other parameter sets yield wrong energetics GA yields results consistent with ab initio results Planar Twisted Pyramidalized 0.88 eV 2.8 eV AM1/PM3: Incorrect GA/AIMS: Correct

GA Optimized Semiempirical Potentials are Physical Energy difference between planar and twisted geometery should be greater than zero (ideally ~2.8 eV) Energy difference between pyramidalized and twisted geometry should be greater than zero (ideally ~0.88 eV)

Benzene: GA Finds Physical and Accurate PES 46% lower error in energy 86.5% lower error in energy gradient All solutions below 8eV error in energy yield globally accurate PES Significant reduction in errors Globally accurate potential energy surfaces Resulting in physical reaction dynamics Evidence of transferability: “Holy Grail” in molecular dynamics

Summary of Key Results Yields multiple parameter sets that are up to 226% lower energy error and 87% lower gradient error Enables 102-105 increase in simulation time even for simple molecules 10-103 times faster than the current methodology for tuning semiempirical potentials Observed transferability is a very important to chemists Enables accurate simulations without complete reoptimization "Holy Grail" for two decades in chemistry & materials science. Pareto analysis using rBOA and symbolic regression via GP Interpretable semiempirical potentials New insight into multiplicity of models and why they exist.

Conclusions Broadly applicable in chemistry and materials science Analogous applicability when multiscaling phenomena is involved: Solids, fluids, thermodynamics, kinetics, etc. Facilitates fast and accurate materials modeling Alloys: Kinetics simulations with ab initio accuracy. 104-107 times faster than current methods. Chemistry: Reaction-dynamics simulations with ab initio accuracy.102-105 times faster than current methods. Lead potentially to new drugs, new materials, fundamental understanding of complex chemical phenomena Science: Biophysical basis of vision, and photosynthesis Synthesis: Pharmaceuticals, functional materials