GARCON Genetic Algorithm for Rectangular Cuts OptimizatioN

Similar documents
VISPA: Visual Physics Analysis Environment

b-jet identification at High Level Trigger in CMS

Spark and HPC for High Energy Physics Data Analyses

LCG MCDB Knowledge Base of Monte Carlo Simulated Events

MIP Reconstruction Techniques and Minimum Spanning Tree Clustering

Study of the Higgs boson coupling to the top quark and of the b jet identification with the ATLAS experiment at the Large Hadron Collider.

Evolutionary Computation. Chao Lan

Neural Network Weight Selection Using Genetic Algorithms

Recasting LHC analyses with MADANALYSIS 5

PoS(ACAT08)101. An Overview of the b-tagging Algorithms in the CMS Offline Software. Christophe Saout

Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization

Evolutionary Computation Part 2

PoS(EPS-HEP2017)523. The CMS trigger in Run 2. Mia Tosi CERN

An SQL-based approach to physics analysis

GENETIC ALGORITHM with Hands-On exercise

Genetic Algorithms Variations and Implementation Issues

ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS

Muon Reconstruction and Identification in CMS

Escaping Local Optima: Genetic Algorithm

arxiv:hep-ph/ v1 11 Mar 2002

GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM

Topological Machining Fixture Layout Synthesis Using Genetic Algorithms

Alignment of the CMS Silicon Tracker

Genetic Algorithms. PHY 604: Computational Methods in Physics and Astrophysics II

Batch Services at CERN: Status and Future Evolution

H γγ. Sean Simon UC San Diego (on behalf of the H γγ WG) Photon Workshop July 23 rd 2008

Performance of Tracking, b-tagging and Jet/MET reconstruction at the CMS High Level Trigger

Mutations for Permutations

Evolutionary Algorithms. CS Evolutionary Algorithms 1

A New Segment Building Algorithm for the Cathode Strip Chambers in the CMS Experiment

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

PoS(High-pT physics09)036

From raw data to new fundamental particles: The data management lifecycle at the Large Hadron Collider

Machine Learning for (fast) simulation

The full detector simulation for the ATLAS experiment: status and outlook

Genetic Algorithms. Kang Zheng Karl Schober

ATLAS, CMS and LHCb Trigger systems for flavour physics

Design of the new ATLAS Inner Tracker (ITk) for the High Luminosity LHC

Physics CMS Muon High Level Trigger: Level 3 reconstruction algorithm development and optimization

March 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms

1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra

FOREST PLANNING USING PSO WITH A PRIORITY REPRESENTATION

The Compact Muon Solenoid Experiment. Conference Report. Mailing address: CMS CERN, CH-1211 GENEVA 23, Switzerland

Deep Learning Photon Identification in a SuperGranular Calorimeter

Optimization of Association Rule Mining through Genetic Algorithm

ATLAS ITk Layout Design and Optimisation

Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms

Application of Neural Networks to b-quark jet detection in Z b b

Generators at the LHC

Robustness Studies of the CMS Tracker for the LHC Upgrade Phase I

DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES

Path Planning Optimization Using Genetic Algorithm A Literature Review

NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION

Introduction to Genetic Algorithms

Tracking and flavour tagging selection in the ATLAS High Level Trigger

A Method Based Genetic Algorithm for Pipe Routing Design

MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS

Probability Control Functions Settings in Continual Evolution Algorithm

The k-means Algorithm and Genetic Algorithm

Xianyou Wang,Guoming Chen, Zheng Wang, Xianwei Meng, Jan Wang. Institute of High Energy Physics, CAS, Beijing

JHPCSN: Volume 4, Number 1, 2012, pp. 1-7

Genetic improvement of software: a case study

A Modified Genetic Algorithm for Process Scheduling in Distributed System

Local Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )

Local Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )

PoS(ACAT08)100. FROG: The Fast & Realistic OPENGL Event Displayer

