Slide 1

Slide 1 text

Search for Dark Matter Hints with Machine Learning at new CERN experiment 2018 May 16, Pint of Science Andrey Ustyuzhanin Yandex National Research University Higher School of Economics Imperial College London

Slide 2

Slide 2 text

No content

Slide 3

Slide 3 text

Structure of the Universe (simulated) https://www.youtube.com/watch?v=2qeT4DkEX-w

Slide 4

Slide 4 text

“The present situation in physics is as if we know chess, but we don’t know one or two rules.” — Richard P. Feynman Phsyics as a Game http://bit.ly/2DVIl4p “Let the Wookiee win” — Han Solo

Slide 5

Slide 5 text

Dark Matter Intro Illustrations from J. Cham; D. Whiteson. “We Have No Idea” https://en.wikipedia.org/wiki/Dark_matter

Slide 6

Slide 6 text

https://en.wikipedia.org/wiki/Dark_matter

Slide 7

Slide 7 text

Gravitational Lensing https://en.wikipedia.org/wiki/Dark_matter Sometimes displacement effect is much stronger than displacement caused by mass in the center. Hence we get a hint for a bigger object in the middle.

Slide 8

Slide 8 text

Gravitational Lensing https://en.wikipedia.org/wiki/Dark_matter Sometimes displacement effect is much stronger than displacement caused by mass in the center. Hence we get a hint for a bigger object in the middle.

Slide 9

Slide 9 text

Why bother? • What If we could find new fundamental laws of Nature? • What if Dark Matter (DM) is made of some new kind of particle that we are able to produce and study in high- energy colliders? • And what if this new discovery lets us manipulate regular matter in new ways? (e.g. new source of energy?)

Slide 10

Slide 10 text

Two big challenges 1. We do not know what we search for Unknown fundamental (microscopic) nature impacts the strength of potential signal and implies also macroscopic uncertainties; 2. There is no (totally) clean observable Direct/indirect detection targets cosmo signals, where there are many other players, “backgrounds” are typically poorly known. http://bit.ly/2IRPINV

Slide 11

Slide 11 text

Self-intro • Yandex School of Data Analysis • Course on Machine Learning (ML) methods for HEP • Summer School of ML for HEP, http://bit.ly/mlhep2018 • Head of laboratory of methods for Big Data Analysis at HSE http://cs.hse.ru/lambda • Solving natural science challenges with Machine Learning • Collaboration with CERN experiments: • LHCb , SHiP (CERN) • NEWSdm (Gran Sasso) • Cosmic Rays (CRAYFIS)

Slide 12

Slide 12 text

The Fourth Parardigm of Science • Thousands of years ago: • Science was empirical • Describing natural phenomena • Last few hundred years • Theoretical branch • Models and generalizations • Last few decades • Computational branch • Simulating complex phenomena • Today • Data exploration/ data science • Unify theory, experiment and simulation • Data captured by simulator or instrument • Processed by software • Info/knowledge/ intelligence • Analysis and visualization

Slide 13

Slide 13 text

Two strategies 1. Direct Scattering of DM particle target atomic nuclei Recoil energy measured by light, charge or phonons Experiments (a few examples): ATLAS, CMS, DAMA/LIBRA, ANAIS, KIMS, DM-Ice, PICO-LON, SABRE, Nuclear emulsion (NEWS), Anysotropic crystals (ADAMO), Liquid Ar TPC, Negative Ion Time Expansion Chamber (NITEC), Carbon nanotubes, DRIFT, MIMAC, DMTPC, NEWAGE, D3 http://bit.ly/2IRPINV

Slide 14

Slide 14 text

Two strategies 2. Indirect Annihilations (or decays) of DM particles in astrophysical objects generate fluxes of “standard” detectable particles. Non trivial to discriminate from the background. Thus we have to include accelerator searches for Dark Matter (Hidden Particles). More details on DM search at http://bit.ly/2uhwfDk

Slide 15

Slide 15 text

Accelerator Search Frontiers

Slide 16

Slide 16 text

Dark Matter Candidate Many theoretical models (in particular portal models) predict new light very Weakly Interacting Massive Particles (vWIMP) that can be mediators to DM, or even DM particles. References: • SHiP Physics Paper: Rep.Progr.Phys.79(2016) 124201 (137pp), • Dark Sector Workshop 2016: Community Report – arXiv: 1608.08632.

Slide 17

Slide 17 text

SHiP: Search for Hidden Particles Light Dark Matter (LDM) Search Experiment Data taking is expected at 2025+

Slide 18

Slide 18 text

