Related papers: Fooling functions of halfspaces under product dist…
We establish new correlation bounds and pseudorandom generators for a collection of computation models. These models are all natural generalizations of structured low-degree $F_2$-polynomials that we did not have correlation bounds for…
This paper studies the problem of discrepancy estimates for pseudorandom vectors constructed by the elliptic curve congruential generator, particularly in the non-translational case. Two families of results are obtained. First, in a…
One approach to study the pseudorandomness properties of walks on expander graphs is to label the vertices of an expander with elements from an alphabet $\Sigma$, and study the mean of functions over $\Sigma^n$. We say expander walks…
In a recent work, O'Donnell, Servedio and Tan (STOC 2019) gave explicit pseudorandom generators (PRGs) for arbitrary $m$-facet polytopes in $n$ variables with seed length poly-logarithmic in $m,n$, concluding a sequence of works in the last…
An emerging theory of "linear-algebraic pseudorandomness" aims to understand the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspaces plays the role of the size of subsets. In this work, we study…
In this paper, we study learning and testing decision tree of size and depth that are significantly smaller than the number of attributes $n$. Our main result addresses the problem of poly$(n,1/\epsilon)$ time algorithms with…
The paper describes ergodic (with respect to the Haar measure) functions in the class of all functions, which are defined on (and take values in) the ring of p-adic integers, and which satisfy (at least, locally) Lipschitz condition with…
There are many high dimensional function classes that have fast agnostic learning algorithms when assumptions on the distribution of examples can be made, such as Gaussianity or uniformity over the domain. But how can one be confident that…
We present an algorithm for testing halfspaces over arbitrary, unknown rotation-invariant distributions. Using $\tilde O(\sqrt{n}\epsilon^{-7})$ random examples of an unknown function $f$, the algorithm determines with high probability…
We introduce a theory of probability in $\lambda$-rings designed to efficiently describe random variables valued in multisets of complex numbers, varieties over a field, or other similar enriched settings. A key role is played by the…
We introduce a new method for building higher-degree sum-of-squares lower bounds over the hypercube $\mathbf{x} \in \{\pm 1\}^N$ from a given degree 2 lower bound. Our method constructs pseudoexpectations that are positive semidefinite by…
We give the best known pseudorandom generators for two touchstone classes in unconditional derandomization: an $\varepsilon$-PRG for the class of size-$M$ depth-$d$ $\mathsf{AC}^0$ circuits with seed length $\log(M)^{d+O(1)}\cdot…
We study distribution-free property testing and learning problems where the unknown probability distribution is a product distribution over $\mathbb{R}^d$. For many important classes of functions, such as intersections of halfspaces,…
Let $f$ be a Steinhaus random multiplicative function, and for $\alpha\in \mathbb{R}$, let $d_\alpha$ denote the $\alpha$-divisor function. For $\alpha \in (1,2)$ we establish that $$ \mathbb{E}\bigg\{\Big|\frac{1}{\sqrt{x}}\sum_{n\leq x}…
We revisit the fundamental problem of learning with distribution shift, in which a learner is given labeled samples from training distribution $D$, unlabeled samples from test distribution $D'$ and is asked to output a classifier with low…
We prove several new results about bounded uniform and small-bias distributions. A main message is that, small-bias, even perturbed with noise, does not fool several classes of tests better than bounded uniformity. We prove this for…
Expander graphs are among the most useful combinatorial objects in theoretical computer science. A line of work studies random walks on expander graphs for their pseudorandomness against various classes of test functions, including…
We show how quasiprobability distribution functions defined over $N^{2}$-dimensional discrete phase spaces can be used to treat physical systems described by a finite space of states which exhibit spin tunneling effects. This particular…
In this article we apply a recently established transference principle in order to obtain the boundedness of certain functional calculi for semigroup generators. In particular, it is proved that if $-A$ generates a $C_0$-semigroup on a…
There are various notions of quantum pseudorandomness, such as pseudorandom unitaries (PRUs), pseudorandom state generators (PRSGs) and pseudorandom function-like state generators (PRFSGs). Unlike classical pseudorandomness, where different…