mlsanityData to 14 Oct 2026

Quantitative Understanding of PDF Fits and their Uncertainties

arXiv 2512.24116 ↗First posted 30 Dec 2025hep-ph cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Parton Distribution Functions (PDFs) play a central role in describing experimental data at colliders and provide insight into the structure of nucleons. As the LHC enters an era of high-precision measurements, a robust PDF determination with a reliable uncertainty quantification has become mandatory in order to match the experimental precision. The NNPDF collaboration has pioneered the use of Machine Learning (ML) techniques for PDF determinations, using Neural Networks (NNs) to parametrise the unknown PDFs in a flexible and unbiased way. The NNs are then trained on experimental data by means of stochastic gradient descent algorithms. The statistical robustness of the results is validated by extensive closure tests using synthetic data. In this work, we develop a theoretical framework based on the Neural Tangent Kernel (NTK) to analyse the training dynamics of neural networks. This approach allows us to derive, under precise assumptions, an analytical description of the neural network evolution during training, enabling a quantitative understanding of the training process. Having an analytical handle on the training dynamics allows us to clarify the role of the NN architecture and the impact of the experimental data in a transparent way. Similarly, we are able to describe the evolution of the covariance of the NN output during training, providing a quantitative description of how uncertainties are propagated from the data to the fitted function. While our results are not a substitute for PDF fitting, they do provide a powerful diagnostic tool to assess the robustness of current fitting methodologies. Beyond its relevance for particle physics phenomenology, our analysis of PDF determinations provides a testbed to apply theoretical ideas about the learning process developed in the ML community.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 36 references that are in the map. First posted on arXiv 30 Dec 2025.

Builds on

9 of 36 references.

References · 9

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  3. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
  4. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
  5. 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 187
  6. 2021The Principles of Deep Learning Theorycited by 173
  7. 2020Implicit Gradient Regularizationcited by 146
  8. 2021Symmetry-via-Duality: Invariant Neural Network Densities from Parameter-Space Correlatorscited by 29
  9. 2024Collective variables of neural networks: empirical time evolution and scaling lawscited by 3

Built on by

Not cited yet.