Linear regression without correspondence
Linear regression without correspondence
复制标题
DOI:
--
复制
发表时间:
2017-05
期刊:
影响因子:
--
通讯作者:
Daniel J. Hsu;K. Shi;Xiaorui Sun
中科院分区:
文献类型:
--
作者:
Daniel J. Hsu;K. Shi;Xiaorui Sun
This article considers algorithmic and statistical aspects of linear regression when the correspondence between the covariates and the responses is unknown. First, a fully polynomial-time approximation scheme is given for the natural least squares optimization problem in any constant dimension. Next, in an average-case and noise-free setting where the responses exactly correspond to a linear function of i.i.d. draws from a standard multivariate normal distribution, an efficient algorithm based on lattice basis reduction is shown to exactly recover the unknown linear function in arbitrary dimension. Finally, lower bounds on the signal-to-noise ratio are established for approximate recovery of the unknown linear function by any estimator.