arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1705.08036stat.ME
收藏

压缩和惩罚线性回归

Compressed and Penalized Linear Regression

Darren Homrighausen, Daniel J. McDonald

摘要:

现代应用程序需要在大型数据集上计算可行的方法,但也要保持统计效率。通常,这两个问题被认为是矛盾的:近似方法,使计算被认为是降低统计性能相对于精确的方法。在应用数学中,目前大部分关于近似的理论工作都存在,输入被认为是精确观察到的。流行的哲学是,虽然确切的问题是,遗憾的是,无法解决,任何近似应该尽可能小。然而,从统计的角度来看,近似或正则化的解决方案可能比精确的解决方案更可取。正则化形式化了对数据的保真度和遵守有关数据生成过程的先验知识(如平滑性或稀疏性)之间的权衡。由此产生的估计量往往更有用,更可解释,更适合作为其他方法的输入。在本文中,我们提出了新的方法,估计和预测下的线性模型借用近似文献的见解。我们从统计的角度探讨这些程序,发现在许多情况下,它们可以提高计算和统计性能。

英文摘要:

Modern applications require methods that are computationally feasible on large datasets but also preserve statistical efficiency. Frequently, these two concerns are seen as contradictory: approximation methods that enable computation are assumed to degrade statistical performance relative to exact methods. In applied mathematics, where much of the current theoretical work on approximation resides, the inputs are considered to be observed exactly. The prevailing philosophy is that while the exact problem is, regrettably, unsolvable, any approximation should be as small as possible. However, from a statistical perspective, an approximate or regularized solution may be preferable to the exact one. Regularization formalizes a trade-off between fidelity to the data and adherence to prior knowledge about the data-generating process such as smoothness or sparsity. The resulting estimator tends to be more useful, interpretable, and suitable as an input to other methods. In this paper, we propose new methodology for estimation and prediction under a linear model borrowing insights from the approximation literature. We explore these procedures from a statistical perspective and find that in many cases they improve both computational and statistical performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