REVIEW 9 cited by
The Dark Machines Anomaly Score Challenge: Benchmark Data and Model Independent Event Classification for the Large Hadron Collider
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
abstract
We describe the outcome of a data challenge conducted as part of the Dark Machines Initiative and the Les Houches 2019 workshop on Physics at TeV colliders. The challenged aims at detecting signals of new physics at the LHC using unsupervised machine learning algorithms. First, we propose how an anomaly score could be implemented to define model-independent signal regions in LHC searches. We define and describe a large benchmark dataset, consisting of >1 Billion simulated LHC events corresponding to $10~\rm{fb}^{-1}$ of proton-proton collisions at a center-of-mass energy of 13 TeV. We then review a wide range of anomaly detection and density estimation algorithms, developed in the context of the data challenge, and we measure their performance in a set of realistic analysis environments. We draw a number of useful conclusions that will aid the development of unsupervised new physics searches during the third run of the LHC, and provide our benchmark dataset for future studies at https://www.phenoMLdata.org. Code to reproduce the analysis is provided at https://github.com/bostdiek/DarkMachines-UnsupervisedChallenge.
Forward citations
Cited by 9 Pith papers
-
Benchmarking Machine Learning Architectures for ttH Multilepton Signal Sensitivity
A controlled benchmark of six ML classifiers on a new simulated ttH multilepton dataset finds symmetry-constrained graph models (Particle Transformer, LorentzNet) and azimuthal RoPE encoding outperform tabular baselines.
-
Enhancing anomaly detection with topology-aware autoencoders
Autoencoders with latent spaces shaped like S^2, S^2×S^2, or RP^2, matched to the phase-space topology of the background, reduce spurious reconstruction errors and give a small but consistent anomaly-detection gain ov...
-
Explicit or Implicit? Encoding Physics at the Precision Frontier
On three precision classification tasks — reweighting-based unfolding, likelihood-ratio estimation, and weakly supervised anomaly detection — a Lorentz-equivariant transformer and a pretrained foundation model perform...
-
Look everywhere effects in anomaly detection
Weakly supervised anomaly detectors that train and test on the same data produce badly miscalibrated p-values; independent test sets are calibrated but insensitive, while k-fold cross-validation is a workable middle ground.
-
SparsePixels: Efficient Convolution for Sparse Data on FPGAs
A fixed-budget sparse-convolution FPGA framework runs CNNs on <=20 of ~4000 pixels, achieving 0.665 us inference for MicroBooNE with a 73x speedup and ~2% AUC loss.
-
Optimal Transport Event Representation for Anomaly Detection
Adding a few optimal-transport-based features to standard jet observables nearly doubles anomaly-detection significance at 0.5% signal injection on LHC Olympics benchmarks.
-
Generator Based Inference (GBI)
Generator Based Inference uses data-derived background generators to turn resonant anomaly detection into parameter estimation, reaching 0.1 sigma signal sensitivity on the LHCO benchmark.
-
HEPTAPOD: Orchestrating High Energy Physics Workflows Towards Autonomous Agency
HEPTAPOD uses LLM agents to drive FeynRules, MadGraph, Pythia, and analysis tools through schema-validated tool calls and run-card templates, demonstrated on a leptoquark signal scan.
-
Machine Learning Power Week 2023: Clustering in Hadronic Calorimeters
Seven student teams applied K-means, anti-kt, and graph-based methods to ePIC calorimeter clustering; all beat the benchmark, with K-means variants on spherical coordinates performing best.
Discussion (0). Continue with ORCID to comment.