arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2209.01066math.STstat.TH
收藏

混洗总体最小二乘

Shuffled total least squares

Qian Wang, Daniel Sussman

摘要:

在许多对应性恢复问题中,出现了具有混洗标签和具有噪声潜在设计矩阵的线性回归。我们提出了一个总的最小二乘方法来估计潜在的真置换的问题,并提供了一个上界的归一化Procrustes二次损失的估计。我们还提供了一个迭代算法来近似估计,并证明其性能的模拟数据。

英文摘要:

Linear regression with shuffled labels and with a noisy latent design matrix arises in many correspondence recovery problems. We propose a total least-squares approach to the problem of estimating the underlying true permutation and provide an upper bound to the normalized Procrustes quadratic loss of the estimator. We also provide an iterative algorithm to approximate the estimator and demonstrate its performance on simulated data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