A Lower Bound for the Risk in Estimating the Value of a Probability Density
概率密度点值估计风险的下界AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究非参数密度估计的风险界,未直接研究分位数或经济分布效应。
概率密度点值估计风险的下界AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This article considers estimation of f(0) of a density function satisfying a Lipshitz condition in a neighborhood of 0. A nonstandard use of the Cramer-Rao inequality yields numerical lower bounds on the minimax squared error risk of any estimator. These bounds are then compared with the minimax risk of the asymptotically optimal kernel-type estimator. The asymptotic bounds obtained (as the sample size n → ∞) are not quite as good as those in Donoho and Liu (in press a, b), but bounds are presented here also for finite values of n, and that paper contains no such bounds for this problem. The numerical results reported in Table 1 show that the asymptotically optimal kernel estimator performs within a factor of 3 of the minimax bound, even for sample size n = 30. As n increases the relative performance improves to its limiting value, although the convergence is fairly slow.