Related papers: Optimal Testing of Reed-Muller Codes
Given a posimodular function $f: 2^V \to \mathbb{R}$ on a finite set $V$, we consider the problem of finding a nonempty subset $X$ of $V$ that minimizes $f(X)$. Posimodular functions often arise in combinatorial optimization such as…
We consider the semi-classical generalized Freud weight function \[w_{\lambda}(x;t) = |x|^{2\lambda+1}\exp(-x^4 +tx^2),\qquad x\in\mathbb{R},\] with $ \lambda>-1$ and $t\in\mathbb{R}$ parameters. We analyze the asymptotic behavior of the…
In this paper, we consider the problem of simultaneous testing of multivariate normal means under arbitrary covariance dependence. Specifically, let $\boldsymbol{X}\sim N_n(\boldsymbol{\theta},\boldsymbol{\Sigma})$, where…
The degree-$d$ Chow parameters of a Boolean function $f: \{-1,1\}^n \to \mathbb{R}$ are its degree at most $d$ Fourier coefficients. It is well-known that degree-$d$ Chow parameters uniquely characterize degree-$d$ polynomial threshold…
This paper establishes the equivalence of the Aubin property and the strong regularity for generalized equations over $C^2$-cone reducible sets. This result resolves a long-standing question in variational analysis and extends the…
We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
It was conjectured by Bergelson, Tao, and Ziegler \cite{btz} that every Host--Kra $\F_p^\omega$-system of order $k$ is an Abramov system of order $k$. This conjecture has been verified for $k \leq p+1$. In this paper we show that the…
In monotone submodular function maximization, approximation guarantees based on the curvature of the objective function have been extensively studied in the literature. However, the notion of curvature is often pessimistic, and we rarely…
Let $d_1,...,d_r$ be positive integers and let $I = (F_1,...,F_r)$ be an ideal generated by general forms of degrees $d_1,...,d_r$, respectively, in a polynomial ring $R$ with $n$ variables. When all the degrees are the same we give a…
This manuscript considers the problem of learning a random Gaussian network function using a fully connected network with frozen intermediate layers and trainable readout layer. This problem can be seen as a natural generalization of the…
Kernel methods give powerful, flexible, and theoretically grounded approaches to solving many problems in machine learning. The standard approach, however, requires pairwise evaluations of a kernel function, which can lead to scalability…
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…
Consider the problem of testing $s$ hypotheses simultaneously. The usual approach restricts attention to procedures that control the probability of even one false rejection, the familywise error rate (FWER). If $s$ is large, one might be…
The F5 algorithm is generally believed as one of the fastest algorithms for computing Gr\"{o}bner bases. However, its termination problem is still unclear. Recently, an algorithm GVW and its variant GVWHS have been proposed, and their…
We give an efficient algorithm to strongly refute \emph{semi-random} instances of all Boolean constraint satisfaction problems. The number of constraints required by our algorithm matches (up to polylogarithmic factors) the best-known…
We study the complexity of Gr\"obner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We give a bound on the number of polynomials of degree $d$…
We study the density of the weights of Generalized Reed--Muller codes. Let $RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$ variables of total degree at most $r$. We consider the case of fixed degree $r$, when we…
We prove that there is a constant $C\leq 6.614$ such that every Boolean function of degree at most $d$ (as a polynomial over $\mathbb{R}$) is a $C\cdot 2^d$-junta, i.e. it depends on at most $C\cdot 2^d$ variables. This improves the $d\cdot…
This is a short survey about the theory of stable polynomials and its applications. It gives self-contained proofs of two theorems of Schrijver. One of them asserts that for a $d$--regular bipartite graph $G$ on $2n$ vertices, the number of…