Hierarchical clustering in particle physics through reinforcement learning

11/16/2020
by   Johann Brehmer, et al.
0

Particle physics experiments often require the reconstruction of decay patterns through a hierarchical clustering of the observed final-state particles. We show that this task can be phrased as a Markov Decision Process and adapt reinforcement learning algorithms to solve it. In particular, we show that Monte-Carlo Tree Search guided by a neural policy can construct high-quality hierarchical clusterings and outperform established greedy and beam search baselines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2018

Hierarchical clustering with deep Q-learning

The reconstruction and analyzation of high energy particle physics data ...
research
08/31/2022

Learning Tree Structures from Leaves For Particle Decay Reconstruction

In this work, we present a neural approach to reconstructing rooted tree...
research
03/10/2016

Hierarchical Linearly-Solvable Markov Decision Problems

We present a hierarchical reinforcement learning framework that formulat...
research
05/27/2020

ProTuner: Tuning Programs with Monte Carlo Tree Search

We explore applying the Monte Carlo Tree Search (MCTS) algorithm in a no...
research
04/14/2021

Exact and Approximate Hierarchical Clustering Using A*

Hierarchical clustering is a critical task in numerous domains. Many app...
research
09/09/2018

Nonparametric semisupervised classification for signal detection in high energy physics

Model-independent searches in particle physics aim at completing our kno...

Please sign up or login with your details

Forgot password? Click here to reset