Related papers: Linear read-once and related Boolean functions
The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. A principled and practical technique is proposed to linearize and evaluate arbitrary continuous nonlinear functions using…
We give a one-sentence proof that a continuous real-valued function f on a closed, bounded interval attains a maximum value, by the following device. We define x in [a, b] to be a lookout point if f(t) does not exceed f(x) whenever t lies…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
Let $X_1, X_2,\dots$ be a short-memory linear process of random variables. For $1\leq q<2$, let $\cF$ be a bounded set of real-valued functions on $[0,1]$ with finite $q$-variation. It is proved that…
Drift analysis has become a powerful tool to prove bounds on the runtime of randomized search heuristics. It allows, for example, fairly simple proofs for the classical problem how the (1+1) Evolutionary Algorithm (EA) optimizes an…
We study the behavior of linear discriminant functions for binary classification in the infinite-imbalance limit, where the sample size of one class grows without bound while the sample size of the other remains fixed. The coefficients of…
Let $\{X_n;n\ge 1\}$ be a sequence of independent and identically distributed random variables in a regular sub-linear expectation space $(\Omega,\mathscr{H},\widehat{\mathbb E})$ with the finite Choquet expectation, upper mean…
The class of threshold functions is known to be characterizable by functional equations or, equivalently, by pairs of relations, which are called relational constraints. It was shown by Hellerstein that this class cannot be characterized by…
We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…
We study the relative-error property testing model for Boolean functions that was recently introduced in the work of Chen et al. (SODA 2025). In relative-error testing, the testing algorithm gets uniform random satisfying assignments as…
In this paper, we investigate score function-based tests to check the significance of an ultrahigh-dimensional sub-vector of the model coefficients when the nuisance parameter vector is also ultrahigh-dimensional in linear models. We first…
Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…
It was proved few years ago that classes of Boolean functions definable by means of functional equations \cite{EFHH}, or equivalently, by means of relational constraints \cite{Pi2}, coincide with initial segments of the quasi-ordered set…
In general, approximating classes of functions defined over high-dimensional input spaces by linear combinations of a fixed set of basis functions or ``features'' is known to be hard. Typically, the worst-case error of the best basis set…
We estimate large and small values of $|L(\rho',\chi)|$, where $\chi$ is a primitive character mod $q$ for $q>2$ and $\rho'$ runs over critical points of the Riemann zeta function in the right half of the one-line, that is, the points where…
Transcendental functions, such as exponentials and logarithms, appear in a broad array of computational domains: from simulations in curvilinear coordinates, to interpolation, to machine learning. Unfortunately they are typically expensive…
Examples of discontinuous functions already appear in the work of Euler, Abel, Dirichlet, Fourier, and Bolzano. A ground-breaking discovery due to Baire was that many discontinuous functions are well-behaved in that they are the pointwise…
In this paper we investigate the problem of learning an unknown bounded function. We be emphasize special cases where it is possible to provide very simple (in terms of computation) estimates enjoying in addition the property of being…
In this paper we prove a space lower bound of $n^{\Omega(k)}$ for non-deterministic (syntactic) read-once branching programs ({\sc nrobp}s) on functions expressible as {\sc cnf}s with treewidth at most $k$ of their primal graphs. This lower…
Let $\mathscr{F}_{n,d}$ be the class of all functions $f:\{-1,1\}^n\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which…