Sign inGet started
Paper · arXiv

Data-Driven, Geometry-Aware Optimal-Transport Calibration of Flavor Tagger

Flavor-tagging calibrations are often provided either as scale factors measured at a finite set of working points or as binned corrections to a chosen one-dimensional discriminant. However, this approach falls short of providing continuous, event-level calibration across the full multicomponent outputs of modern taggers. This limitation leads to information loss in analyses that demand high-performance flavor tagging, restricting analyses to a limited set of predefined variables. In this work, we propose a geometry-aware framework that formulates flavor-tagger calibration as an optimal transport problem on the probability simplex. The transport maps are parameterized and trained in the is...

AuthorsYeonjoon Kim, Un-ki Yang
Primary categoryhep-ex
Published2 May 2026
Last updated at source2 May 2026
hep-excs.LGhep-phstat.ME
Embed this entry
<iframe src="https://silytics.si/embed/item/f43c3990-c1d9-4cc8-b3d0-55bd75476dda" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.