Related papers: On Multi-step BCFW Recursion Relations
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
The boundary contribution of an amplitude in the BCFW recursion relation can be considered as a form factor involving boundary operator and unshifted particles. At the tree-level, we show that by suitable construction of Lagrangian, one can…
We describe CFW, a computationally efficient algorithm for collaborative filtering that uses posteriors over weights of evidence. In experiments on real data, we show that this method predicts as well or better than other methods in…
This paper proposes a novel dynamical system called the Multiobjective Balanced Gradient Flow (MBGF), offering a dynamical perspective for normalized gradient methods in a class of multi-objective optimization problems. Under certain…
The problem of estimating the delays and amplitudes of a positive stream of pulses appears in many applications, such as single-molecule microscopy. This paper suggests estimating the delays and amplitudes using a convex program, which is…
On-shell methods offer an alternative definition of quantum field theory at tree-level, replacing Feynman diagrams with recursion relations and interaction vertices with a handful of seed scattering amplitudes. In this paper we determine…
This paper aims to build a probabilistic framework for Howard's policy iteration algorithm using the language of forward-backward stochastic differential equations (FBSDEs). As opposed to conventional formulations based on partial…
We analyze the validity of BCFW recursion relations for currents of n - 2 gluons and two massive quarks, where one of the quarks is off shell and the remaining particles are on shell. These currents are gauge-dependent and can be used as…
When an inverse problem is solved by a gradient-based optimization algorithm, the corresponding forward and adjoint problems, which are introduced to compute the gradient, can be also solved iteratively. The idea of iterating at the same…
New approach to computing the amplitudes of multi-particle processes in renormalizable quantum field theories is presented. Its major feature is a separation of the renormalization from the computation. Within the suggested approach new…
We consider the problem of estimating a signal from noisy circularly-translated versions of itself, called multireference alignment (MRA). One natural approach to MRA could be to estimate the shifts of the observations first, and infer the…
This is one of our series works on discrete energy analysis of the variable-step BDF schemes. In this part, we present stability and convergence analysis of the third-order BDF (BDF3) schemes with variable steps for linear diffusion…
Phase retrieval consists in the recovery of a complex-valued signal from intensity-only measurements. As it pervades a broad variety of applications, many researchers have striven to develop phase-retrieval algorithms. Classical approaches…
In unitarity cut method, compact input of on-shell tree level amplitudes is crucial to simplify calculations. Although BCFW on-shell recursion relation gives very compact tree level amplitudes, they usually contain spurious poles. In this…
We provide a new efficient adaptive algorithm for performing phase estimation that does not require that the user infer the bits of the eigenphase in reverse order; rather it directly infers the phase and estimates the uncertainty in the…
Bicoherence analysis is a well established method for identifying the quadratic nonlinearity of stationary processes. However, it is often applied without checking the basic assumptions of stationarity and convergence. The classic…
The advantages of using Multi-Step corrections for simulations of lattice gauge theories with dynamical fermions will be discussed. This technique is suited for algorithms based on the Multi-Boson representation of the dynamical fermions as…
To find boundary contributions is a rather difficult problem when applying the BCFW recursion relation. In this paper, we propose an approach to bypass this problem by calculating general tree amplitudes that contain no polynomial using…
Owing to their low-complexity iterations, Frank-Wolfe (FW) solvers are well suited for various large-scale learning tasks. When block-separable constraints are present, randomized block FW (RB-FW) has been shown to further reduce complexity…
The phase retrieval from multi-frequency intensity (power) observations is considered. The object to be reconstructed is complex-valued. A novel algorithm is presented that accomplishes both the object phase (absolute phase) retrieval and…