SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2011.08191 · NeurIPS · 2020

Hierarchical clustering in particle physics through reinforcement learning

Kyle Cranmer, Johann Brehmer, Sebastian Macaluso, Pappadopulo Duccio, Bloomberg

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

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.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2011.08191")
get_code_for_paper("2011.08191")
have("2011.08191")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2011.08191.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2011.08191.svg)](https://syntology.ai/paper/2011.08191)

Connect an agent — have() is free.