paper-with-me

홈 › Papers

Extracting more from boosted decision trees: A high energy physics case study

2020-01-16 · Vidhi Lalchand

Particle identification is one of the core tasks in the data analysis pipeline at the Large Hadron Collider (LHC). Statistically, this entails the identification of rare signal events buried in immense backgrounds that mimic the properties of the former. In machine learning parlance, particle identification represents a classification problem characterized by overlapping and imbalanced classes. Boosted decision trees (BDTs) have had tremendous success in the particle identification domain but more recently have been overshadowed by deep learning (DNNs) approaches. This work proposes an algorithm to extract more out of standard boosted decision trees by targeting their main weakness, susceptibility to overfitting. This novel construction harnesses the meta-learning techniques of boosting and bagging simultaneously and performs remarkably well on the ATLAS Higgs (H) to tau-tau data set (ATLAS et al., 2014) which was the subject of the 2014 Higgs ML Challenge (Adam-Bourdarios et al., 2015). While the decay of Higgs to a pair of tau leptons was established in 2018 (CMS collaboration et al., 2017) at the 4.9$\sigma$ significance based on the 2016 data taking period, the 2014 public data set continues to serve as a benchmark data set to test the performance of supervised classification schemes. We show that the score achieved by the proposed algorithm is very close to the published winning score which leverages an ensemble of deep neural networks (DNNs). Although this paper focuses on a single application, it is expected that this simple and robust technique will find wider applications in high energy physics.

📄 PDF Abstract BibTeX arXiv:2001.06033

Code (0)

등록된 구현이 없습니다.

Tasks

Meta-Learning

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

2019-06-08 · NeurIPS 2019 12 · Maksym Andriushchenko, Matthias Hein

The problem of adversarial robustness has been studied extensively for neural networks. However, for boosted decision trees and decision stumps there are almost no results, even though they are widely used in practice (e…

Adversarial Robustness

Compact Multi-Class Boosted Trees

2017-10-31 · Natalia Ponomareva, Thomas Colthurst, Gilbert Hendry, Salem Haykal 외

Gradient boosted decision trees are a popular machine learning technique, in part because of their ability to give good accuracy with small models. We describe two extensions to the standard tree boosting algorithm desig…

Local Decorrelation For Improved Detection

2014-06-04 · Woonhyun Nam, Piotr Dollár, Joon Hee Han

Even with the advent of more sophisticated, data-hungry methods, boosted decision trees remain extraordinarily successful for fast rigid object detection, achieving top accuracy on numerous datasets. While effective, mos…

object-detectionObject Detection

Local Decorrelation For Improved Pedestrian Detection

2014-12-01 · NeurIPS 2014 12 · Woonhyun Nam, Piotr Dollar, Joon Hee Han

Even with the advent of more sophisticated, data-hungry methods, boosted decision trees remain extraordinarily successful for fast rigid object detection, achieving top accuracy on numerous datasets. While effective, mos…

object-detectionObject DetectionPedestrian Detection

Gradient Boosted Filters For Signal Processing

2024-05-15 · Jose A. Lopez, Georg Stemmer, Hector A. Cordourier

Gradient boosted decision trees have achieved remarkable success in several domains, particularly those that work with static tabular data. However, the application of gradient boosted models to signal processing is unde…