Related papers: Optimal Thresholds for Monotone Non-Boolean Functi…
In this paper, we present a comprehensive study of the monotonicity and log-concavity of the generalized Marcum and Nuttall Q-functions. More precisely, a simple probabilistic method is firstly given to prove the monotonicity of these two…
Given an increasing sequence of integers $x_1,\ldots,x_n$ from a universe $\{0,\ldots,u-1\}$, the monotone minimal perfect hash function (MMPHF) for this sequence is a data structure that answers the following rank queries: $rank(x) = i$ if…
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…
In 1958, Sz\"{u}sz proved an inhomogeneous version of Khintchine's theorem on Diophantine approximation. Sz\"{u}sz's theorem states that for any non-increasing approximation function $\psi:\mathbb{N}\to (0,1/2)$ with $\sum_q \psi(q)=\infty$…
In this paper, we introduce the notion of a $\gamma$-density point for Lebesgue-measurable subsets of $\mathbb{R}$, where $\gamma$ is a modulus function, and study its basic measure-theoretic properties. We show that every $\gamma$-density…
Let $\xi_0,\xi_1,\ldots$ be independent identically distributed complex- valued random variables such that $\mathbb{E}\log(1+|\xi _0|)<\infty$. We consider random analytic functions of the form…
The simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by…
We give the first agnostic, efficient, proper learning algorithm for monotone Boolean functions. Given $2^{\tilde{O}(\sqrt{n}/\varepsilon)}$ uniformly random examples of an unknown function $f:\{\pm 1\}^n \rightarrow \{\pm 1\}$, our…
In the property testing model, the task is to distinguish objects possessing some property from the objects that are far from it. One of such properties is monotonicity, when the objects are functions from one poset to another. This is an…
We introduce a certain variant (or regularization) $\tilde{\Lambda}^\mu_n$ of the standard Christoffel function $\Lambda^\mu_n$ associated with a measure $\mu$ on a compact set $\Omega\subset \mathbb{R}^d$. Its reciprocal is now a…
The spectral norm of a Boolean function $f:\{0,1\}^n \to \{-1,1\}$ is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning…
In this paper, we study the problem of monotone (weakly) DR-submodular continuous maximization. While previous methods require the gradient information of the objective function, we propose a derivative-free algorithm LDGM for the first…
In this paper we present several new classes of logarithmically completely monotonic functions. Our functions have in common that they are defined in terms of the $q-$gamma and $q-$digamma functions. As an applications of this results, some…
We establish analogs of Cheeger's inequality for probability measures with heavy tails. As one of the principal applications, suppose $\lambda > 3$ and define the (Pareto) probability measure $\mu_{\lambda}$ on $[1,\infty)$ by…
Consider a complete asymptotically flat 3-manifold $M$ with non-negative scalar curvature and non-empty minimal boundary $\Sigma$. Fix a number $1 < p < 3$. We derive monotone quantities for $p$-harmonic functions on $M$ which become…
The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…
The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ is defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…
The multilinear framework has achieved the breakthrough $1-1/e$ approximation for maximizing a monotone submodular function subject to a matroid constraint. This framework has a continuous optimization part and a rounding part. We extend…
We consider the problem of multi-objective maximization of monotone submodular functions subject to cardinality constraint, often formulated as $\max_{|A|=k}\min_{i\in\{1,\dots,m\}}f_i(A)$. While it is widely known that greedy methods work…
We present the first efficient averaging sampler that achieves asymptotically optimal randomness complexity and near-optimal sample complexity. For any $\delta < \varepsilon$ and any constant $\alpha > 0$, our sampler uses $m + O(\log (1 /…