Related papers: AND Testing and Robust Judgement Aggregation

We study linear function approximation in a finite basis under finite-precision arithmetic. In a highly non-orthogonal basis, certain directions are only weakly represented, so that rounding errors can significantly distort the effectively…

Given a porous compact $K \subset \mathbb{R}^d$ and a continuity modulus $\omega$, we prove a quantitative Jackson-Bernstein type theorem on harmonic approximation. That is, a function $f$ belongs to the class $\mathrm{Lip}_{\omega}(K)$ if…

We introduce the \textit{almost goodness-of-fit} test, a procedure to assess whether a (parametric) model provides a good representation of the probability distribution generating the observed sample. Specifically, given a distribution…

We study the problem of classifier derandomization in machine learning: given a stochastic binary classifier $f: X \to [0,1]$, sample a deterministic classifier $\hat{f}: X \to \{0,1\}$ that approximates the output of $f$ in aggregate over…

A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…

Consider systems of equations $q_i(x)=0$, where $q_i: {\Bbb R}^n \longrightarrow {\Bbb R}$, $i=1, \ldots, m$, are quadratic forms. Our goal is to tell efficiently systems with many non-trivial solutions or near-solutions $x \ne 0$ from…

For a wide range of functions $W\colon\mathbb{N}\to\mathbb{N}$, we establish a general result for estimating weighted averages of the form \[ \mathbb{E}^{W}_{n \le N} f(\vartheta(n))= \frac{1}{W(N)}\sum_{n=1}^N (W(n)-W(n-1))f(\vartheta(n)),…

A structure ${\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi$ (i.e., local…

We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…

Let $k$ be a field, $G$ be an abelian group and $r\in \mathbb N$. Let $L$ be an infinite dimensional $k$-vector space. For any $m\in End_k(L)$ we denote by $r(m)\in [0,\infty ]$ the rank of $m$. We define by $R(G,r,k)\in [0,\infty]$ the…

Let $\R(\cdot)$ stand for the bounded-error randomized query complexity. We show that for any relation $f \subseteq \{0,1\}^n \times \mathcal{S}$ and partial Boolean function $g \subseteq \{0,1\}^n \times \{0,1\}$, $\R_{1/3}(f \circ g^n) =…

We introduce a model of graph-constrained dynamic choice with reinforcement modeled by positively $\alpha$-homogeneous rewards. We show that its empirical process, which can be written as a stochastic approximation recursion with Markov…

Given Boolean functions \( f, g : \mathbb{F}_2^n \to \{-1,+1\} \), we say they are {\em linearly isomorphic} if there exists \( A \in \mathrm{GL}_n(\mathbb{F}_2) \) such that \( f(x)=g(Ax) \) for all \( x \). We study this problem in the…

We study a class of random homogeneous systems. Our main result says that under suitable general assumptions, these systems converge weakly, upon a suitable normalization, to the probability distribution with density $\frac34 \, (1-x^2) \,…

In rank aggregation, the task is to aggregate multiple weighted input rankings into a single output ranking. While numerous methods, so-called social welfare functions (SWFs), have been suggested for this problem, all of the classical SWFs…

Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…

Let $G_1,\dots,G_m$ be independent copies of the standard gaussian random vector in $\mathbb{R}^d$. We show that there is an absolute constant $c$ such that for any $A \subset S^{d-1}$, with probability at least $1-2\exp(-c\Delta m)$, for…

In this note, we continue to highlight some applications of Theorem 1 of [3]. Here is a sample: Let $X$ be an open set in ${\bf C}^n$, $\Omega$ an open convex set in ${\bf C}$ and $f, g : X\to {\bf C}$ two holomorphic functions such that…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

Let $\mathcal{H}$ denote the class of harmonic functions $f$ in $\mathbb{D}:= \{z\in \mathbb{C}:|z| < 1\}$ normalized by $f(0) = 0 = f_z(0) -1$. For $\alpha \geq 0$, we consider the following class $$\mathcal{W}^0_{\mathcal{H}}(\alpha):=…