Related papers: Low-Degree Testing Over Grids

We get a new multiplicity result for gradient systems. Here is a very particular corollary: Let $\Omega\subset {\bf R}^n$ ($n\geq 2$) be a smooth bounded domain and let $\Phi:{\bf R}^2\to {\bf R}$ be a $C^1$ function, with $\Phi(0,0)=0$,…

Let $m,n\geq 1$ are integers and $D$ be a domain in the $$ $\mathbb C^n$ or in the $m$-dimensional real space $\mathbb R^m$. We build positive subharmonic functions on $D$ vanishing on the boundary $\partial D$ of $D$. We use such (test)…

The Local Computation Algorithm (LCA) model is a popular model in the field of sublinear-time algorithms that measures the complexity of an algorithm by the number of probes the algorithm makes in the neighborhood of one node to determine…

Given a class $\mathcal G$ of graphs, let ${\mathcal G}_n$ denote the set of graphs in $\mathcal G$ on vertex set $[n]$. For certain classes $\mathcal G$, we are interested in the asymptotic behaviour of a random graph $R_n$ sampled…

Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…

Satisfiability Modulo the Theory of Nonlinear Real Arithmetic, SMT(NRA) for short, concerns the satisfiability of polynomial formulas, which are quantifier-free Boolean combinations of polynomial equations and inequalities with integer…

Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained…

In the $t$-online-erasure model in property testing, an adversary is allowed to erase $t$ values of a queried function for each query the tester makes. This model was recently formulated by Kalemaj, Raskhodnikova andVarma, who showed that…

Let F be a function field in one variable over a p-adic field and D a central division algebra over F of degree n coprime to p. We prove that Suslin invariant detects whether an element in F is a reduced norm. This leads to a local-global…

We consider speeding up stochastic gradient descent (SGD) by parallelizing it across multiple workers. We assume the same data set is shared among $n$ workers, who can take SGD steps and coordinate with a central server. Unfortunately, this…

We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…

This work studies distributed algorithms for locally optimal load-balancing: We are given a graph of maximum degree $\Delta$, and each node has up to $L$ units of load. The task is to distribute the load more evenly so that the loads of…

A smooth rigidity inequalitiy provides an explicit lower bound for the $(d+1)$-st derivatives of a smooth function $f$, which holds, if $f$ exhibits certain patterns, forbidden for polynomials of degree $d$. The main goal of the present…

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there…

In hypothesis testing problems the property of strict unbiasedness describes whether a test is able to discriminate, in the sense of a difference in power, between any distribution in the null hypothesis space and any distribution in the…

Population risk is always of primary interest in machine learning; however, learning algorithms only have access to the empirical risk. Even for applications with nonconvex nonsmooth losses (such as modern deep networks), the population…

The paper describes a framework for multi-function system testing. Multi-function system testing is considered as fusion (or revelation) of clique-like structures. The following sets are considered: (i) subsystems (system parts or units /…

Modern surveys have provided the astronomical community with a flood of high-dimensional data, but analyses of these data often occur after their projection to lower-dimensional spaces. In this work, we introduce a local two-sample…

A class of graphs is structurally nowhere dense if it can be constructed from a nowhere dense class by a first-order transduction. Structurally nowhere dense classes vastly generalize nowhere dense classes and constitute important examples…

Eleven density functionals are compared with regard to their performance for the lattice constants of solids. We consider standard functionals, such as the local-density approximation and the Perdew-Burke-Ernzerhof (PBE)…