相关论文: Local Correction with Constant Error Rate

We provide an approximation algorithm for k-means clustering in the one-round (aka non-interactive) local model of differential privacy (DP). This algorithm achieves an approximation ratio arbitrarily close to the best non private…

We prove that the logarithm of the permanent of an nxn real matrix A and the logarithm of the hafnian of a 2nx2n real symmetric matrix A can be approximated within an additive error 1 > epsilon > 0 by a polynomial p in the entries of A of…

This paper proposes a novel localized Fourier extension method for approximating non-periodic functions via domain segmentation. By partitioning the computational domain into subregions with uniform discretization scales, the method…

In this paper, we introduce a class of functions that assume only a limited number $\lambda$ of values within a given Hamming $\rho$-ball and call them locally $(\rho, \lambda)$-bounded functions. We develop function-correcting codes (FCCs)…

In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…

We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…

An algorithm is given for determining an optimal $b$-step approximation of weighted data, where the error is measured with respect to the $L_\infty$ norm. For data presorted by the independent variable the algorithm takes $\Theta(n + \log n…

We establish the equivalence between the regularity (rectifiability) of sets and suitable estimates on the oscillation of the gradient for smooth non-local distance functions. A prototypical example of such a distance was introduced, as…

We construct a family of closeness functions on the space of finite volume Lorentzian geometries using the abundance of discrete intervals in the underlying random causal sets. Although strictly weaker than a Lorentzian Gromov-Hausdorff…

An approximation, in the sense of $\Gamma$-convergence and in any dimension $d\geq1$, of Griffith-type functionals, with $p-$growth ($p>1$) in the symmetrized gradient, is provided by means of a sequence of non-local integral functionals…

The importance of the Lieb-Simon proof of the relative exactness of Thomas-Fermi theory in the large-Z limit to modern density functional theory (DFT) is explored. The principle, that there is a specific semiclassical limit in which…

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…

To a polynomial $f$ over a non-archimedean local field $K$ and a character $\chi$ of the group of units of the valuation ring of $K$ one associates Igusa's local zeta function $Z(s,f,\chi)$. In this paper, we study the local zeta function…

We show that if $f\colon S_n \to \{0,1\}$ is $\epsilon$-close to linear in $L_2$ and $\mathbb{E}[f] \leq 1/2$ then $f$ is $O(\epsilon)$-close to a union of "mostly disjoint" cosets, and moreover this is sharp: any such union is close to…

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…

For a function $f \colon \{0,1\}^n \to \{0,1\}$, the junta testing problem asks whether $f$ depends on only $k$ variables. If $f$ depends on only $k$ variables, the feature selection problem asks to find those variables. We prove that these…

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…

We show that if $A \subset [k]^n$, then $A$ is $\epsilon$-close to a junta depending upon at most $\exp(O(|\partial A|/(k^{n-1}\epsilon)))$ coordinates, where $\partial A$ denotes the edge-boundary of $A$ in the $\ell^1$-grid. This is sharp…

We consider a family of non-local and non-convex functionals, and we prove that their Gamma-liminf is bounded from below by a positive multiple of the Sobolev norm or the total variation. As a by-product, we answer some open questions…