Optimal-Transport Contrastive Learning for Centrality Determination in Heavy-Ion Collisions
Abstract
Determining centrality of heavy-ion collisions with high resolution is essential for event-by-event analyses, in particular for net-proton fluctuation measurements aimed at locating the QCD critical point. Supervised machine-learning approaches rely on labels generated by model and therefore inherit the model dependence of the training target. In this work, we propose an unsupervised method to determine collision centrality based on optimal transport. Each collision is represented by its 1-Wasserstein distances to a fixed set of landmark events chosen to cover the measured multiplicity range. A point-cloud network trained by contrastive learning then compresses these distances into a compact event embedding, which is partitioned into equal-size centrality classes. We find that this approach groups events with similar Npart and yields a better centrality resolution, quantified by the normalized width of the Npart distribution, than the conventional method of cutting on particle multiplicity. The method, however, encounters a bottleneck once realistic kinematic cuts are applied to the particles. We attribute this degraded performance to the loss of distinct features between central and peripheral collisions because of applying kinematic cuts. The application of optimal transport to centrality determination in experimental data, remains an open problem that needs further study.
Related
- Centrality dependence of charged-hadron pseudorapidity distributions in oxygen-oxygen collisions at √(sNN) = 5.36 TeV
- Unsupervised and probabilistic learning with Contrastive Local Learning Networks: The Restricted Kirchhoff Machine
- Lyman Break Galaxy selection and redshift measurement with supervised contrastive learning
- Spin transport in intermediate-energy heavy-ion collisions
- SelfTICA: contrastive learning of dynamical representations for rare-event sampling and characterization
BibTeX
@misc{yang2026optimaltransport,
title = {{Optimal-Transport Contrastive Learning for Centrality Determination in Heavy-Ion Collisions}},
author = {Shu-Yun Yang and Yu Zhang},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.07465},
eprint = {2611.07465},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.07465},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Optimal-Transport Contrastive Learning for Centrality Determination in Heavy-Ion Collisions
AU - Shu-Yun Yang
AU - Yu Zhang
PY - 2026
DA - 2026/11/05
PB - arXiv
DO - 10.48550/arxiv.2611.07465
UR - https://arxiv.org/abs/2611.07465
AB - Determining centrality of heavy-ion collisions with high resolution is essential for event-by-event analyses, in particular for net-proton fluctuation measurements aimed at locating the QCD critical point. Supervised machine-learning approaches rely on labels generated by model and therefore inherit the model dependence of the training target. In this work, we propose an unsupervised method to determine collision centrality based on optimal transport. Each collision is represented by its 1-Wasserstein distances to a fixed set of landmark events chosen to cover the measured multiplicity range. A point-cloud network trained by contrastive learning then compresses these distances into a compact event embedding, which is partitioned into equal-size centrality classes. We find that this approach groups events with similar N_part and yields a better centrality resolution, quantified by the normalized width of the N_part distribution, than the conventional method of cutting on particle multiplicity. The method, however, encounters a bottleneck once realistic kinematic cuts are applied to the particles. We attribute this degraded performance to the loss of distinct features between central and peripheral collisions because of applying kinematic cuts. The application of optimal transport to centrality determination in experimental data, remains an open problem that needs further study.
ER -