Abstract

In the extensive search for new physics, the precise measurement of the Higgs boson continues to play an important role. To this end, machine learning techniques have been recently applied to processes like the Higgs production via vector-boson fusion. In this paper, we propose to use algorithms for learning to rank, i.e., to rank events into a sorting order, first signal, then background, instead of algorithms for the classification into two classes, for this task. The fact that training is then performed on pairwise comparisons of signal and background events can effectively increase the amount of training data due to the quadratic number of possible combinations. This makes it robust to unbalanced data set scenarios and can improve the overall performance compared to pointwise models like the state-of-the-art boosted decision tree approach. In this work we compare our pairwise neural network algorithm, which is a combination of a convolutional neural network and the DirectRanker, with convolutional neural networks, multilayer perceptrons or boosted decision trees, which are commonly used algorithms in multiple Higgs production channels. Furthermore, we use so-called transfer learning techniques to improve overall performance on different data types.

Details

Title
Learning to rank Higgs boson candidates
Author
Köppel, Marius 1 ; Segner, Alexander 1 ; Wagener, Martin 2 ; Pensel, Lukas 1 ; Karwath, Andreas 3 ; Schmitt, Christian 1 ; Kramer, Stefan 1 

 Johannes Gutenberg University, Mainz, Germany (GRID:grid.5802.f) (ISNI:0000 0001 1941 7111) 
 ETH, Zurich, Switzerland (GRID:grid.5801.c) (ISNI:0000 0001 2156 2780) 
 University of Birmingham, Birmingham, UK (GRID:grid.6572.6) (ISNI:0000 0004 1936 7486) 
Publication year
2022
Publication date
2022
Publisher
Nature Publishing Group
e-ISSN
20452322
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2696535043
Copyright
© The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.