mlsanityData to 14 Oct 2026

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

arXiv 2605.01363 ↗First posted 2 May 2026hep-ex cs.LG hep-phcited by 0

Not on the map. Why?

Abstract (arXiv)

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 isometric log-ratio coordinate system. Because the quadratic Euclidean cost of Brenier transport in this coordinate system is equivalent to the Aitchison distance on the simplex, the learned map induces a minimal deformation under the Aitchison geometry. Furthermore, we extract flavor-conditional target distributions directly from control-region data using an expectation-maximization (EM) technique that simultaneously fits multiple control regions, models each flavor component with a normalizing flow, and estimates the regional mixture fractions. The extracted targets are subsequently used to learn flavor-factorized transport maps. Because the joint estimation of mixture fractions and flexible component densities admits weakly constrained directions, we further introduce a linearized feedback-operator analysis that propagates the fitted composition covariance into the extracted component densities, separating data-constrained modes from those dominated by the composition prior. The simulation-based closure study demonstrates improved closure in dedicated control regions and in independent validation mixtures.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 17 references that are in the map. First posted on arXiv 2 May 2026.

Builds on

5 of 17 references.

References · 5

  1. 2015Variational Inference with Normalizing Flowscited by 2,170
  2. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
  3. 2019Neural Spline Flowscited by 596
  4. 2016Input Convex Neural Networkscited by 414
  5. 2019Optimal transport mapping via input convex neural networkscited by 206

Built on by

Not cited yet.