Related papers: Fooling intersections of low-weight halfspaces

Neutron and proton densities in the nuclear periphery are investigated within (p,n) charge-exchange isobar transitions. For this purpose we have developed parameter-free optical potentials with a detailed treatment of the in-medium…

Let $X$ be a ball quasi-Banach function space on ${\mathbb R}^n$. In this article, assuming that the powered Hardy--Littlewood maximal operator satisfies some Fefferman--Stein vector-valued maximal inequality on $X$ as well as it is bounded…

We give an algorithm that learns arbitrary Boolean functions of $k$ arbitrary halfspaces over $\mathbb{R}^n$, in the challenging distribution-free Probably Approximately Correct (PAC) learning model, running in time $2^{\sqrt{n} \cdot (\log…

Proving super-polynomial size lower bounds for $\textsf{TC}^0$, the class of constant-depth, polynomial-size circuits of Majority gates, is a notorious open problem in complexity theory. A major frontier is to prove that $\textsf{NEXP}$…

In this paper, the intersection of bivariate orthogonal polynomials on triangle patches will be investigated. The result is interesting by its own but also has important applications in the theory of a posteriori error estimation for finite…

The Forster transform is a method of regularizing a dataset by placing it in {\em radial isotropic position} while maintaining some of its essential properties. Forster transforms have played a key role in a diverse range of settings…

We study the algorithmic task of testably learning general Massart halfspaces under the Gaussian distribution. In the testable learning setting, the aim is the design of a tester-learner pair satisfying the following properties: (1) if the…

We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f* of f, such that their difference probably has at most half the number of terms of…

Let $W_i=\{W_i(t), t\in \mathbb{R}_+\}, i=1,2$ be two Wiener processes and $W_3=\{W_3(\mathbf{t}), \mathbf{t}\in \mathbb{R}_+^2\}$ be a two-parameter Brownian sheet, all three processes being mutually independent. We derive upper and lower…

In this manuscript we develop the theory of poset pinball, a combinatorial game recently introduced by Harada and Tymoczko for the study of the equivariant cohomology rings of GKM-compatible subspaces of GKM spaces. Harada and Tymoczko also…

I develop a weight func theory of zero order basis func interpolants and smoothers.**Ch1 Basis funcs and data spaces are defined using wt funcs. Data (native)spaces are used to formulate the variational problems which define our…

We consider a new method for estimating the parameters of univariate Gaussian mixture models. The method relies on a nonparametric density estimator $\hat{f}_n$ (typically a kernel estimator). For every set of Gaussian mixture components,…

Let PG be the Proth-Gilbreath operator that transforms a sequence of integers into the sequence of the absolute values of the differences between all pairs of neighbor terms. Consider the infinite tables obtained by successive iterations of…

Polynomial zonotopes, a non-convex set representation, have a wide range of applications from real-time motion planning and control in robotics, to reachability analysis of nonlinear systems and safety shielding in reinforcement learning.…

In this article, we identify the necessary and sufficient conditions for the existence of a random field solution for some linear s.p.d.e.'s of parabolic and hyperbolic type. These equations rely on a spatial operator $\cL$ given by the…

We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…

Although many programs have been published for fully numerical Hartree--Fock (HF) or density functional (DF) calculations on atoms, we are not aware of any that support hybrid DFs, which are popular within the quantum chemistry community…

In this work, we consider a new type of Fourier-like representation of Boolean function $f\colon\{+1,-1\}^n\to\{+1,-1\}$ \[ f(x) = \cos\left(\pi\sum_{S\subseteq[n]}\phi_S \prod_{i\in S} x_i\right). \] This representation, which we call the…

We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times. We show that…

Let $f = \sum_{k=0}^n \varepsilon_k z^k$ be a random polynomial, where $\varepsilon_0,\ldots ,\varepsilon_n$ are iid standard Gaussian random variables, and let $\zeta_1,\ldots,\zeta_n$ denote the roots of $f$. We show that the point…