Pith. sign in

REVIEW 1 cited by

Evolutionary algorithms for hyperparameter optimization in machine learning for application in high energy physics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.04434 v2 pith:AKK4V6BL submitted 2020-11-09 hep-ex

Evolutionary algorithms for hyperparameter optimization in machine learning for application in high energy physics

classification hep-ex
keywords algorithmuseralgorithmsneedparameterschoicedataenergy
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The analysis of vast amounts of data constitutes a major challenge in modern high energy physics experiments. Machine learning (ML) methods, typically trained on simulated data, are often employed to facilitate this task. Several choices need to be made by the user when training the ML algorithm. In addition to deciding which ML algorithm to use and choosing suitable observables as inputs, users typically need to choose among a plethora of algorithm-specific parameters. We refer to parameters that need to be chosen by the user as hyperparameters. These are to be distinguished from parameters that the ML algorithm learns autonomously during the training, without intervention by the user. The choice of hyperparameters is conventionally done manually by the user and often has a significant impact on the performance of the ML algorithm. In this paper, we explore two evolutionary algorithms: particle swarm optimization (PSO) and genetic algorithm (GA), for the purposes of performing the choice of optimal hyperparameter values in an autonomous manner. Both of these algorithms will be tested on different datasets and compared to alternative methods.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Frugal Bayesian Optimization: Scalable Surrogates for Data- and Resource-Limited Discovery

    cs.LG 2026-07 conditional novelty 5.0

    Across 17 benchmark and real-world tasks, non-GP surrogates (RF, NGBoost, BASS) match or beat Gaussian-process BO while using a fraction of the compute and memory, and a cheap-feature classifier can predict the best s...