SHiP in a Nutshell Tracker Muon detector 400 GeV proton beam 2x1020 protons in 5 years Produces variety of exotic Particles (LDM candidates) Realisationof both direct and indirect search strategy LDM particles scatter on e-

Slide 19

Slide 19 text

SHiP challenges Physics challenges: • Variety of Hidden Sector portals exploration • Tau neutrino physics • Light Dark Matter (LDM) Search Engineering challenges ML challenges: • Experiment design (shield, emulsion optimization, tracker) • Fast simulation • Speed-up data processing • Signal/background separation in emulsion

Slide 20

Slide 20 text

Light Dark Matter Signal

Slide 21

Slide 21 text

Light Dark Matter Signal

Slide 22

Slide 22 text

Light Dark Matter Signal 2, while the other 2 events were found in the scan-back procedure mentioned 133 above. To illustrate the typical pattern of νe candidates, figure 5 shows 134 the reconstructed image of a νe candidate events, with the track segments 135 observed along the showering electron track. 136 2 mm 10 mm CS ECC electron γ showers Figure 5: Display of the reconstructed emulsion tracks of one of the νe can- didate events. The reconstructed neutrino energy is 32.5 GeV. Two tracks are observed at the neutrino interaction vertex. One of the two generates an electromagnetic shower and is identified as an electron. In addition, two electromagnetic showers due to the conversion of two γ are observed (seen JHEP 1307 (2013) 004 a π0 is produced at the primary interaction vertex and a γ is detected

Slide 23

Slide 23 text

Dominant background comes from neutrino interactions: • Quasi-elastic scattering (QE) (nuclei neutron); • Elastic scattering on electrons (ES)(topologically irreducible); • Deep inelastic scattering (DIS). Background DIS QE ES

Slide 24

Slide 24 text

• Find electromagnetic shower; • Final state is different (QE produces proton, DIS produces hadron jet), so have to be able to identify protons and jets; • Use energy-angle correlation of the detected electron to discriminate vWIMP against neutrino; Emulsion has superior sensitivity to identify those processes and such technology has been developed for search for neutrino oscillation at OPERA experiment. Signal/Background separation

Slide 25

Slide 25 text

Developed for OPERA experiment (2008-2012) http://bit.ly/2Gce7wa

Slide 26

Slide 26 text

• After the passage of charged particles through the emulsion, a latent image is produced; • The emulsion chemical development makes silver grains visible with an optical microscope. Scattering and Nuclear Emulsion Compton electron

Slide 27

Slide 27 text

Sandwich-like structure: lead (massive target) + emulsion Reconstructed trajectories: Emulsion Cloud Chamber

Slide 28

Slide 28 text

Electromagnetic shower

Slide 29

Slide 29 text

Electromagnetic shower + noise

Slide 30

Slide 30 text

Electromagnetic shower + noise, realistic

Slide 31

Slide 31 text

Machine Learning Challenges for • Tracking in high density environment (both for single tracks and showers) • Vertex reconstruction • Particle identification

Slide 32

Slide 32 text

OPERA Data Example Data: • Background consists of tracks randomly scattered around brick. In real brick there are ~ 107 tracks. • Signal consists of tracks forming a cone-like shape. There are about 103 tracks per shower. • Origin (coordinates and angles of the initial particle) of each shower is known.

Slide 33

Slide 33 text

OPERA Example • Each BaseTrack(BT) is described by: -Coordinates: -Angles in the brick-frame: -Goodness of fit (MSE) of Ag crystals to the BT: • Background consists of basetracks(BT) randomly scattered around brick. In real brick there are ~ 107 tracks, label=0 • Signal consists from BTs forming a cone-like shape. There are about 103 BTs per shower. label=1 • Origin of the shower is known X, Y, Z TX, TY (X0, Y0, Z0, TX0, TY0)

Slide 34

Slide 34 text

Figure of Merit: Energy Resolution • For every shower of energy E we reconstruct number of base tracks (N) that roughly approximate it’s energy • So Erec = a N + b, (a, b) can be approximated by linear regression (left); • Energy resolution is a standard deviation of relative residuals (right). Ntracks E, MeV

Slide 35

Slide 35 text

Figure of Merit Proxy • In terms of ML, we can estimate the following simple metrics for every algorithm, giving predictions for a BT to belong to label=1 • Precision = TP / (TP + FP) • Recall = TP / (TP + FN) • If algorithm gives predictions as a float-point number [0, 1], we make plot Precision/Recalcurvel • Number of BT correspond to TP + FP, so average precision can serve as a proxy of classifier quality. Or similarly -ROC AUC can. True label = 0 True label = 1 Predicted label = 0 True negative (TN) False negative Predicted label = 1 False positive True positive

Slide 36

Slide 36 text

Baseline solution, given origin • Consider only tracks within cone volume (50 mrad) • Iterate through all BTs in the cone volume: - Compute distance from the origin: - Compute Impact Parameter (IP, see figure) - Compute (see figure) • Train classifier (e.g. Random Forest) on those features • Metrics: - ROC AUC • Baseline result: ~0.96, precision ~1.0 at 0.5 recall dX, dY, dZ, dTX, dTY

Slide 37

Slide 37 text

Tougher Challenges • No shower origin information is known apriori; • There are O(100) showers in the volume with significant overlapping probability, no shower origin is known. Methods to explore: • Clustering; • Conditional Random Field; • Message Passing Neural Networks; • Recurrent Neural Networks.

Slide 38

Slide 38 text

Possible solution for no-origin case Let’s learn how to • Find Neighbors for selected tracks • Build chains of 5-track candidates • Train classification algorithm dealing with such chains • Cluster showers using DB-SCAN algorithm

Slide 39

Slide 39 text

Find Nearest Neighbor http://bit.ly/2DW7LyO

Slide 40

Slide 40 text

Features Features: • angle between directions, • impact parameters, • mixed product of two directions and • projections of vector connecting positions of basetracks; http://bit.ly/2DW7LyO

Slide 41

Slide 41 text

Going deeper This gives Precision ~1 at recall 0.5 with no origin information. http://bit.ly/2DW7LyO

Slide 42

Slide 42 text

Going deeper This gives Precision ~1 at Recall 0.5. http://bit.ly/2DW7LyO

Slide 43

Slide 43 text

Clustering and Finding Several Showers. K-means http://bit.ly/2DW7LyO The simpliestapproach: it captures the idea that each point in cluster should be near to the center of that cluster. • Chose number of clusers(k) and iterate: • Update centroids • Update cluster members

Slide 44

Slide 44 text

K-means shortcomings http://bit.ly/2DW7LyO • Works well in case Euclidean metric, but cannot capture more complex dependencies • Initial choice of K and centroid is annoying

Slide 45

Slide 45 text

Density-Based Spatial Clustering of Applications with Noise http://bit.ly/2DVgwcz • Starts with 2 parameters: ε (minimal distance to neighbors) and minPoints (to form a cluster); • Pick a random point; • Add all points within ε distance to the current cluster recursively; • Pick a new arbitrary point and repeat the process; • If a point has fewer than minPoints neighbors (in ε-ball) – drop it; • Repeat until no points left.

Slide 46

Slide 46 text

DBSCAN for OPERA data Straighforward application doesn’t work very well, because Euclidean (default) metric is not very relevant to basetrackalignment http://bit.ly/2G9Pujv

Slide 47

Slide 47 text

Adjusting metric Improved metric: http://bit.ly/2G9Pujv

Slide 48

Slide 48 text

Result Showers are better visible, although there is room for improvement (at some plates some tracks may be missing and one have to account for direction alignment) http://bit.ly/2G9Pujv

Slide 49

Slide 49 text

Possible Improvement Ideas • Conditional Random Fields; • Message Passing Neural Networks; • Recurrent Neural Networks; • Estimate origin positions by basetrack densities.

Slide 50

Slide 50 text

Kaggle Competition to Play with • You can play with the data yourself: • https://www.kaggle.com/c/darkmatter-milestone3/ • Has been used as a playground for students of MIPT, HSE, YSDA during 2017/2018 • See link to the chat at the competition page for Q&A

Slide 51

Slide 51 text

More Challenges Ahead • Showers reconstruction: • Several showers within a volume; • O(100) showers in the volume with significant overlapping probability, no shower origin is known; • SHiP-specific background; • Particle identification; • Design optimization: • Emulsion detector design + timing; • Optimization of experiment design.

Slide 52

Slide 52 text

Closing the Research Loop Empirical observations Theory / model Computational model Data Science (e.g. optimize detector for sensitivity)

Slide 53

Slide 53 text

Status of the Searches

Slide 54

Slide 54 text

Conclusion • Dark Matter is one of the most challenging Physics topic: − many questions, many hypothesis, many approaches. • SHiP – proposed experiment at CERN with rich DM program; • Emulsion plays important role due to high sensitivity: − Electromagnetic shower reconstruction tasks. • Take part in kaggle data challenge! − More realistic ML challenges are awaiting for brave (PhD) students to be resolved. • We are hiring! )) anaderiRu@twitter, [email protected] From D.Whiteson, J Cham book “We have no idea”

Slide 55

Slide 55 text

Backup

Slide 56

Slide 56 text

Sea of Models http://bit.ly/2uq3OmT