幸运pk10_运pk10app【首页下载】

旧版    ENGLISH

其他

当前位置 : 首页  其他  学术活动

One-Bit Low-Tubal-Rank Tensor Recovery

编辑: 时间:2020年09月22日 访问次数:0

题目:One-Bit Low-Tubal-Rank Tensor Recovery

报告人:王建军 教授(西南大学)

时间:2020年9月30日(星期三)下午2:30-3:30

地点:腾讯会议

会议ID:311 282 795

会议密码:310027

摘要:This paper focuses on the recovery of low-tubal-rank tensors from binary measurements based on tensor-tensor product (or t-product) and tensor Singular Value Decomposition (t-SVD). Two types of recovery models are considered, one is the tensor hard singular tube thresholding and the other one is the tensor nuclear norm minimization. In the case no random dither exists in the measurements, our research shows that the direction of tensor $\bm{\mathcal{X}}\in \R^{n_1\times n_2\times n_3}$ with tubal rank $r$ can be well approximated from $\Omega((n_1+n_2)n_3r)$ random Gaussian measurements. In the case nonadaptive dither exists in the measurements, it is proved that both the direction and the magnitude of $\bm{\mathcal{X}}$ can be simultaneously recovered. As we will see, under the nonadaptive measurement scheme, the recovery errors of two reconstruction procedures decay at the rate of polynomial of the oversampling factor $\lambda:=m/(n_1+n_2)n_3r$, i.e., $\mathcal{O}(\lambda^{-1/6})$ and $\mathcal{O}(\lambda^{-1/4})$, respectively. In order to obtain faster decay rate, we introduce a recursive strategy and allow the dithers in quantization to be adaptive to previous measurements for each iterations. Under this quantization scheme, two iterative recovery algorithms are proposed which establish recovery errors decaying at the rate of exponent of the oversampling factor, i.e., $\exp(-\mathcal{O}(\lambda))$. Numerical experiments on both synthetic and real-world data sets are conducted and demonstrate the validity of our theoretical results and the superiority of our algorithms. 

联系人:郭正初(guozhengchu@zju.edu.cn