Related papers: Factorization and subtraction
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…
Soft-collinear effective theory is used to prove factorization of the B->gamma+l+nu decay amplitude at leading power in Lambda/m_b, including a demonstration of the absence of non-valence Fock states and of the finiteness of the convolution…
The study of factorization in the linearized gravity is extended to the graviton scattering processes with a massive scalar particle, with a massless vector boson and also with a graviton. Every transition amplitude is shown to be…
Soft factorization has been shown to hold to sub-leading order in QED and to sub-sub-leading order in perturbative quantum gravity, with various loop and non-universal corrections that can be found. Here we show that all terms factorizing…
In this paper we firstly demonstrate step by step that the factorization hypothesis is valid at the next-to-leading order (NLO) for the exclusive process $\rho \gamma^{\star} \to \rho$ by employing the collinear factorization approach, and…
We present a matrix factorization algorithm that scales to input matrices that are large in both dimensions (i.e., that contains morethan 1TB of data). The algorithm streams the matrix columns while subsampling them, resulting in low…
A robust algorithm for non-negative matrix factorization (NMF) is presented in this paper with the purpose of dealing with large-scale data, where the separability assumption is satisfied. In particular, we modify the Linear Programming…
We discuss a path toward the generalisation of the nested soft-collinear subtraction scheme to arbitrary $2\rightarrow n$ processes. The scheme is designed to provide an efficient and process-independent procedure to extract and regulate…
We consider factoring low-rank tensors in the presence of outlying slabs. This problem is important in practice, because data collected in many real-world applications, such as speech, fluorescence, and some social network data, fit this…
We address the problem of decomposing graphs in perturbative QCD into terms associated with particular regions. Motivated by asking how to incorporate next-to-leading order (NLO) QCD corrections in parton-shower algorithms, we require that:…
Factorization is possible due to the universal behavior of Yang-Mills theories in soft and collinear limits. Here, we take a small step towards a more transparent understanding of these limits by proving a form of perturbative factorization…
Motivated by asking how to combine parton showers with nonleading QCD matrix elements, we discuss a subtractive technique based on gauge-invariant Wilson-line operators and how this can be used to treat the soft region.
The subleading corrections to factorization theorems for soft bremsstrahlung in nonabelian gauge theories and gravity are investigated in the case of a five point amplitude with four scalars. Building on recent results, we write the action…
In this thesis we present an introduction to Soft-Collinear Effective Theory, which can be used to prove (or disprove) factorization theorems to all orders in the strong coupling constant for some B decays into light and energetic…
In this paper we show how gauge symmetries in an effective theory can be used to simplify proofs of factorization formulae in highly energetic hadronic processes. We use the soft-collinear effective theory, generalized to deal with…
Factor Analysis is about finding a low-rank plus sparse additive decomposition from a noisy estimate of the signal covariance matrix. In order to get such a decomposition, we formulate an optimization problem using the nuclear norm for the…
Many collider observables suffer from non-global logarithms not captured by standard resummation techniques. Classic examples are the light-jet mass event shape in the limit of small mass and the related hemisphere soft function. We derive…
Cut vertices, a generalization of matrix elements of local operators, are revisited, and an expansion in terms of minimally subtracted cut vertices is formulated. An extension of the formalism to deal with semi-inclusive deep inelastic…
Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…
In this work we perform some mathematical analysis on non-negative matrix factorizations (NMF) and apply NMF to some imaging and inverse problems. We will propose a sparse low-rank approximation of big positive data and images in terms of…