Support Vector Machines and generalisation in HEP
arXiv:1702.04686 · doi:10.1088/1742-6596/898/7/072021
Abstract
We review the concept of Support Vector Machines (SVMs) and discuss examples of their use in a number of scenarios. Several SVM implementations have been used in HEP and we exemplify this algorithm using the Toolkit for Multivariate Analysis (TMVA) implementation. We discuss examples relevant to HEP including background suppression for at the LHC with several different kernel functions. Performance benchmarking leads to the issue of generalisation of hyper-parameter selection. The avoidance of fine tuning (over training or over fitting) in MVA hyper-parameter optimisation, i.e. the ability to ensure generalised performance of an MVA that is independent of the training, validation and test samples, is of utmost importance. We discuss this issue and compare and contrast performance of hold-out and k-fold cross-validation. We have extended the SVM functionality and introduced tools to facilitate cross validation in TMVA and present results based on these improvements.
arXiv comment8 pages, submitted to the proceedings of the CHEP 2016 conference
References in corpus (5)
- A survey of cross-validation procedures for model selection
- Performance and optimization of support vector machines in high-energy physics classification problems
- Support Vector Machines in Analysis of Top Quark Production
- Support Vector Machine Classification on a Biased Training Set: Multi-Jet Background Rejection at Hadron Colliders
- Support Vector Machines and Generalisation in HEP