Related papers: Advances in the nested soft-collinear subtraction …
In the context of infrared subtraction algorithms beyond next-to-leading order, it becomes necessary to consider multiple infrared limits of scattering amplitudes, in which several particles become soft or collinear in a strongly-ordered…
We provide an elementary pedagogical introduction to some basic concepts and techniques of soft (or Sudakov) resummation, specifically in QCD, paying particular attention to simple but useful tricks of the trade. We briefly review collinear…
Implicit neural representation has opened up new possibilities for inverse rendering. However, existing implicit neural inverse rendering methods struggle to handle strongly illuminated scenes with significant shadows and indirect…
We use the known soft and collinear limits of tree- and one-loop scattering amplitudes -- computed over a decade ago -- to explicitly construct a subtraction scheme for next-to-next-to-leading order (NNLO) computations. Our approach…
We propose a novel polyhedral uncertainty set for robust optimization, termed the smooth uncertainty set, which captures dependencies of uncertain parameters by constraining their pairwise differences. The bounds on these differences may be…
The non-uniform photoelectric response of infrared imaging systems results in fixed-pattern stripe noise being superimposed on infrared images, which severely reduces image quality. As the applications of degraded infrared images are…
Sharpness is an almost generic assumption in continuous optimization that bounds the distance from minima by objective function suboptimality. It facilitates the acceleration of first-order methods through restarts. However, sharpness…
Spectral Clustering is one of the most traditional methods to solve segmentation problems. Based on Normalized Cuts, it aims at partitioning an image using an objective function defined by a graph. Despite their mathematical attractiveness,…
In this paper a complete generalisation of the Catani-Seymour dipole subtraction method to next-to-leading order electroweak calculations is presented. All singularities due to photon and gluon radiation off both massless and massive…
We describe novel subgradient methods for a broad class of matrix optimization problems involving nuclear norm regularization. Unlike existing approaches, our method executes very cheap iterations by combining low-rank stochastic…
We discuss the concepts and the framework of the renormalization procedure in regularization-invariant momentum subtraction schemes. These schemes are used in the context of lattice simulations for the determination of physical quantities…
It is demonstrated that non-constant kernel solution, that can fit the spatial variations of the kernel can be obtained with minimum computing time. The CPU cost required with this new extension of the image subtraction method is almost the…
The Inertia Relief (IR) technique is widely used by industry and produces equilibrated loads allowing to analyze unconstrained systems without resorting to the more expensive full dynamic analysis. The main goal of this work is to develop a…
Spectral Clustering is a popular technique to split data points into groups, especially for complex datasets. The algorithms in the Spectral Clustering family typically consist of multiple separate stages (such as similarity matrix…
We present a simple way of separating the overlap between the soft and collinear factorization formulae of QCD squared matrix elements. We check its validity explicitly for single and double unresolved emissions of tree-level processes. The…
In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…
A consistent factorization theorem is presented in the framework of effective field theories. Conventional factorization suffers from infrared divergences in the soft and collinear parts. We present a factorization theorem in which the…
Thinning is the removal of contour pixels/points of connected components in an image to produce their skeleton with retained connectivity and structural properties. The output requirements of a thinning procedure often vary with…
We briefly review a subtraction scheme for computing radiative corrections to QCD jet cross sections that can be defined at any order in perturbation theory. Hereafter we discuss the computational methods used to evaluate analytically and…
The inversion of linear systems is a fundamental step in many inverse problems. Computational challenges exist when trying to invert large linear systems, where limited computing resources mean that only part of the system can be kept in…