Low-Tubal-Rank Tensor Recovery From One-Bit Measurements

This paper focuses on the recovery of low-tubal-rank tensors from binary measurements under the frame of tensor Singular Value Decomposition. We show that the direction of a tubal-rank-r tensor X ∈ ℝ
^n1×n2×n3
can be approximated from Ω((n
₁
+ n
₂
)n
₃
r) random Gaussian measurements. In addition, incorporating nonadaptive thresholds in the measurements, it is proved that the full X can be recovered. As we will see, under this nonadaptive measurement scheme, recovery errors decay at the rate of polynomial of the oversampling factor λ := m/(n
₁
+ n
₂
)n
₃
r, i.e., O(λ
^-1/6
). In order to obtain faster decay rate, we introduce a recursive strategy which generates thresholds according to previous estimates for each iteration. Under this quantization scheme, An iterative recovery algorithm is proposed which establishes recovery errors decaying at the rate of exponent of λ. Numerical experiments are conducted to demonstrate our results.