Abstract

Consider the rank-1 spiked model: X=νξu+Z\bf{X}=\sqrtνξ\bf{u}+ \bf{Z}, where νν is the spike intensity, u∈Sk−1\bf{u}\in\mathbb{S}^{k-1} is an unknown direction and ξ∼N(0,1),Z∼N(0,I)ξ\sim \mathcal{N}(0,1),\bf{Z}\sim \mathcal{N}(\bf{0},\bf{I}). Motivated by recent advances in analog-to-digital conversion, we study the problem of recovering u∈Sk−1\bf{u}\in \mathbb{S}^{k-1} from nn i.i.d. modulo-reduced measurements Y=[X]mod  Δ\bf{Y}=[\bf{X}]\mod Δ, focusing on the high-dimensional regime (k≫1k\gg 1). We develop and analyze an algorithm that, for most directions u\bf{u} and ν=poly(k)ν=\mathrm{poly}(k), estimates u\bf{u} to high accuracy using n=poly(k)n=\mathrm{poly}(k) measurements, provided that Δ≳log⁡kΔ\gtrsim \sqrt{\log k}. Up to constants, our algorithm accurately estimates u\bf{u} at the smallest possible ΔΔ that allows (in an information-theoretic sense) to recover X\bf{X} from Y\bf{Y}. A key step in our analysis involves estimating the probability that a line segment of length ≈ν\approx\sqrtν in a random direction u\bf{u} passes near a point in the lattice ΔZkΔ\mathbb{Z}^k. Numerical experiments show that the developed algorithm performs well even in a non-asymptotic setting.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.