Related papers: A Strong Direct Sum Theorem for Distributional Que…

The strong factorization conjecture states that a proper birational map between smooth algebraic varieties over a field of characteristic zero can be factored as a sequence of smooth blowups followed by a sequence of smooth blowdowns. We…

In this work, we study a range of constrained versions of the $k$-supplier and $k$-center problems such as: capacitated, fault-tolerant, fair, etc. These problems fall under a broad framework of constrained clustering. A unified framework…

We discuss the computational complexity of approximating maximum a posteriori inference in sum-product networks. We first show NP-hardness in trees of height two by a reduction from maximum independent set; this implies non-approximability…

In this paper we show how gauge symmetries in an effective theory can be used to simplify proofs of factorization formulae in highly energetic hadronic processes. We use the soft-collinear effective theory, generalized to deal with…

The direct Gaussian copula model with discrete marginal distributions is an appealing data-analytic tool but poses difficult computational challenges due to its intractable likelihood. A number of approximations/surrogates for the…

We revisit two basic Direct Simulation Monte Carlo Methods to model aggregation kinetics and extend them for aggregation processes with collisional fragmentation (shattering). We test the performance and accuracy of the extended methods and…

Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…

We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error…

Kernel density estimation and kernel regression are powerful but computationally expensive techniques: a direct evaluation of kernel density estimates at $M$ evaluation points given $N$ input sample points requires a quadratic…

Debugging accumulation of floating-point errors is hard; ideally, computer should track it automatically. Here we consider twofold approximation of an exact real with value + error pair of floating-point numbers. Normally, value + error sum…

We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.

Due to the complexity of order statistics, the finite sample behaviour of robust statistics is generally not analytically solvable. While the Monte Carlo method can provide approximate solutions, its convergence rate is typically very slow,…

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

To tackle the exponentiality associated with NP-hard problems, two paradigms have been proposed. First, Branch & Bound, like Dynamic Programming, achieve efficient exact inference but requires extensive information and analysis about the…

For any $\{0,1\}$-valued function $f$, its \emph{$n$-folded XOR} is the function $f^{\oplus n}$ where $f^{\oplus n}(X_1, \ldots, X_n) = f(X_1) \oplus \cdots \oplus f(X_n)$. Given a procedure for computing the function $f$, one can apply a…

In data-driven optimization, sample average approximation (SAA) is known to suffer from the so-called optimizer's curse that causes an over-optimistic evaluation of the solution performance. We argue that a special type of distributionallly…

For a variant of the algorithm in [Pit19] (arXiv:1903.10816) to compute the approximate density or distribution function of a linear mixture of independent random variables known by a finite sample, it is presented a proof of the functional…

This note provides a counterexample to a theorem announced in the last part of the paper ''Analysis of direct searches for discontinuous functions'', Mathematical Programming Vol. 133, pp.~299--325, 2012. The counterexample involves an…

Numerical solutions to fractional differential equations can be extremely computationally intensive due to the effect of non-local derivatives in which all previous time points contribute to the current iteration. In finite difference…

This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…