Bootstrap Testing of the Rank of a Matrix via Least-Squared Constrained Estimation
通过最小二乘约束估计进行矩阵秩的自助法检验AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究通用矩阵秩与子流形检验,未提供因子、面板或其他指定细分领域的直接依据。
通过最小二乘约束估计进行矩阵秩的自助法检验AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
To test if an unknown matrix M0 has a given rank (null hypothesis noted H0), we consider a statistic that is a squared distance between an estimator and the submanifold of fixed-rank matrix. Under H0, this statistic converges to a weighted chi-squared distribution. We introduce the constrained bootstrap (CS bootstrap) to estimate the law of this statistic under H0. An important point is that even if H0 fails, the CS bootstrap reproduces the behavior of the statistic under H0. As a consequence, the CS bootstrap is employed to estimate the nonasymptotic quantile for testing the rank. We provide the consistency of the procedure and the simulations shed light on the accuracy of the CS bootstrap with respect to the traditional asymptotic comparison. More generally, the results are extended to test whether an unknown parameter belongs to a submanifold of the Euclidean space. Finally, the CS bootstrap is easy to compute, it handles a large family of tests and it works under mild assumptions.