Related papers: The SISCone and anti-kt jet algorithms
We develop a new interior-point method (IPM) for symmetric-cone optimization, a common generalization of linear, second-order-cone, and semidefinite programming. In contrast to classical IPMs, we update iterates with a geodesic of the cone…
We derive generating functions, valid to next-to-double logarithmic accuracy, for QCD jet rates according to the inclusive forms of the kt, Cambridge/Aachen and anti-kt algorithms, which are equivalent at this level of accuracy. We compare…
We present a new approach to jet definition alternative to clustering methods, such as the anti-$k_T$ scheme, that exploit kinematic data directly. Instead the new method uses kinematic information to represent the particles in a…
The hard-scatter processes in hadronic collisions are often largely contaminated with soft background coming from pileup in proton-proton collisions, or underlying event in heavy-ion collisions. This paper presents a new background…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
Keypoint detection and matching is a fundamental task in many computer vision problems, from shape reconstruction, to structure from motion, to AR/VR applications and robotics. It is a well-studied problem with remarkable successes such as…
The Information Contrastive (I-Con) framework revealed that over 23 representation learning methods implicitly minimize KL divergence between data and learned distributions that encode similarities between data points. However, a KL-based…
The structure of hadronic jets depends not only on the dynamics of QCD but also on the details of the jet finding algorithm and the physical process in which the jet is produced. To study these effects in more detail we calculate the jet…
We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate…
We calculate the subjet rates for jets produced in hadron collisions. The kt algorithm is used to define the jets and allows the theoretical calculation to sum both the leading and next-to-leading logarithms in the resolution variable,…
We present a new approach to jet definition alternative to clustering methods, such as the anti-$k_T$ scheme, that exploit kinematic data directly. Instead the new method uses kinematic information to represent the particles in a…
Motivated by the entropic optimal transport problem in unbounded settings, we study versions of Hilbert's projective metric for spaces of integrable functions of bounded growth. These versions of Hilbert's metric originate from cones which…
We investigate a modification of the $k_\perp$-clustering jet algorithm for hadron-hadron collisions, analogous to the ``Cambridge'' algorithm recently proposed for $e^+e^-$ annihilation, in which pairs of objects that are close in angle…
The joint design of the optical system and the downstream algorithm is a challenging and promising task. Due to the demand for balancing the global optimal of imaging systems and the computational cost of physical simulation, existing…
We present a real-time algorithm that finds the Penetration Depth (PD) between general polygonal models based on iterative and local optimization techniques. Given an in-collision configuration of an object in configuration space, we find…
We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even…
A jet algorithm must specify how to (re-)combine different partons or towers into a single four-vector. Various recombination schemes have been used experimentally to examine the transverse energy profile of jets in hadron colliders.…
We present a re-analysis of the optical spectroscopic data on SS433 from the last quarter-century and demonstrate that these data alone contain systematic and identifiable deviations from the traditional kinematic model for the jets:…
We present a continuous-time collision detection algorithm for quickly detecting whether certain polynomial trajectories in time intersect with convex obstacles. The algorithm is used in conjunction with an existing multicopter trajectory…