Related papers: On the probability of Boolean functions of events …
Dominant areas of computer science and computation systems are intensively linked to the hypercube-related studies and interpretations. This article presents some transformations and analytics for some example algorithms and Boolean domain…
We introduce and study finite $d$-volumes - the high dimensional generalization of finite metric spaces. Having developed a suitable combinatorial machinery, we define $\ell_1$-volumes and show that they contain Euclidean volumes and…
Given strong uniqueness for an It\^o's stochastic equation, we prove that its solution can beconstructed on "any" probability space by using, for example, Euler's polygonal approximations. Stochastic equations in $\mathbb{R}^{d}$ and in…
We introduce novel high order well-balanced finite volume methods for the full compressible Euler system with gravity source term. They require no a priori knowledge of the hydrostatic solution which is to be well-balanced and are not…
Weighted cone-volume functionals are introduced for the convex polytopes in $\mathbb{R}^n$. For these functionals, geometric inequalities are proved and the equality conditions are characterized. A variety of corollaries are derived,…
An infinite family of classical superintegrable Hamiltonians defined on the N-dimensional spherical, Euclidean and hyperbolic spaces are shown to have a common set of (2N-3) functionally independent constants of the motion. Among them, two…
The N-jettiness event shape divides phase space into N+2 regions, each containing one jet or beam. Using a geometric measure these regions correspond to jets with circular boundaries. We give a factorization theorem for the cross section…
We study the problem of learning a high-density region of an arbitrary distribution over $\mathbb{R}^d$. Given a target coverage parameter $\delta$, and sample access to an arbitrary distribution $D$, we want to output a confidence set $S…
Bayesian optimisation (BO) has been a successful approach to optimise functions which are expensive to evaluate and whose observations are noisy. Classical BO algorithms, however, do not account for errors about the location where…
We exploit the standard inner product of Euclidean space to provide a new direction from which one can understand and analyze certain voting methods. Using this perspective along with the action of the symmetric and special orthogonal…
Union volume estimation is a classical algorithmic problem. Given a family of objects $O_1,\ldots,O_n \subseteq \mathbb{R}^d$, we want to approximate the volume of their union. In the special case where all objects are boxes (also known as…
We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…
We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this…
A new representation is proposed for functions in a Sobolev space with dominating mixed smoothness on an $N$-dimensional hyperrectangle. In particular, it is shown that these functions can be expressed in terms of their highest-order mixed…
Boolean optimization finds a wide range of application domains, that motivated a number of different organizations of Boolean optimizers since the mid 90s. Some of the most successful approaches are based on iterative calls to an NP oracle,…
We calculate Euclidean correlation functions through next-to-leading order in the low energy effective theory of gravity. We focus on correlation functions of curvature and volume operators, calculating these functions through one-loop…
We propose a Bayesian optimization algorithm for objective functions that are sums or integrals of expensive-to-evaluate functions, allowing noisy evaluations. These objective functions arise in multi-task Bayesian optimization for tuning…
The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like "item $i$ is closer to item $j$ than item $k$". Ordinal constraints like…
The incorporation of priors in the Optimal Uncertainty Quantification (OUQ) framework \cite{OSSMO:2011} reveals brittleness in Bayesian inference; a model may share an arbitrarily large number of finite-dimensional marginals with, or be…
Bayesian Optimization (BO) is a method for globally optimizing black-box functions. While BO has been successfully applied to many scenarios, developing effective BO algorithms that scale to functions with high-dimensional domains is still…