SearcharxivSearch

arXiv subjects

Richard Kenway

Publications and source records attributed to Richard Kenway.

7 recordsLinked to original sources

Quantitative Understanding of PDF Fits and their Uncertainties

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.

hep-ph

Learning Trivializing Flows in a $\phi^4$ theory from coarser lattices

The so-called trivializing flows were proposed to speed up Hybrid Monte Carlo simulations, where the Wilson flow was used as an approximation of a trivializing map, a transformation of the gauge fields which trivializes the theory. It was shown that the scaling of the computational costs towards the continuum did not change with respect to HMC. The introduction of machine learning tecniques, especially normalizing flows, for the sampling of lattice gauge theories has shed some hope on solving topology freezing in lattice QCD simulations. In this talk I will present our work in a $\phi^{4}$ theory using normalizing flows as trivializing flows (given its similarity with the idea of a trivializing map), training from a trivial distribution as well as from coarser lattices, and study its scaling towards the continuum, comparing it with standard HMC.

hep-lat

Learning Trivializing Flows

The recent introduction of Machine Learning techniques, especially Normalizing Flows, for the sampling of lattice gauge theories has shed some hope on improving the sampling efficiency of the traditional Hybrid Monte Carlo (HMC) algorithm. In this work we study a modified HMC algorithm that draws on the seminal work on trivializing flows by L\"uscher. Autocorrelations are reduced by sampling from a simpler action that is related to the original action by an invertible mapping realised through Normalizing Flows models with a minimal set of training parameters. We test the algorithm in a $\phi^{4}$ theory in 2D where we observe reduced autocorrelation times compared with HMC, and demonstrate that the training can be done at small unphysical volumes and used in physical conditions. We also study the scaling of the algorithm towards the continuum limit under various assumptions on the network architecture.

hep-lat

Learning trivializing flows

The recent introduction of machine learning techniques, especially normalizing flows, for the sampling of lattice gauge theories has shed some hope on improving the sampling efficiency of the traditional HMC algorithm. Naive use of normalizing flows has been shown to lead to bad scaling with the volume. In this talk we propose using local normalizing flows at a scale given by the correlation length. Even if naively these transformations have a small acceptance, when combined with the HMC algorithm lead to algorithms with high acceptance, and also with reduced autocorrelation times compared with HMC. Several scaling tests are performed in the $ϕ^{4}$ theory in 2D.

hep-lat

Protection against Cloning for Deep Learning

The susceptibility of deep learning to adversarial attack can be understood in the framework of the Renormalisation Group (RG) and the vulnerability of a specific network may be diagnosed provided the weights in each layer are known. An adversary with access to the inputs and outputs could train a second network to clone these weights and, having identified a weakness, use them to compute the perturbation of the input data which exploits it. However, the RG framework also provides a means to poison the outputs of the network imperceptibly, without affecting their legitimate use, so as to prevent such cloning of its weights and thereby foil the generation of adversarial data.

stat.ML

Vulnerability of Deep Learning

The Renormalisation Group (RG) provides a framework in which it is possible to assess whether a deep-learning network is sensitive to small changes in the input data and hence prone to error, or susceptible to adversarial attack. Distinct classification outputs are associated with different RG fixed points and sensitivity to small changes in the input data is due to the presence of relevant operators at a fixed point. A numerical scheme, based on Monte Carlo RG ideas, is proposed for identifying the existence of relevant operators and the corresponding directions of greatest sensitivity in the input data. Thus, a trained deep-learning network may be tested for its robustness and, if it is vulnerable to attack, dangerous perturbations of the input data identified.

stat.ML

Current Renormalisation Constants with an O(a)-improved Fermion Action

Using chiral Ward identities, we determine the renormalisation constants of bilinear quark operators for the Sheikholeslami-Wohlert action lattice at beta=6.2. The results are obtained with a high degree of accuracy. For the vector current renormalisation constant we obtain Z_V=0.817(2)(8), where the first error is statistical and the second is due to mass dependence of Z_V. This is close to the perturbative value of 0.83. For the axial current renormalisation constant we obtain Z_A = 1.045(+10 -14), significantly higher than the value obtained in perturbation theory. This is shown to reduce the difference between lattice estimates and the experimental values for the pseudoscalar meson decay constants, but a significant discrepancy remains. The ratio of pseudoscalar to scalar renormalisation constants, Z_P/Z_S, is less well determined, but seems to be slightly lower than the perturbative value.

hep-lat