本页提供题录、可核实摘要与阅读线索。AI 解读未完成全文核验，可能有误；具体假设、证明和结论请核对原文。仅依据书目生成的内容属于阅读导航，不是对论文结论的确认。
摘要保留来源文本，未经模型改写。材料不足时保留待解读状态；引用采用 OpenAlex 单条关联记录，不合计版本，缺失不视为零，也不代表论文质量。
正在核对对应版本的资源…
讨论高维回归中带噪声或缺失协变量的估计问题，给出统计误差与优化的理论保证。
Although the standard formulations of prediction problems involve fully-observed and noiseless data drawn in an i.i.d. manner, many applications involve noisy and/or missing data, possibly involving dependence, as well. We study these issues in the context of high-dimensional sparse linear regression, and propose novel estimators for the cases of noisy, missing and/or dependent data. Many standard approaches to noisy or missing data, such as those using the EM algorithm, lead to optimization problems that are inherently nonconvex, and it is difficult to establish theoretical guarantees on practical algorithms. While our approach also involves optimizing nonconvex programs, we are able to both analyze the statistical error associated with any global optimum, and more surprisingly, to prove that a simple algorithm based on projected gradient descent will converge in polynomial time to a small neighborhood of the set of all global minimizers. On the statistical side, we provide nonasymptotic bounds that hold with high probability for the cases of noisy, missing and/or dependent data. On the computational side, we prove that under the same types of conditions required for statistical consistency, the projected gradient descent algorithm is guaranteed to converge at a geometric rate to a near-global minimizer. We illustrate these theoretical predictions with simulations, showing close agreement with the predicted scalings.