Related papers: Dipole Splitting Algorithm -- A practical algorith…
The most widely used algorithm for floating point complex division, known as Smith's method, may fail more often than expected. This document presents two improved complex division algorithms. We present a proof of the robustness of the…
A wide range of fundamental machine learning tasks that are addressed by the maximum a posteriori estimation can be reduced to a general minimum conical hull problem. The best-known solution to tackle general minimum conical hull problems…
This paper proposes a self-explainable Deep Learning (SE-DL) system for an image classification problem that performs self-error detection. The self-error detection is key to improving the DL system's safe operation, especially in…
The Douglas-Rachford (DR) algorithm is an iterative procedure that uses sequential reflections onto convex sets and which has become popular for convex feasibility problems. In this paper we propose a structural generalization that allows…
We propose a general strategy to discretize the Dyson series without applying direct numerical quadrature to high-dimensional integrals, and extend this framework to open quantum systems. The resulting discretization can also be interpreted…
Semi-Inclusive Deep-Inelastic Scattering provides unique access to the three-dimensional momentum and spin structure of the proton, enabling precise studies of parton dynamics and hadronization in QCD. We present a transverse-momentum…
We consider the problem of sampling from the posterior distribution of a $d$-dimensional coefficient vector $\boldsymbol{\theta}$, given linear observations $\boldsymbol{y} = \boldsymbol{X}\boldsymbol{\theta}+\boldsymbol{\varepsilon}$. In…
Single diffractive Drell-Yan reaction in hadron-hadron collisions is considered as an important source of information on the properties of soft QCD interactions. In particular, it provides an access to the dynamics of the QCD factorisation…
Diffuse optical tomography (DOT) is an imaging modality which uses near-infrared light. Although iterative numerical schemes are commonly used for its inverse problem, correct solutions are not obtained unless good initial guesses are…
In this paper, we consider a class of structured nonconvex nonsmooth optimization problems whose objective function is the sum of three nonconvex functions, one of which is expressed in a difference-of-convex (DC) form. This problem class…
We present a brief survey on the compression of discrete measures by Caratheodory-Tchakaloff Subsampling, its implementation by Linear or Quadratic Programming and the application to multivariate polynomial Least Squares. We also give an…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…
The $\mathcal{N}=1$ superconformal field theories that arise in AdS-CFT from placing a stack of D3-branes at the singularity of a toric Calabi-Yau threefold can be described succinctly by dimer models. We present an efficient algorithm for…
We present a systematic decomposition of QCD splitting functions into scalar dipole radiators and pure splitting remainders up to second order in the strong coupling. The individual components contain terms that are formally sub-leading in…
A direct sampling method (DSM) is designed herein for a real-time detection of small anomalies from scattering parameters measured by a small number of dipole antennas. Applicability of the DSM is theoretically demonstrated by proving that…
We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there…
In this paper, we study a class of nonconvex and nonsmooth structured difference-of-convex (DC) programs, which contain in the convex part the sum of a nonsmooth linearly composed convex function and a differentiable function, and in the…
This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…
We present an engineered version of the divide-and-conquer algorithm for finding the closest pair of points, within a given set of points in the XY-plane. For this version of the algorithm we show that only two pairwise comparisons are…
Delaunay Triangulation(DT) is one of the important geometric problems that is used in various branches of knowledge such as computer vision, terrain modeling, spatial clustering and networking. Kinetic data structures have become very…