f_\varepsilon)$
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Boundary-compatible interacting approximations of quasilinear PDEs on bounded domains
arXiv:2606.04049v1 Announce Type: new Abstract: We develop a general operator-theoretic route that turns Kato-type quasilinear evolution systems on a Banach scale $(Z,X)$ into finite-dimensional interacting approximations. The construction proceeds in two steps. First, one introduces a regularized family $(A_\varepsilon,f_\varepsilon)$ indexed by a scale parameter $\varepsilon>0$, for which the drift $A_\varepsilon[t,z]z+f_\varepsilon[t,z]$ takes values in an output space $Y$ suitable for...
ND-TNN: Tensor-Neural-Network Approximation for High-Dimensional Nonlocal Diffusion Models
arXiv:2606.08685v1 Announce Type: new Abstract: We study a numerical method, built on the tensor neural network (TNN) architecture introduced in \cite{wang2022tensor}, for solving nonlocal diffusion models in high-dimensional spaces. The tensor-product structure of the TNN ansatz, combined with the separability of the Gaussian kernel, reduces the high-dimensional integrals in the nonlocal energy to products of low-dimensional integrals, which are evaluated by Gauss--Legendre quadrature;...
A New Class of Linear Codes
arXiv:2401.07986v3 Announce Type: replace Abstract: Let $n$ be a prime power, $r$ be a prime with $r\mid n-1$, and $\varepsilon\in (0,1/2)$. Using the theory of multiplicative character sums and superelliptic curves, we construct new codes over $\mathbb F_r$ having length $n$, relative distance $(r-1)/r+O(n^{-\varepsilon})$ and rate $n^{-1/2-\varepsilon}$. When $r=2$, our binary codes have exponential size when compared to all previously known families of linear and non-linear codes with...
Sort, Partition, Randomize: Optimal Binary Hypothesis Testing under Local Differential Privacy
Announce Type: new Abstract: We study optimal design of $\varepsilon$-locally differentially private mechanisms for binary hypothesis testing. Each observation is drawn from one of two known distributions $P_0,P_1$ on a finite alphabet of size $k$, privatized by a mechanism $Q$, and then used to infer which distribution generated the data. We measure testing utility using an $f$-divergence, including total variation, KL, and hockey-stick divergences, between the two induced output distributions.
On Sketching Trimmed Statistics
Announce Type: replace Abstract: We study sketching trimmed statistics of a frequency vector, including the $F_p$ moment of the top-$k$ coordinates and of the trimmed-$k$ vector. Despite their natural role in robust analytics, this is the first time these problems have been studied in any sublinear space setting. For $p \in [0,2]$, we obtain $poly(\log n/\varepsilon)$-space algorithms for both tasks when $k$ is moderately large, and for general $k$ we identify a sharp structural threshold...