相关论文: Lipatov's Effective Action Beyond Tree Level
It has been pointed out in recent papers that the example considered earlier in the O(N) sigma-model to test whether fixed-point actions are 1-loop perfect actually checked classical perfection only. To clarify the issue we constructed the…
This paper describes the most efficient way to manage operations on ranges of elements within an ordered set. The goal is to improve existing solutions, by optimizing the average-case time complexity and getting rid of heavy multiplicative…
The computation of feedback control using Dynamic Programming equation is a difficult task due the curse of dimensionality. The tree structure algorithm is one the methods introduced recently that mitigate this problem. The method computes…
Different aspects of the Verlinde and Verlinde relation between high-energy effective scattering in QCD and a two-dimensional sigma-model are discussed. Starting from a lattice version of the truncated 4-dimensional Yang-Mills action we…
Processes involving narrow jets receive perturbative corrections enhanced by logarithms of the jet opening angle and the ratio of the energies inside and outside the jets. Analyzing cone-jet processes in effective field theory, we find that…
It is important to obtain effective operators by integrating out high energy degrees of freedom in physics. We suggest a general method of calculating accurate irrelevant operators in a scattering process without use of equation of motions.…
High orders of perturbation theory can be calculated by the Lipatov method, whereby they are determined by saddle-point configurations (instantons) of the corresponding functional integrals. For most field theories, the Lipatov asymptotics…
For the same quantum field theory distinct effective actions can be obtained by coupling sources to different choices of field variables. This is the same as considering effective actions for theories related by a change of variables and…
In presence of a static pair of sources, the spectrum of low-lying states of any confining gauge theory in D space-time dimensions is described, at large source separations, by an effective string theory. Recently two important advances…
Dynamic trees are mixtures of tree structured belief networks. They solve some of the problems of fixed tree networks at the cost of making exact inference intractable. For this reason approximate methods such as sampling or mean field…
We discuss the peculiar features of the renormalization procedure in the case of infinite-component effective theory. It is shown that in the case of physically interesting theories (namely, those leading to the amplitudes with asymptotic…
We develop a diagrammatic approach to effective field theories (EFTs) corresponding to deep neural networks at initialization, which dramatically simplifies computations of finite-width corrections to neuron statistics. The structures of…
A simple and elementary proof of Butcher's theorem on the order conditions of Runge-Kutta methods is presented. It is based on a recursive definition of rooted trees and avoids combinatorial tools such as labelings and Faa di Bruno's…
We consider the problem of improving the effective potential in mass independent schemes, as e.g. the $\MSbar$ or $\DRbar$ renormalization scheme, in the presence of an arbitrary number of fields with $\phi$-dependent masses $M_i(\phi_c)$.…
This is the revised version of Sect. I - IV of the paper https://doi.org/10.1103/PhysRevD.89.125022 originally published in 2014. The thing is that in https://doi.org/10.1103/PhysRevD.89.125022 the text was insufficiently clear and, in…
The prevailing mindset is that a single decision tree underperforms classic random forests in testing accuracy, despite its advantages in interpretability and lightweight structure. This study challenges such a mindset by significantly…
Effective Polyakov loop theories are a useful tool for an investigation of pure Yang-Mills theory and full QCD. A systematic derivation of the effective action can be done in a spatial strong coupling expansion. Quite accurate predictions…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other logical theory, action theories may also evolve, and thus…
A variant of Turing machines is introduced where the tape is replaced by a single tree which can be manipulated in a style akin to purely functional programming. This yields two benefits: first, the extra structure on the tape can be…