Related papers: AND Testing and Robust Judgement Aggregation

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a…

Let $n, m$ be positive integers, $n\geq m$. We make several remarks on the relationship between approximate differentiability of higher order and Morse-Sard properties. For instance, among other things we show that if a function…

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

We study the problem of approximating an unknown function $f:\mathbb{R}\to\mathbb{R}$ by a degree-$d$ polynomial using as few function evaluations as possible, where error is measured with respect to a probability distribution $\mu$.…

We consider a problem of multiclass classification, where the training sample $S_n = \{(X_i, Y_i)\}_{i=1}^n$ is generated from the model $\mathbb P(Y = m | X = x) = \eta_m(x)$, $1 \leq m \leq M$, and $\eta_1(x), \dots, \eta_M(x)$ are…

In this article we recover the distribution function (and possible density) of an arbitrary random variable that is subject to an additive measurement error. This problem is also known as deconvolution and has a long tradition in…

In this paper, we examine the hash functions expressed as scalar products, i.e., $f(x)=<v,x>$, for some bounded random vector $v$. Such hash functions have numerous applications, but often there is a need to optimize the choice of the…

In this paper, we study the class ${\Sigma^{(m)}(p)}$ of meromorphic univalent functions $f$ in $\mathbb{D}$ with a pole of order ${m \geq 1}$ at $p \in (0,1)$, admitting a $k$-quasiconformal extension ($0 \leq k < 1$) to…

We study symmetry and quantitative approximate symmetry for an overdetermined problem involving the fractional torsion problem in a bounded domain $\Omega \subset \mathbb R^n$. More precisely, we prove that if the fractional torsion…

In this note we study the growth of \sum_{m=1}^M\frac1{\|m\alpha\|} as a function of M for different classes of \alpha\in[0,1). Hardy and Littlewood showed that for numbers of bounded type, the sum is \simeq M\log M. We give a very simple…

What has become known as Stahl's Theorem in power-engineering circles has been used to justify a convergence guarantee of the Holomorphic Embedding Method (HEM) as it applies to the power-flow problem. In this, the second part of a two-part…

In this paper, we describe an algorithm for approximating functions of the form $f(x)=\int_{a}^{b} x^{\mu} \sigma(\mu) \, d \mu$ over $[0,1]$, where $\sigma(\mu)$ is some signed Radon measure, or, more generally, of the form $f(x) =…

Given a hereditary property of graphs $\mathcal{H}$ and a $p\in [0,1]$, the edit distance function ${\rm ed}_{\mathcal{H}}(p)$ is asymptotically the maximum proportion of edge-additions plus edge-deletions applied to a graph of edge density…

We prove a stability result for general $3$-wise correlations over distributions satisfying mild connectivity properties. More concretely, we show that if $\Sigma,\Gamma$ and $\Phi$ are alphabets of constant size, and $\mu$ is a pairwise…

The Fourier-Walsh expansion of a Boolean function $f \colon \{0,1\}^n \rightarrow \{0,1\}$ is its unique representation as a multilinear polynomial. The Kindler-Safra theorem (2002) asserts that if in the expansion of $f$, the total weight…

For $f$ analytic and close to convex in $D=\{z: |z|< 1\}$, we give sharp estimates for the logarithmic coefficients $\gamma_{n}$ of $f$ defined by $\log \dfrac{f(z)}{z}=2\sum_{n=1}^{\infty} \gamma_{n}z^{n}$ when $n=1, 2,3$.

Confidence bands are confidence sets for an unknown function f, containing all functions within some sup-norm distance of an estimator. In the density estimation, regression, and white noise models, we consider the problem of constructing…

In this paper we prove results regarding Boolean functions with small spectral norm (the spectral norm of f is $\|\hat{f}\|_1=\sum_{\alpha}|\hat{f}(\alpha)|$). Specifically, we prove the following results for functions $f:\{0,1\}^n \to…

Let $\{T^z\}$ be an ergodic action of the group $Z^n$ by automorphisms of the probability space $(X,m)$, $\sum_{i}^\infty a_i<\infty$, $a_i>0$. For any sequence $M_k\to +\infty$ there exist $N_k>M_k$ and a function $ f\in L_1(X,m)$ such…