HDSense: An efficient method for ranking observable sensitivity
Abstract
Identifying which observables most effectively constrain model parameters can be computationally prohibitive when considering full likelihoods of many correlated observables. This is especially important for, e.g., hadronization models, where high precision is required to interpret the results of collider experiments. We introduce the High-Dimensional Sensitivity (HDSense) score, a computationally efficient metric for ranking observable sets using only one-dimensional histograms. Derived by profiling over unknown correlations in the Fisher information framework, the score balances total information content against redundancy between observables. We apply HDSense to rank a set observables in terms of their constraining power with respect to five parameters of the Lund string model of hadronization implemented in Pythia using simulated leptonic collider events at the pole. Validation against machine-learning--based full-likelihood approximations demonstrates that HDSense successfully identifies near-optimal observable subsets. The framework naturally handles data from multiple experiments with different acceptances and incorporates detector effects. While demonstrated on hadronization models, the methodology applies broadly to generic parameter estimation problems where correlations are unknown or difficult to model.
Cite
@article{arxiv.2602.01509,
title = {HDSense: An efficient method for ranking observable sensitivity},
author = {Benoît Assi and Christian Bierlich and Rikab Gambhir and Phil Ilten and Tony Menzo and Stephen Mrenna and Manuel Szewc and Michael K. Wilkinson and Jure Zupan},
journal= {arXiv preprint arXiv:2602.01509},
year = {2026}
}
Comments
25+11 pages, 9 figures, code available at: https://gitlab.com/pythia8-contrib/packages/hdsense