Related papers: A Counterexample to the Generalized Linial-Nisan C…

Let $p$ be a prime number and $K$ a finite extension of $\mathbb{Q}_p$. We state conjectures on the smooth representations of $\mathrm{GL}_n(K)$ that occur in spaces of mod $p$ automorphic forms (for compact unitary groups). In particular,…

Inference for GP models with non-Gaussian noises is computationally expensive when dealing with large datasets. Many recent inference methods approximate the posterior distribution with a simpler distribution defined on a small number of…

In this article, we provide counterexamples to a conjecture of M. Pellegrini and P. Shumyatsky which states that each coset of the centralizer of an involution in a finite non-abelian simple group $G$ contains an odd order element, unless…

Suppose we are given an oracle that claims to approximate the permanent for most matrices X, where X is chosen from the Gaussian ensemble (the matrix entries are i.i.d. univariate complex Gaussians). Can we test that the oracle satisfies…

We provide guarantees for approximate Gaussian Process (GP) regression resulting from two common low-rank kernel approximations: based on random Fourier features, and based on truncating the kernel's Mercer expansion. In particular, we…

We provide guarantees for approximate Gaussian Process (GP) regression resulting from two common low-rank kernel approximations: based on random Fourier features, and based on truncating the kernel's Mercer expansion. In particular, we…

The existence of the scaling limit and its universality, for correlations between zeros of {\it Gaussian} random polynomials, or more generally, {\it Gaussian} random sections of powers of a line bundle over a compact manifold has been…

Batson's conjecture is a non-orientable version of Milnor's conjecture, which states that the 4-ball genus of a torus knot $T(p,q)$ is equal to $\frac{(p-1)(q-1)}{2}$. Batson's conjecture states that the nonorientable 4-ball genus is equal…

Belief Propagation (BP) is a powerful algorithm for distributed inference in probabilistic graphical models, however it quickly becomes infeasible for practical compute and memory budgets. Many efficient, non-parametric forms of BP have…

In this article, we prove the remaining open cases of the Fontaine-Mazur conjecture on two-dimensional regular Galois representations over $\Gal(\overline{\Q}/\Q)$ when $p=3$, hence concluding the conjecture in the regular case for all odd…

In this paper, we consider estimation and inference for the unknown parameters and function involved in a class of generalized hierarchical models. Such models are of great interest in the literature of neural networks (such as Bauer and…

In this paper, we show that the GVC (generalized vanishing conjecture) holds for the differential operator $\Lambda=(\partial_x-\Phi(\partial_y))\partial_y$ and all polynomials $P(x,y)$, where $\Phi(t)$ is any polynomial over the base…

Reliable outlier detection is critical for real-world deployment of deep learning models. Although extensively studied, likelihoods produced by deep generative models have been largely dismissed as being impractical for outlier detection.…

The polynomial hierarchy has been widely studied in classical complexity theory. In this paper, we will generalize some commonly known results about the polynomial hierarchy to a version of the hierarchy extended to promise problems. This…

This paper studies how well generative adversarial networks (GANs) learn probability distributions from finite samples. Our main results establish the convergence rates of GANs under a collection of integral probability metrics defined…

Set Cover is a classic NP-hard problem; as shown by Slav\'{i}k (1997) the greedy algorithm gives an approximation ratio of $\ln n - \ln \ln n + \Theta(1)$. A series of works by Lund \& Yannakakis (1994), Feige (1998), Moshkovitz (2015) have…

Following the work of Harris and Kudla we prove a more general form of a conjecture of Jacquet relating the non-vanishing of a certain period integral to non-vanishing of the central critical value of a certain $L$-function. As a…

This work generalizes graph neural networks (GNNs) beyond those based on the Weisfeiler-Lehman (WL) algorithm, graph Laplacians, and diffusions. Our approach, denoted Relational Pooling (RP), draws from the theory of finite partial…

We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer $n$, there exists a prime between $n^2$ and $(n+1)^2$. Oppermann's conjecture…

This note contains a plethora of counterexamples to attempts to generalize the results of bi-parameter embedding from $p=2$ case to either $p>2$ or $p<2$. This is in striking difference to $p=2$ case that was fully understood in the series…