Related papers: Intersection cuts for factorable MINLP
Structured prediction requires manipulating a large number of combinatorial structures, e.g., dependency trees or alignments, either as latent or output variables. Recently, the SparseMAP method has been proposed as a differentiable, sparse…
Infrared subtraction algorithms beyond next-to-leading order necessitate the analysis of multiple infrared limits of scattering amplitudes, where several particles sequentially become soft or collinear. In this contribution, we report on…
Maximization of submodular functions under various constraints is a fundamental problem that has been studied extensively. A powerful technique that has emerged and has been shown to be extremely effective for such problems is the…
A fractal surface is a set which is a graph of a bivariate continuous function. In the construction of fractal surfaces using IFS, vertical scaling factors in IFS are important one which characterizes a fractal feature of surfaces…
The article considers linear functions of many (n) variables - multilinear polynomials (MP). The three-steps evaluation is presented that uses the minimal possible number of floating point operations for non-sparse MP at each step. The…
The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs,…
Cut-generating linear programs (CGLPs) play a key role as a separation oracle to produce valid inequalities for the feasible region of mixed-integer programs. When incorporated inside branch-and-bound, the cutting planes obtained from CGLPs…
Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…
We design a deterministic subexponential time algorithm that takes as input a multivariate polynomial $f$ computed by a constant-depth circuit over rational numbers, and outputs a list $L$ of circuits (of unbounded depth and possibly with…
It is by now well known that, at subleading power in scale ratios, factorization theorems for high-energy cross sections and decay amplitudes contain endpoint-divergent convolution integrals. The presence of these divergences hints at a…
In this article, we construct semiparametrically efficient estimators of linear functionals of a probability measure in the presence of side information using an easy empirical likelihood approach. We use estimated constraint functions and…
The Minimum Cost Multicut Problem (MP) is a popular way for obtaining a graph decomposition by optimizing binary edge labels over edge costs. While the formulation of a MP from independently estimated costs per edge is highly flexible and…
Presently flow and nonflow cannot be separated experimentally. Using Pythia simulations of p+p collisions we show that nonflow approximately factorizes. This fact may be used to disentangle flow and nonflow in heavy ion data by performing a…
A new method is presented for the simplification of loop integrals in one particle irreducible diagrams with large numbers of external lines, based on the partial fractioning of products of propagators. Whenever a loop diagram in $d$…
Nowadays, feature selection is frequently used in machine learning when there is a risk of performance degradation due to overfitting or when computational resources are limited. During the feature selection process, the subset of features…
From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise finite-dimensional persistence modules to the category of barcodes and overlap matchings. In this work, we introduce sub-barcodes and…
In this manuscript, which is to appear in the proceedings of the conference "MathemAmplitude 2019" in Padova, Italy, we provide an overview of the module intersection method for the the integration-by-parts (IBP) reduction of multi-loop…
This paper is devoted to study a fractional Choquard problem with slightly subcritical exponents on bounded domains. When the exponent of the convolution type nonlinearity tends to the fractional critical one in the sense of…
Penalty functions are widely used to enforce constraints in optimization problems and reinforcement leaning algorithms. Softplus and algebraic penalty functions are proposed to overcome the sensitivity of the Courant-Beltrami method to…
We present a novel approach for loop integral reduction in the Feynman parametrization using intersection theory and relative cohomology. In this framework, Feynman integrals correspond to boundary-supported differential forms in the…