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 条
  • [21] Low-Rank Approximation of Circulant Matrix to a Noisy Matrix
    Suliman Al-Homidan
    Arabian Journal for Science and Engineering, 2021, 46 : 3287 - 3292
  • [22] Differentially Private Robust Low-Rank Approximation
    Arora, Raman
    Braverman, Vladimir
    Upadhyay, Jalaj
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [23] Low-Rank Approximation of Circulant Matrix to a Noisy Matrix
    Al-Homidan, Suliman
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2021, 46 (04) : 3287 - 3292
  • [24] Lower bounds for the low-rank matrix approximation
    Li, Jicheng
    Liu, Zisheng
    Li, Guo
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2017,
  • [25] Low-rank approximation pursuit for matrix completion
    Xu, An-Bao
    Xie, Dongxiu
    MECHANICAL SYSTEMS AND SIGNAL PROCESSING, 2017, 95 : 77 - 89
  • [26] Parameterized low-rank binary matrix approximation
    Fedor V. Fomin
    Petr A. Golovach
    Fahad Panolan
    Data Mining and Knowledge Discovery, 2020, 34 : 478 - 532
  • [27] Optimal low-rank approximation to a correlation matrix
    Zhang, ZY
    Wu, LX
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 364 : 161 - 187
  • [28] Parameterized low-rank binary matrix approximation
    Fomin, Fedor, V
    Golovach, Petr A.
    Panolan, Fahad
    DATA MINING AND KNOWLEDGE DISCOVERY, 2020, 34 (02) : 478 - 532
  • [29] Lower bounds for the low-rank matrix approximation
    Jicheng Li
    Zisheng Liu
    Guo Li
    Journal of Inequalities and Applications, 2017
  • [30] Low-rank matrix approximation in the infinity norm
    Gillis, Nicolas
    Shitov, Yaroslav
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2019, 581 (367-382) : 367 - 382