Papers › Hierarchical clustering in particle physics through reinforcement learning

Hierarchical clustering in particle physics through reinforcement learning

16 Nov 2020arXiv:2011.08191archive 2025-07-28

Johann Brehmer, Sebastian Macaluso, Duccio Pappadopulo, Kyle Cranmer

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.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

johannbrehmer/ginkgo-rl officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

ClusteringReinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Monte-Carlo Tree Search

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections