STATISTICAL INFERENCE BASED ON ROBUST LOW-RANK DATA MATRIX APPROXIMATION

被引:3
|
作者
Feng, Xingdong [1 ,2 ]
He, Xuming [3 ]
机构
[1] Shanghai Univ Finance & Econ, Minist Educ, Sch Stat & Management, Shanghai 200433, Peoples R China
[2] Shanghai Univ Finance & Econ, Minist Educ, Key Lab Math Econ SUFE, Shanghai 200433, Peoples R China
[3] Univ Michigan, Dept Stat, Ann Arbor, MI 48109 USA
来源
ANNALS OF STATISTICS | 2014年 / 42卷 / 01期
基金
美国国家科学基金会;
关键词
Hypothesis testing; M estimator; singular value decomposition; trimmed least squares; LEAST-SQUARES; REGRESSION;
D O I
10.1214/13-AOS1186
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The singular value decomposition is widely used to approximate data matrices with lower rank matrices. Feng and He [Ann. Appl. Stat. 3 (2009) 1634-1654] developed tests on dimensionality of the mean structure of a data matrix based on the singular value decomposition. However, the first singular values and vectors can be driven by a small number of outlying measurements. In this paper, we consider a robust alternative that moderates the effect of outliers in low-rank approximations. Under the assumption of random row effects, we provide the asymptotic representations of the robust low-rank approximation. These representations may be used in testing the adequacy of a low-rank approximation. We use oligonucleotide gene microarray data to demonstrate how robust singular value decomposition compares with the its traditional counterparts. Examples show that the robust methods often lead to a more meaningful assessment of the dimensionality of gene intensity data matrices.
引用
收藏
页码:190 / 210
页数:21
相关论文
共 50 条
  • [41] A Robust Canonical Polyadic Tensor Decomposition via Structured Low-Rank Matrix Approximation
    Akema, Riku
    Yamagishi, Masao
    Yamada, Isao
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2022, E105A (01) : 11 - 24
  • [42] Flexible sparse robust low-rank approximation of matrix for image feature selection and classification
    Xiuhong Chen
    Tong Chen
    Soft Computing, 2023, 27 : 17603 - 17620
  • [43] An unconventional robust integrator for dynamical low-rank approximation
    Gianluca Ceruti
    Christian Lubich
    BIT Numerical Mathematics, 2022, 62 : 23 - 44
  • [44] Flexible sparse robust low-rank approximation of matrix for image feature selection and classification
    Chen, Xiuhong
    Chen, Tong
    SOFT COMPUTING, 2023, 27 (23) : 17603 - 17620
  • [45] An unconventional robust integrator for dynamical low-rank approximation
    Ceruti, Gianluca
    Lubich, Christian
    BIT NUMERICAL MATHEMATICS, 2022, 62 (01) : 23 - 44
  • [46] Practical Low-Rank Matrix Approximation under Robust L1-Norm
    Zheng, Yinqiang
    Liu, Guangcan
    Sugimoto, Shigeki
    Yan, Shuicheng
    Okutomi, Masatoshi
    2012 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2012, : 1410 - 1417
  • [47] Robust DOA Estimation Using VSS-LMS With Low-Rank Matrix Approximation
    Jalal, Babur
    Elnahas, Osama
    Xu, Xiaodong
    Quan, Zhi
    Zhang, Ping
    IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2023, 59 (03) : 2967 - 2978
  • [48] On the Complexity of Robust PCA and l1-Norm Low-Rank Matrix Approximation
    Gillis, Nicolas
    Vavasis, Stephen A.
    MATHEMATICS OF OPERATIONS RESEARCH, 2018, 43 (04) : 1072 - 1084
  • [49] A rank-adaptive robust integrator for dynamical low-rank approximation
    Gianluca Ceruti
    Jonas Kusch
    Christian Lubich
    BIT Numerical Mathematics, 2022, 62 : 1149 - 1174
  • [50] A rank-adaptive robust integrator for dynamical low-rank approximation
    Ceruti, Gianluca
    Kusch, Jonas
    Lubich, Christian
    BIT NUMERICAL MATHEMATICS, 2022, 62 (04) : 1149 - 1174