Related papers: All Classical Adversary Methods are Equivalent for…

We investigate quantum corrections to the classical work characteristic function (CF) as a semiclassical approximation to the full quantum work CF. In addition to explicitly establishing the quantum-classical correspondence of the…

We prove that every bounded function $f:\{-1,1\}^n\to[-1,1]$ of degree at most $d$ can be learned with $L_2$-accuracy $\varepsilon$ and confidence $1-\delta$ from $\log(\tfrac{n}{\delta})\,\varepsilon^{-d-1} C^{d^{3/2}\sqrt{\log d}}$ random…

We study robustness to test-time adversarial attacks in the regression setting with $\ell_p$ losses and arbitrary perturbation sets. We address the question of which function classes are PAC learnable in this setting. We show that classes…

The results showing a quantum query complexity of $\Theta(N^{1/3})$ for the collision problem do not apply to random functions. The issues are two-fold. First, the $\Omega(N^{1/3})$ lower bound only applies when the range is no larger than…

For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal…

We introduce a general categorical framework for the definition of weak behavioural equivalences, building on and extending recent results in the field. This framework is based on parametrized saturation categories, i.e. categories whose…

The sensitivity conjecture which claims that the sensitivity complexity is polynomially related to block sensitivity complexity, is one of the most important and challenging problem in decision tree complexity theory. Despite of a lot of…

We use a recently developed method \cite{Costinetal}, \cite{Dubrovin} to find accurate analytic approximations with rigorous error bounds for the classic similarity solution of Blasius of the boundary layer equation in fluid mechanics, the…

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…

Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box functions, we investigate a more general quantum query model…

We study adversarial noisy bandits given a known function class $\mathcal{F}$. In each round, the adversary selects a function $f \in \mathcal{F}$, the learner chooses an arm, and then observes a noisy reward determined by the chosen arm…

In this article, we consider the family of functions $f$ analytic in the unit disk $|z|<1$ with the normalization $f(0)=0=f'(0)-1$ and satisfying the condition $\big |\big (z/f(z)\big )^{2}f'(z)-1\big |<\lambda $ for some $0<\lambda \leq…

For $ -1 \leq B \leq 1$ and $A>B$, let $\mathcal{S}^*[A,B]$ denote the class of generalized Janowski starlike functions consisting of all normalized analytic functions $f$ defined by the subordination $z f'(z)/f(z) \prec (1+ A z)/(1+ B z)$…

We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…

This paper explores a fine-grained version of the Watrous conjecture, including the randomized and quantum algorithms with success probabilities arbitrarily close to $1/2$. Our contributions include the following: i) An analysis of the…

Recent works have shown that the input domain of any machine learning classifier is bound to contain adversarial examples. Thus we can no longer hope to immune classifiers against adversarial examples and instead can only aim to achieve the…

We show that the classical kernel and domain functions associated to an n-connected domain in the plane are all given by rational combinations of three or fewer holomorphic functions of one complex variable. We characterize those domains…

Using present a unified approach, we establish a Kolmogorov type comparison theorem for the classes of $2\pi$-periodic functions defined by a special class of operators having certain oscillation properties, which includes the classical…

Associated Legendre functions of fractional degree appear in the solution of boundary value problems in wedges or in toroidal geometries, and elsewhere in applied mathematics. In the classical case when the degree is half an odd integer,…

This paper presents a comprehensive survey of 18 distinct polynomials and their potential applications in Kolmogorov-Arnold Network (KAN) models as an alternative to traditional spline-based methods. The polynomials are classified into…