arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.00260math.STstat.MLstat.TH
收藏

广义自协调下的置信集

Confidence Sets under Generalized Self-Concordance

Lang Liu, Zaid Harchaoui

摘要:

本文从非渐近理论观点$\unicode{x2013}$重新审视统计推断中的一个基本问题--置信集的构造。我们建立了一个有限样本界的估计,其渐近行为的非渐近方式。我们的界限的一个重要特征是,它的维度依赖性是由有效维度$\unicode{x2013}$捕获的,有效维度是极限三明治协方差$\unicode{x2013}$的迹,在某些情况下,它可以比参数维度小小于多。然后,我们说明了如何可以使用的界限,以获得一个置信集,其形状是适应的优化景观诱导的损失函数。不同于以往的作品,严重依赖于强凸性的损失函数,我们只假设海森是下界在最佳状态,并允许它逐渐退化。这个性质是形式化的广义自协调的概念,起源于凸优化。此外,我们展示了如何有效的尺寸可以估计数据和表征其估计精度。我们将我们的结果应用于广义线性模型的极大似然估计,指数族的分数匹配,和Rao的分数检验的假设检验。

英文摘要:

This paper revisits a fundamental problem in statistical inference from a non-asymptotic theoretical viewpoint $\unicode{x2013}$ the construction of confidence sets. We establish a finite-sample bound for the estimator, characterizing its asymptotic behavior in a non-asymptotic fashion. An important feature of our bound is that its dimension dependency is captured by the effective dimension $\unicode{x2013}$ the trace of the limiting sandwich covariance $\unicode{x2013}$ which can be much smaller than the parameter dimension in some regimes. We then illustrate how the bound can be used to obtain a confidence set whose shape is adapted to the optimization landscape induced by the loss function. Unlike previous works that rely heavily on the strong convexity of the loss function, we only assume the Hessian is lower bounded at optimum and allow it to gradually becomes degenerate. This property is formalized by the notion of generalized self-concordance which originated from convex optimization. Moreover, we demonstrate how the effective dimension can be estimated from data and characterize its estimation accuracy. We apply our results to maximum likelihood estimation with generalized linear models, score matching with exponential families, and hypothesis testing with Rao's score test.

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

↑