Topic Model for four-top at the LHC
Ezequiel Alvarez, Federico Lamagna, Manuel Szewc

TL;DR
This paper explores applying a Topic Model algorithm to four-top quark searches at the LHC, aiming to reduce reliance on Monte Carlo simulations despite the system's complexity and uncertainties.
Contribution
It demonstrates a novel application of Topic Models to four-top searches, including background reconstruction and Monte Carlo tuning methods.
Findings
Background can be reconstructed independently of Monte Carlo.
Using the anchor bin allows for background estimation in the signal region.
Machine Learning provides slight improvements to the Topic Model.
Abstract
We study the implementation of a Topic Model algorithm in four-top searches at the LHC as a test-probe of a not ideal system for applying this technique. We study this Topic Model behavior as its different hypotheses such as mutual reducibility and equal distribution in all samples shift from true. The four-top final state at the LHC is not only relevant because it does not fulfill these conditions, but also because it is a difficult and inefficient system to reconstruct and current Monte Carlo modeling of signal and backgrounds suffers from non-negligible uncertainties. We implement this Topic Model algorithm in the Same-Sign lepton channel where S/B is of order one and all backgrounds cannot have more than two b-jets at parton level. We define different mixtures according to the number of b-jets and we use the total number of jets to demix. Since only the background has an anchor bin,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
