相关论文: One Bit Sensing, Discrepancy, and Stolarsky Princi…

Let $D(G)$ be the distance matrix of a simple connected graph $G$. The Hadamard product $D(G)~\circ~ D(G)$ is called the squared distance matrix of $G$, and is denoted by $\Delta(G)$. A simple connected graph is called a starlike block…

The aim of this paper is two-fold: firstly, to present subspace embedding properties for $s$-hashing sketching matrices, with $s\geq 1$, that are optimal in the projection dimension $m$ of the sketch, namely, $m=\mathcal{O}(d)$, where $d$…

Many geometric machine learning and image analysis applications, require a left-invariant metric on the 5D homogeneous space of 3D positions and orientations SE(3)/SO(2). This is done in Equivariant Neural Networks (G-CNNs), or in PDE-Based…

The logarithmic Sobolev inequality for the Hamming cube {0,1}^n states that for any real-valued function f on the cube holds E(f,f) \ge 2 Ent(f^2), where E(f,f) is the appropriate Dirichlet form (also known as "sum of influences"). We show…

We consider the problem of describing the typical (possibly) non-linear code of minimum distance bounded from below over a large alphabet. We concentrate on block codes with the Hamming metric and on subspace codes with the injection…

For a probability measure on a real separable Hilbert space, we are interested in "volume-based" approximations of the d-dimensional least squares error of it, i.e., least squares error with respect to a best fit d-dimensional affine…

This paper presents a performance analysis of the MUltiple SIgnal Classification (MUSIC) algorithm applied on $D$ dimensional single-snapshot spectral estimation while $s$ true frequencies are located on the continuum of a bounded domain.…

An $L(d,1)$-labeling of a graph $G$ is an assignment of nonnegative integers to the vertices such that adjacent vertices receive labels that differ by at least $d$ and those at a distance of two receive labels that differ by at least one,…

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

We show in this note that the Sobolev Discrepancy introduced in Mroueh et al in the context of generative adversarial networks, is actually the weighted negative Sobolev norm $||.||_{\dot{H}^{-1}(\nu_q)}$, that is known to linearize the…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

We study energy integrals and discrete energies on the sphere, in particular, analogs of the Riesz energy with the geodesic distance in place of Euclidean, and observe that the range of exponents for which the uniform distribution optimizes…

We prove that a deformation of a hypersurface in a $(n+1)$-dimensional real space form ${\mathbb S}^{n+1}_{p,1}$ induce a Hamiltonian variation of the normal congruence in the space ${\mathbb L}({\mathbb S}^{n+1}_{p,1})$ of oriented…

We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…

In this paper, we consider recovering $n$ dimensional signals from $m$ binary measurements corrupted by noises and sign flips under the assumption that the target signals have low generative intrinsic dimension, i.e., the target signals can…

The compressive sensing (CS) and 1-bit CS demonstrate superior efficiency in signal acquisition and resource conservation, while 1-bit CS achieves maximum resource efficiency through sign-only measurements. With the emergence of massive…

We give the first computationally tractable and almost optimal solution to the problem of one-bit compressed sensing, showing how to accurately recover an s-sparse vector x in R^n from the signs of O(s log^2(n/s)) random linear measurements…

This paper concerns the problem of 1-bit compressed sensing, where the goal is to estimate a sparse signal from a few of its binary measurements. We study a non-convex sparsity-constrained program and present a novel and concise analysis…

Using the mathematical definitions of deceleration and jerk parameters we obtain a general differential equation for squared Hubble parameter. For a constant jerk, this differential equation leads to an exact function for Hubble parameter.…

Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…