Related papers: LSM is not generated by binary functions
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different…
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial…
An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base…
We show that there is a largely unexplored class of functions (positive polymatroids) that can define proper discrete metrics over pairs of binary vectors and that are fairly tractable to optimize over. By exploiting submodularity, we are…
Notions of ordinal submodularity/supermodularity have been introduced and studied in the literature. We consider several classes of ordinally submodular functions defined on finite Boolean lattices and give characterizations of the set of…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
In 2014, Voronov introduced the notion of thick morphisms of (super)manifolds as a tool for constructing $L_{\infty}$-morphisms of homotopy Poisson algebras. Thick morphisms generalise ordinary smooth maps, but are not maps themselves.…
Unary theta functions have played a significant role in the theory of holomorphic modular forms and modular $L$-functions. A partial theta functions is defined analogously, but the sum is over part of the integer lattice. Such sums fail to…
Binary code summarization, while invaluable for understanding code semantics, is challenging due to its labor-intensive nature. This study delves into the potential of large language models (LLMs) for binary code comprehension. To this end,…
A single two-input gate suffices for all of Boolean logic in digital hardware. No comparable primitive has been known for continuous mathematics: computing elementary functions such as sin, cos, sqrt, and log has always required multiple…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
Let X be a non-empty set and U a ring of subsets of X. The countable additive functions U->{0,1} are called measures. The paper gives some definitions (derivable measures, the Lebesgue-Stieltjes measures) and properties of these functions,…
We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…
Let $X$ be a Banach space, let $(\Omega,\mu)$ be a $\sigma$-finite measure space and let $A,B\colon\Omega\to B(X)$ be strongly measurable $\gamma$-bounded functions. We show that for all $x\in X$ and all $x^*\in X^*$, there exist a Hilbert…
We consider the problem of directly optimizing a non-linear function of an outcome, where this outcome itself is the sum of many small contributions. The non-linearity of the function means that the problem is not equivalent to the…
Combinatorial algorithms for minimization of functions of many variables, which take their values in finite totally ordered sets, are developed. For that the decomposition of the functions by Boolean polynomials is used. The modified SFM…
Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…
We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs,…
Kolmogorov complexity measures the algorithmic complexity of a finite binary string $\sigma$ in terms of the length of the shortest description $\sigma^*$ of $\sigma$. Traditionally, the length of a string is taken to measure the amount of…
Motivated by practical applications, recent works have considered maximization of sums of a submodular function $g$ and a linear function $\ell$. Almost all such works, to date, studied only the special case of this problem in which $g$ is…