Related papers: One Bit Sensing, Discrepancy, and Stolarsky Princi…

Distribution matching (DM) transforms independent and Bernoulli(1/2) distributed bits into a sequence of output symbols with a desired distribution. A fixed-to-fixed length, invertible DM architecture based on shell mapping is presented. It…

Let $D$ be a strongly connected directed graph of order $n\geq 4$ which satisfies the following condition (*): for every pair of non-adjacent vertices $x, y$ with a common in-neighbour $d(x)+d(y)\geq 2n-1$ and $min \{ d(x), d(y)\}\geq n-1$.…

In this paper, a parametrization describing the kinematical state of the universe via cosmographic approach is considered, where the minimum input is the assumption of the cosmological principle, i.e. the Friedmann-Robertson-Walker metric.…

We give an embedding of the Poincar\'e halfspace $H^D$ into a discrete metric space based on a binary tiling of $H^D$, with additive distortion $O(\log D)$. It yields the following results. We show that any subset $P$ of $n$ points in $H^D$…

Motivated by the problem of compressing point sets into as few bits as possible while maintaining information about approximate distances between points, we construct random nonlinear maps $\varphi_\ell$ that compress point sets in the…

We extend the results of our recent preprint [arXiv: 1811.00515] into higher dimensions $n \geq 4$. For minimizing harmonic maps $u\in W^{1,2}(\Omega,\mathbb{S}^2)$ from $n$-dimensional domains into the two dimensional sphere we prove: (1)…

We study the harmonic measure (i.e. the limit of the hitting distribution of a simple random walk starting from a distant point) on three canonical two-dimensional lattices: the square lattice $\mathbb{Z}^2$, the triangular lattice…

This paper studies the stability of some reconstruction algorithms for compressed sensing in terms of the bit precision. Considering the fact that practical digital systems deal with discretized signals, we motivate the importance of the…

We consider the problem of estimating the mean of a normal distribution under the following constraint: the estimator can access only a single bit from each sample from this distribution. We study the squared error risk in this estimation…

This paper studies the problem of deciding on the absence (i.e., null hypothesis, $\mathcal{H}_0$) or presence (i.e., alternative hypothesis, $\mathcal{H}_1$) of an unknown signal embedded in the received signal in a multiple-input,…

Identifying low-dimensional structure in high-dimensional probability measures is an essential pre-processing step for efficient sampling. We introduce a method for identifying and approximating a target measure $\pi$ as a perturbation of a…

The {\em discrepancy} of a matrix $M \in \mathbb{R}^{d \times n}$ is given by $\mathrm{DISC}(M) := \min_{\boldsymbol{x} \in \{-1,1\}^n} \|M\boldsymbol{x}\|_\infty$. An outstanding conjecture, attributed to Koml\'os, stipulates that…

One-bit compressive sensing (CS) is an advanced version of sparse recovery in which the sparse signal of interest can be recovered from extremely quantized measurements. Namely, only the sign of each measurement is available to us. In many…

Deep distance metric learning (DDML), which is proposed to learn image similarity metrics in an end-to-end manner based on the convolution neural network, has achieved encouraging results in many computer vision tasks.$L2$-normalization in…

The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse signals. Practical ADCs not only sample but also quantize each…

We present a cosmographic study designed to test the simplest type of accelerating cosmology: a flat universe with matter and a cosmological constant ($\Lambda$). Hubble series expansions are fit to the SCP Union2.1 supernova data set to…

We study the small-mass limit, also known as the Smoluchowski-Kramers diffusion approximation (see \cite{kra} and \cite{smolu}), for a system of stochastic damped wave equations, whose solution is constrained to live in the unitary sphere…

Recently, the 1-bit compressive sensing (1-bit CS) has been studied in the field of sparse signal recovery. Since the amplitude information of sparse signals in 1-bit CS is not available, it is often the support or the sign of a signal that…

One-bit compressed sensing (1bCS) is an extremely quantized signal acquisition method that has been proposed and studied rigorously in the past decade. In 1bCS, linear samples of a high dimensional signal are quantized to only one bit per…

Information distances like the Hellinger distance and the Jensen-Shannon divergence have deep roots in information theory and machine learning. They are used extensively in data analysis especially when the objects being compared are high…