Related papers: The Compression method and applications
It was recently shown that the lossless compression of a single source $X^n$ is achievable with a notion of strong locality; any $X_i$ can be decoded from a constant number of compressed bits, with a vanishing in $n$ probability of error.…
Compression of floating-point data, both lossy and lossless, is a topic of increasing interest in scientific computing. Developing and evaluating suitable compression algorithms requires representative samples of data from real-world…
The paper studies compactness properties of the affine Sobolev inequality of Gaoyong Zhang et al in the case $p=2$, and existence and regularity of related minimizers, in particular, solutions to the nonlocal Dirichlet problems \[…
Let A be finite set equipped with a probability distribution P, and let M be a "mass" function on A. A characterization is given for the most efficient way in which A^n can be covered using spheres of a fixed radius. A covering is a subset…
What happens when multiple compression methods are combined-does the order in which they are applied matter? Joint model compression has emerged as a powerful strategy to achieve higher efficiency by combining multiple methods such as…
In applications it is common that the exact form of a conditional expectation is unknown and having flexible functional forms can lead to improvements. Series method offers that by approximating the unknown function based on $k$ basis…
This paper is motivated by Davenport's problem and the subsequent work regarding badly approximable points in submanifolds of a Euclidian space. We study the problem in the area of twisted Diophantine approximation and present two different…
A compression function is a map that slims down an observational set into a subset of reduced size, while preserving its informational content. In multiple applications, the condition that one new observation makes the compressed set change…
We consider stationary $p$-Schr\"odinger equations on the whole space with integrable data and potentials that are confining in measure. We introduce asymptotic energy solutions in an asymptotic $L^p$ framework and establish existence and…
In this paper we characterize surjective isometries on certain classes of non-commutative spaces associated with semi-finite von Neumann algebras: the Lorentz spaces $L^{w,1}$, as well as the spaces $L^1+L^\infty$ and $L^1\cap L^\infty$.…
Let $X$ be a set of $n$ points of norm at most $1$ in the Euclidean space $R^k$, and suppose $\varepsilon>0$. An $\varepsilon$-distance sketch for $X$ is a data structure that, given any two points of $X$ enables one to recover the square…
In this short note, we prove a version of the Johnson-Lindenstrauss flattening Lemma for point sets taking values in discrete subgroups. More precisely, given $d,\lambda_0,N_0\in\mathbb{N}$ and $\epsilon\in \left(0,\frac{1}{2}\right)$…
In this work we introduce the concept of a sub-space decomposition, subject to a partition of the coordinates. Considering metrics determined by partial orders in the set of coordinates, the so called poset metrics, we show the existence of…
A change of the prevalent supervised learning techniques is foreseeable in the near future: from the complex, computational expensive algorithms to more flexible and elementary training ones. The strong revitalization of randomized…
In this paper, we develop a general method for estimating correlations of the forms \begin{align} \sum \limits_{n\leq x}G(n)G(x-n)\nonumber \end{align} and \begin{align} \sum \limits_{n\leq x}G(n)G(n+l)\nonumber \end{align} for a fixed…
We consider the reconstruction problem in compressed sensing in which the observations are recorded in a finite number of bits. They may thus contain quantization errors (from being rounded to the nearest representable value) and saturation…
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…
In this paper we study various Rogers-Shephard type inequalities for the lattice point enumerator $\mathrm{G}_{n}(\cdot)$ on $\mathbb{R}^n$. In particular, for any non-empty convex bounded sets $K,L\subset\mathbb{R}^n$, we show that…
In 1866, Charles Ludwidge Dodgson published a paper concerning a method for evaluating determinants called the condensation method. His paper documented a new method to calculate determinants that was based on Jacobi's Theorem. The…
We deal with a weakly coupled system of ODEs of the type $$ x_j'' + n_j^2 \,x_j + h_j(x_1,\ldots,x_d) = p_j(t), \qquad j=1,\ldots,d, $$ with $h_j$ locally Lipschitz continuous and bounded, $p_j$ continuous and $2\pi$-periodic, $n_j \in…