arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.12772stat.MLcs.LGmath.OC
收藏

基于矩阵优化的离群点欧氏嵌入算法

Matrix optimization based Euclidean embedding with outliers

College of Applied Sciences, Beijing University of Technology(北京工业大学应用数理学院);Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院应用数学研究所)

Qian Zhang, Xinyuan Zhao, Chao Ding

摘要:

从含有离群误差的噪声观测值中进行欧氏嵌入是统计学和机器学习中一个重要而又具有挑战性的问题。由于缺乏检测能力,许多现有的方法将与离群值作斗争。在本文中,我们提出了一个矩阵优化的嵌入模型,可以产生可靠的嵌入和识别离群值联合。我们表明,所提出的方法得到的估计满足非渐近的风险界,这意味着该模型提供了一个高精度估计高概率时,样本量的顺序大致是自由度的对数因子。此外,我们证明了在一些温和的条件下,该模型也可以识别离群值没有任何先验信息的高概率。最后,数值实验表明,基于矩阵优化的模型可以产生高质量的配置,并成功地识别离群值,即使是大型网络。

英文摘要:

Euclidean embedding from noisy observations containing outlier errors is an important and challenging problem in statistics and machine learning. Many existing methods would struggle with outliers due to a lack of detection ability. In this paper, we propose a matrix optimization based embedding model that can produce reliable embeddings and identify the outliers jointly. We show that the estimators obtained by the proposed method satisfy a non-asymptotic risk bound, implying that the model provides a high accuracy estimator with high probability when the order of the sample size is roughly the degree of freedom up to a logarithmic factor. Moreover, we show that under some mild conditions, the proposed model also can identify the outliers without any prior information with high probability. Finally, numerical experiments demonstrate that the matrix optimization-based model can produce configurations of high quality and successfully identify outliers even for large networks.

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

↑