Related papers: Local Correction of Juntas
Many interesting functions arising in applications map into Riemannian manifolds. We present an algorithm, using the manifold exponential and logarithm, for approximating such functions. Our approach extends approximation techniques for…
We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…
A local Tb theorem is an L^2 boundedness criterion by which the question of the global behavior of an operator is reduced to its local behavior, acting on a family of test functions b_Q indexed by the dyadic cubes. We present several…
We present a scalable algorithm for the individually fair ($p$, $k$)-clustering problem introduced by Jung et al. and Mahabadi et al. Given $n$ points $P$ in a metric space, let $\delta(x)$ for $x\in P$ be the radius of the smallest ball…
A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…
In this work, we study the existence of local solutions in $\mathbb{R}^{n}$ to $k$-Hessian equation,for which the nonhomogeneous term $f$ is permitted to change the sign or be non negative; if $f$ is $C^\infty,$ so is the local solution. We…
Q-learning is widely used algorithm in reinforcement learning community. Under the lookup table setting, its convergence is well established. However, its behavior is known to be unstable with the linear function approximation case. This…
We consider the problems of testing and learning an $n$-qubit $k$-local Hamiltonian from queries to its evolution operator with respect the 2-norm of the Pauli spectrum, or equivalently, the normalized Frobenius norm. For testing whether a…
We will show that if there exists a quantum query algorithm that exactly computes some total Boolean function f by making T queries, then there is a classical deterministic algorithm A that exactly computes f making O(T^3) queries. The best…
We show that a Boolean degree $d$ function on the slice $\binom{[n]}{k} = \{ (x_1,\ldots,x_n) \in \{0,1\} : \sum_{i=1}^n x_i = k \}$ is a junta, assuming that $k,n-k$ are large enough. This generalizes a classical result of Nisan and…
We say that a function $f\in C[a,b]$ is $q$-monotone, $q\ge3$, if $f\in C^{q-2}(a,b)$ and $f^{(q-2)}$ is convex in $(a,b)$. Let $f$ be continuous and $2\pi$-periodic, and change its $q$-monotonicity finitely many times in $[-\pi,\pi]$. We…
A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$, if it minimizes the probability that $f(X^{n})\neq g(Y^{n})$ among all functions, where $X^{n}$ is uniform over the Hamming cube and $Y^{n}$ is…
We proceed here with our systematic study, initiated in [3], of multiscale problems with defects, within the context of homogenization theory. The case under consideration here is that of a diffusion equation with a diffusion coefficient of…
We show that if $Q$ is a closed, reduced, complex orbifold of dimension $n$ such that every local group acts as a subgroup of $SU(2) < SU(n)$, then the $K$-theory of the unique crepant resolution of $Q$ is isomorphic to the orbifold…
A locally testable language L is a language with the property that for some non negative integer k, called the order of local testability, whether or not a word u is in the language L depends on (1) the prefix and suffix of the word u of…
Local search is a widely used technique for tackling challenging optimization problems, offering significant advantages in terms of computational efficiency and exhibiting strong empirical behavior across a wide range of problem domains. In…
We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…
We provide a procedure to determine if a given nonlocal operator in a large N holographic CFT is dual to a local bulk operator on the geometry associated with a particular code subspace of the CFT. This procedure does not presuppose…
The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…
We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #k-SAT for any k >=…