A More Stable Approach To LISP Tree GP

Role of Genetic Algorithm in Routing for Large Network

FAMOS: A Dynamically Configurable System for Fast Simulation and Reconstruction for CMS

A genetic algorithms approach to optimization parameter space of Geant-V prototype

CMS Alignement and Calibration workflows: lesson learned and future plans

The Compact Muon Solenoid Experiment. Conference Report. Mailing address: CMS CERN, CH-1211 GENEVA 23, Switzerland

International Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)

Genetic programming. Lecture Genetic Programming. LISP as a GP language. LISP structure. S-expressions

Kyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming

IMPROVING A GREEDY DNA MOTIF SEARCH USING A MULTIPLE GENOMIC SELF-ADAPTATING GENETIC ALGORITHM

Automatic Generation of Test Case based on GATS Algorithm *

Precision Timing in High Pile-Up and Time-Based Vertex Reconstruction

CHAPTER 4 GENETIC ALGORITHM

Collider analysis recasting with Rivet & Contur. Andy Buckley, University of Glasgow Jon Butterworth, University College London MC4BSM, 20 April 2018

Improving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms.

Comparative Analysis of Genetic Algorithm Implementations

Software and computing evolution: the HL-LHC challenge. Simone Campana, CERN

Identification of the correct hard-scatter vertex at the Large Hadron Collider

First LHCb measurement with data from the LHC Run 2

Heuristic Optimisation

Alignment of the CMS silicon tracker using Millepede II

How to discover the Higgs Boson in an Oracle database. Maaike Limper

Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design

Dijet A LL Dijet cross section 2006 Dijet A LL Preparation for Tai Sakuma MIT

Lecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman

Evolving Efficient Security Systems Under Budget Constraints Using Genetic Algorithms

A new inclusive secondary vertex algorithm for b-jet tagging in ATLAS

Monte Carlo programs

Review: Final Exam CPSC Artificial Intelligence Michael M. Richter

Metaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini

Striped Data Server for Scalable Parallel Data Analysis

Challenges and Evolution of the LHC Production Grid. April 13, 2011 Ian Fisk

Outline. CS 6776 Evolutionary Computation. Numerical Optimization. Fitness Function. ,x 2. ) = x 2 1. , x , 5.0 x 1.

Introduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell

Transcription:

GARCON Genetic Algorithm for Rectangular Cuts OptimizatioN Salavat Abdullin FNAL Alexey Drozdetskiy 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 1

How to optimize cuts 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 2

GARCON Introduction program description and user s manual available in hep-ph/0605143 web-page: http://drozdets.home.cern.ch/drozdets/home/genetic/ A few recent examples of usage High Energy Physics analyses of Compact Muon Solenoid (CMS) collaboration (published in CMS Physics TDR v.2 (J. Phys. G: Nucl. Part. Phys. 34 (2007) 995-1579) and Public CMS Notes) HZZ4μ Standard Model Higgs boson search (CMS Note 2006/122) SUSY discovery potential (e.g. CMS Note 2006/134) Single-top events selection (CMS Note 2006/084) In short: Genetic algorithm (GA) is a set of algorithms inspired by concepts of natural selection with evolving individuals, which allowed to be created randomly, to mutate, inherit their qualities, etc. useful in extremum finding tasks with a large number of discrete solutions Typically High Energy Physics (HEP) analysis has quite a few selection criteria (cuts) to optimize for example a significance of an excess of the signal over background events. In such cases simple scan over multi-dimensional cuts space (especially when done on top of a scan over theoretical predictions parameters space like for SUSY e.g.) leads to CPU time demand varying from days to many years... 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 3

