Aller au contenu principal
Accès ouvert déclaré 2026 preprint

Efficient binned profile likelihood minimization for precision measurements with RABBIT

0Citations signalées — pas une note de qualité
0Institutions déclarées
0Pays d’affiliation déclarés

Résumé fourni par la source

Precision measurements at the LHC increasingly rely on binned profile maximum likelihood fits with thousands of bins and nuisance parameters, and the High-Luminosity LHC will push these numbers further. Fast and robust minimization of such likelihoods is crucial for timely analysis development and accurate inference. We present Rabbit (Rapid Automatic Bin-Based Inference Tool), a Python framework that exploits differentiable programming in TensorFlow 2 to perform this task on CPUs and GPUs. Automatic differentiation provides exact gradients and Hessian-vector products for a trust-region minimizer operating in Krylov subspaces, and just-intime compilation yields near-C++ execution speed. Rabbit implements flexible statistical models with analytic treatments where possible, supports symmetrization options that establish Gaussian approximations and a linearized likelihood formulation with deterministic solutions, and focuses on measuring physical observables through differentiable transformations of the model, including unfolded differential cross sections. Benchmarks on synthetic models demonstrate excellent scaling with the number of bins and parameters, outperforming established tools in challenging regimes where these fail to converge within reasonable time.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.

Contrôle bibliographique ouvert

La source scientifique ouverte est momentanément indisponible.

Sujets associés

Particle physics theoretical and experimental studiesParticle Detector Development and PerformanceHigh-Energy Particle Collisions Research

BNTIC News n’est pas le producteur de ces données. Recherche à la demande dans Crossref et Europe PMC, sans clé ; OpenAlex reste optionnel. Aucun service payant requis, aucune réponse conservée. Sources et limites.