Estimation of high-dimensional low-rank matrices
高维低秩矩阵的估计AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要明确应用为多任务学习与矩阵补全，未提供面板数据或宏观、金融因子模型的直接依据。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
高维低秩矩阵的估计
- 研究问题
- 当未知矩阵元素数远超样本量且仅观察含噪元素或线性组合时，如何利用低秩结构估计矩阵并控制预测风险？
- 方法与思路
- 作者研究带 Schatten 准范数惩罚的最小二乘估计，在两类采样算子条件下，以经验过程工具分析非渐近风险。
- 材料陈述的贡献
- 摘要称给出预测与 Schatten 风险上界，方阵情形预测风险率与秩、边长和样本量相关，并详析多任务学习和矩阵补全。
- 阅读关注点
- 应核对两类采样条件、噪声与惩罚参数要求、风险范数和对数因子，以及非凸惩罚估计的实际计算方式。
- 阅读边界
- 仅据版本未注明的 OpenAlex 摘要；常数、计算保证与条件细节未说明，低秩矩阵结果不能直接视为面板或因子模型结论。
原文摘要
Suppose that we observe entries or, more generally, linear combinations of entries of an unknown m×T-matrix A corrupted by noise. We are particularly interested in the high-dimensional setting where the number mT of unknown entries can be much larger than the sample size N. Motivated by several applications, we consider estimation of matrix A under the assumption that it has small rank. This can be viewed as dimension reduction or sparsity assumption. In order to shrink toward a low-rank representation, we investigate penalized least squares estimators with a Schatten-p quasi-norm penalty term, p≤1. We study these estimators under two possible assumptions—a modified version of the restricted isometry condition and a uniform bound on the ratio “empirical norm induced by the sampling operator/Frobenius norm.” The main results are stated as nonasymptotic upper bounds on the prediction risk and on the Schatten-q risk of the estimators, where q∈[p, 2]. The rates that we obtain for the prediction risk are of the form rm/N (for m=T), up to logarithmic factors, where r is the rank of A. The particular examples of multi-task learning and matrix completion are worked out in detail. The proofs are based on tools from the theory of empirical processes. As a by-product, we derive bounds for the kth entropy numbers of the quasi-convex Schatten class embeddings SpM↪S2M, p<1, which are of independent interest.