fast and efficient GARCON features automatically performs an optimization and results stability verification effectively trying ~10 50 cut set parameters/values permutations for millions of input events in hours time optimization output is transparent efficient cut variables optimal cut values more features many significance function available to user (S signal, B - background) starting from S1 = S / B, including e.g. Scl = 2( S + B)ln(1 + S / B) 2S and with possibility of a user defined optimization function user defined optimization precision additional user defined requirements minimum number of signal/background events to survive after final cuts variables/processes to be used for a particular optimization run number of optimizations inside one run to ensure that optimization converges/finds not just a local maximum(s), but a global one as well (in case of a complicated phase space) automatic verification of results stability 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 4

GARCON - genetic algorithm Definitions/algorithm individual a set of qualities to be optimized min/max cut values on kinematical variables in HEP analysis environment a set of requirement on evolutionary process quality function (significance) which shows how good cuts (individuals) are in separating signal from background community a number of individuals involved in evolution breeding of new individuals (combining best qualities, cuts, for new individuals from two parent ones) breeding with possible mutation (one of the algorithms that allows new individuals to try new parts of phase space, thus not restricting community evolution inside one local maximum of quality function) death of individuals (the better quality of an individual the longer it lives, produces new individuals, thus improving community as a whole) cataclysmic update starting community from scratch (another possibility for GA to look outside of a particular local maximum of quality function) the very best individual after a number of years of evolution is an output of GARCON optimized cut values for HEP analysis 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 5

Toy analysis msugra (constrained MSSM Supersymmetry model) generator level analysis one particular point in msugra parameter space chosen as a signal details in the hep-ph/0605143 characteristic qualities of SUSY events, following from a consideration of signal Feynman diagrams are: large MET (mainly due to massive stable invisible SUSY particles, LSP) and large jet ETs (due to heavy SUSY particles cascade decays) considered backgrounds QCD, W/Z+jets, double weak-boson production, tt statistics divided into two parts one for cuts optimization, another to verify stability of results optimization: 10 cut parameters (20 values) used for optimization 2.5% precision for each variable (40 possible values for each variable) ~0.5*10 6 events used in optimization with goal to separate signal events from background ones with best possible significance 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 6

Performance after ~50 years (~3.5 hours) close to the best result is already achieved thus effectively tried 40 20 permutations of possible cut values (20 variables to optimize, 40 possible values for each) on 0.5 millions of events 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 7

Optimized cut values example an example of a cut value chosen independently by eye and optimized by GARCON (for missing transverse energy variable) really discriminating variable an example of a cut value chosen independently by eye and optimized by GARCON (transverse energy of the leading jet) not really discriminating variable (compare distribution before and after other cuts) GARCON (optimized) before cuts after cuts by eye (not optimized) 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 8

Optimized vs. constant cuts An example of results with GARCON and classical approach in full simulation analysis done by two different universities Standard Model Higgs boson search in HZZ4μ channel CMS H4µ 2006 Gain in significance in probabilistic terms, e.g. m H =130 (at the edge of 5σ discovery for 30fb -1 integrated luminosity): significance: 5.1 vs. 6 σ 55% vs. 80% chances to observe greater than 5σ excess CMS Physics TDR, v2 (J. Phys. G: Nucl. Part. Phys. 34 (2007) 995-1579) 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 9

Stability of results An example of results with GARCON and classical approach in full simulation analysis done by two different universities Standard Model Higgs boson search in HZZ4μ channel stable results even with small statistics available for the analysis CMS Public Note 2006/122 Good example of complicated analysis, where not only many variables and values for cuts analyzed, but also many points for possible signal studied. 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 10

Summary We presented GARCON program, illustrated its functionality with a simple HEP analysis example much more complicated examples described for example in CMS Physics Technical Design Report, v2, 2006 CMS Public Notes The program automatically performs rectangular cuts optimization and verification for stability in a multidimensional phase space All-in-all it is simple yet powerful ready-to-use publicly available tool with flexible and transparent optimization and verification parameters setup 22-27 April '07 ACAT07, April '07. Alexey Drozdetskiy, University of Florida 11