Related papers: Unifying the Fixed Order Evolution of Fragmentatio…
Acceleration is a celebrated cornerstone of convex optimization, enabling gradient-based algorithms to converge sublinearly in the condition number. A major open question is whether an analogous acceleration phenomenon is possible for…
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…
The explicit expressions for the non-singlet DIS structure function g_1 at small $x$ are obtained by resumming the leading logarithmic contributions. The role played by the fits for the initial parton densities currently used in the DGLAP…
We present an efficient numerical solution of the DGLAP equations for single and double parton distribution functions (PDFs and DPDs), based on the Chebyshev interpolation of these functions. For PDF evolution, our method allows for a…
A next-to-next-to-leading order (NNLO) QCD calculation of gluon distribution function at small-x is presented. The gluon distribution function is explored analytically in the DGLAP approach by a Taylor expansion at small x as two first…
We present particular and unique solutions of Dokshitzer-Gribov-Lipatov- Altarelli-Parisi (DGLAP) evolution equations for light sea and valence quark structure functions in leading order (LO). We obtain t evolutions of sea and valence quark…
We provide code to solve the Dokshitzer-Gribov-Lipatov-Altarelli-Parisi (DGLAP) evolution equations for the nucleon transversity parton distribution functions (PDFs), which encode nucleon transverse spin structure. Though codes are widely…
In this paper, we study saddle point (SP) problems, focusing on convex-concave optimization involving functions that satisfy either two-sided quadratic functional growth (QFG) or two-sided quadratic gradient growth (QGG)--novel conditions…
We study a class of generalized linear programs (GLP) in a large-scale setting, which includes simple, possibly nonsmooth convex regularizer and simple convex set constraints. By reformulating (GLP) as an equivalent convex-concave min-max…
We present numerical solutions of the $Q^2$ evolution equations at next-to-leading order (NLO) for unpolarized and polarized parton distributions, in both the flavor non-singlet and singlet channels. The numerical method is based on a…
We present numerical studies of the leading non-linear corrections to the DGLAP evolution equations of parton distribution functions (PDFs) resulting from gluon recombination, which reduce the pace of evolution at small momentum fractions…
Using Laplace transform techniques, along with newly-developed accurate numerical inverse Laplace transform algorithms, we decouple the solutions for the singlet structure function $F_s(x,Q^2)$ and $G(x,Q^2)$ of the two leading-order…
We consider distributed optimization under communication constraints for training deep learning models. We propose a new algorithm, whose parameter updates rely on two forces: a regular gradient step, and a corrective direction dictated by…
We present a novel semi-analytical method for parton evolution. It is based on constructing a family of analytic functions spanning $x$-space which is closed under the considered evolution equation. Using these functions as a basis, the…
The quark form factor is known to exponentiate within the framework of dimensionally regularized perturbative QCD. The logarithm of the form factor is expressed in terms of integrals over the scale of the running coupling. I show that these…
We propose two distributed iterative algorithms that can be used to solve, in finite time, the distributed optimization problem over quadratic local cost functions in large-scale networks. The first algorithm exhibits synchronous operation…
We analytically solved the QED $\otimes$ QCD coupled DGLAP evolution equations at leading order (LO) quantum electrodynamics (QED) and next to leading order (NLO) quantum chromodynamics (QCD) approximations, using the Laplace transform…
In \cite{liu2022practical}, a general algorithm is developed to efficiently obtain the best accuracy using the regular refinement. The adaptive refinement allows for obtaining an accuracy with a smaller number of DoFs compared with the…
Multi-region segmentation algorithms often have the onus of incorporating complex anatomical knowledge representing spatial or geometric relationships between objects, and general-purpose methods of addressing this knowledge in an…
We consider electroweak radiative corrections to hard inclusive processes at the TeV scale, and we investigate how collinear logarithms factorize in a spontaneously broken gauge theory, similarly to the DGLAP analysis in QCD. Due to the…