Hierarchical clustering in particle physics through reinforcement learning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). First posted on arXiv 16 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 0; 2025: 1; 2026: 1.
6 papers.
- 2021A Living Review of Machine Learning for Particle Physicscited by 77
- 2023Branches of a Tree: Taking Derivatives of Programs with Discrete and Branching Randomness in High Energy Physicscited by 6
- 2022Automating DBSCAN via Deep Reinforcement Learningcited by 3
- 2021Exact and Approximate Hierarchical Clustering Using A*cited by 1
- 2025Adaptive and Robust DBSCAN with Multi-agent Reinforcement Learningcited by 1
- 2026Organize Primitives into Semantic Parts: Reinforcement Reasoning for 3D Segmentationcited by 0
- 2026Organize Primitives into Semantic Parts: Reinforcement Reasoning for 3D Segmentation3 Oct 2026
- 2025Adaptive and Robust DBSCAN with Multi-agent Reinforcement Learning7 May 2025
- 2023Branches of a Tree: Taking Derivatives of Programs with Discrete and Branching Randomness in High Energy Physics31 Aug 2023
- 2022Automating DBSCAN via Deep Reinforcement Learning9 Aug 2022
- 2021Exact and Approximate Hierarchical Clustering Using A*14 Apr 2021
- 2021A Living Review of Machine Learning for Particle Physics2 Feb 2021