Related papers: Principles of general final-state resummation and …

The resummation of logarithmically-enhanced terms to all perturbative orders is a prerequisite for many studies of QCD final-states. Until now such resummations have always been performed by hand, for a single observable at a time. In this…

We present an innovative method to resum infrared and collinear logarithms appearing in distributions of jet observables in QCD. The method, based on a general master formula with applicability conditions, allows resummations at…

This talk gives a brief discussion of the motivations and principles behind computer automated expert semi-analytical resummation (CAESAR) for QCD final states.

We present a master formula, with applicability conditions, which allows us to automate the resummation of infrared and collinear logarithms appearing in distributions of jet observables in QCD at next-to-leading logarithmic accuracy.

In this work, we study the fully automated inference of expected result values of probabilistic programs in the presence of natural programming constructs such as procedures, local variables and recursion. While crucial, capturing these…

This paper studies recursive composite hypothesis testing in a network of sparsely connected agents. The network objective is to test a simple null hypothesis against a composite alternative concerning the state of the field, modeled as a…

We obtain a prediction for the hadron-collider event-shape variable transverse thrust in which the terms enhanced in the dijet limit are resummed to next-to-next-to-leading logarithmic accuracy. Our method exploits universality properties…

A Maximum Likelihood recursive state estimator is derived for non-linear and non-Gaussian state-space models. The estimator combines a particle filter to generate the conditional density and the Expectation Maximization algorithm to compute…

An ensemble method is introduced that utilizes randomization and loss function gradients to compute a prediction. Multiple weakly-correlated estimators approximate the gradient at randomly sampled points on the error surface and are…

The lefthanded Lov\'asz local lemma (LLLL) is a generalization of the Lov\'asz local lemma (LLL), a powerful technique from the probabilistic method. We prove a computable version of the LLLL and use it to effectivize a collection of…

A recursive state estimation procedure is derived for a linear time varying system with both parametric uncertainties and stochastic measurement droppings. This estimator has a similar form as that of the Kalman filter with intermittent…

We derive sufficient conditions for the solvability of the state estimation problem for a class of nonlinear control time-varying systems which includes those, whose dynamics have triangular structure. The state estimation is exhibited by…

We build a computer code that fully automates the resummation of jet-observable distributions at next-to-leading logarithmic accuracy. As an application we present results for a jet shape in hadronic dijet production.

For many observables, the most difficult part of a single logarithmic resummation is the analytical treatment of the observable's dependence on multiple emissions. We present a general numerical method, which allows the resummation…

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…

We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We…

Standard QCD resummation techniques provide precise predictions for the spectrum and the cumulant of a given observable. The integrated spectrum and the cumulant differ by higher-order terms which, however, can be numerically significant.…

We propose a generalized debiased Lasso estimator based on a stability principle. When a single column of the design matrix is perturbed, the estimator admits a simple update formula that can be computed from the original solution. Under…

In this paper, we consider labeled finite-state automata (LFSAs), extend some state estimation-based properties from a single agent to a finite ordered set of agents. We also extend the notion of observer to \emph{high-order observer} using…

Finsler's lemma is a classic mathematical result with applications in control and optimization. When the lemma is applied to parameter-dependent LMIs, as such those that arise from problems of robust stability, the extra variables…