Related papers: All Classical Adversary Methods are Equivalent for…

Let $A$ be a unital operator algebra. Let us assume that every {\it bounded\/} unital homomorphism $u\colon \ A\to B(H)$ is similar to a {\it contractive\/} one. Let $\text{\rm Sim}(u) = \inf\{\|S\|\, \|S^{-1}\|\}$ where the infimum runs…

Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…

We prove that, for any closed semialgebraic subset $W$ of $\mathbb{R}^n$ and for any positive integer $p$, there exists a Nash function $f:\mathbb{R}^n\setminus W\longrightarrow (0, \infty)$ which is equivalent to the distance function from…

For a class of competition-diffusion nonlinear systems involving fractional powers of the Laplacian, including as a special case the fractional Gross-Pitaevskii system, we prove that uniform boundedness implies H\"older boundedness for…

We establish a locally uniform a priori bound on the dynamics of a rational function $f$ of degree $>1$ on the Berkovich projective line over an algebraically closed field of any characteristic that is complete with respect to a non-trivial…

We give a constructive procedure to check basicness of open (or closed) semialgebraic sets in a compact, non singular, real algebraic surface $X$. It is rather clear that if a semialgebraic set $S$ can be separated from each connected…

$\newcommand{\sp}{\mathsf{sparsity}}\newcommand{\s}{\mathsf{s}}\newcommand{\al}{\mathsf{alt}}$ The well-known Sensitivity Conjecture states that for any Boolean function $f$, block sensitivity of $f$ is at most polynomial in sensitivity of…

We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of Ambainis, and shows that van Dam's oracle interrogation is…

Deep neural networks have been applied in many computer vision tasks and achieved state-of-the-art performance. However, misclassification will occur when DNN predicts adversarial examples which add human-imperceptible adversarial noise to…

Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…

In this short note we prove the logarithmic Sobolev inequality with derivatives of fractional order on $\mathbb{R}^n$ with an explicit expression for the constant. Namely, we show that for all $0<s<\frac{n}{2}$ and $a>0$ we have the…

We theoretically analyse the limits of robustness to test-time adversarial and noisy examples in classification. Our work focuses on deriving bounds which uniformly apply to all classifiers (i.e all measurable functions from features to…

We show that the response, frozen and semifreddo fractional susceptibility functions of certain real-analytic unimodal families, at Misiurewicz parameters and for fractional differentiation index $0\le\eta<1/2$, are holomorphic on a disk of…

We prove a generalization of the parallel adversary method to multi-valued functions, and apply it to prove that there is no parallel quantum advantage for approximate counting.

We derive bounds for a notion of adversarial risk, designed to characterize the robustness of linear and neural network classifiers to adversarial perturbations. Specifically, we introduce a new class of function transformations with the…

It is a known phenomenon that adversarial robustness comes at a cost to natural accuracy. To improve this trade-off, this paper proposes an ensemble approach that divides a complex robust-classification task into simpler subtasks.…

Based on a recent characterization of nested canalyzing function (NCF), we obtain the formula of the sensitivity of any NCF. Hence we find that any sensitivity of NCF is between $\frac{n+1}{2}$ and $n$. Both lower and upper bounds are…

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…

It is known since the work of [AA14] that for any permutation symmetric function $f$, the quantum query complexity is at most polynomially smaller than the classical randomized query complexity, more precisely that $R(f) =…

We establish an equivalence between two classes of methods for solving fractional diffusion problems, namely, Reduced Basis Methods (RBM) and Rational Krylov Methods (RKM). In particular, we demonstrate that several recently proposed RBMs…