Optimal third root asymptotic bounds in the statistical estimation of thresholds
阈值统计估计的最优立方根渐近界AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究一般分类阈值的统计估计,未提供离散选择或其他所列方向的直接依据。
阈值统计估计的最优立方根渐近界AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This paper is concerned with estimating the intersection point of two densities, given a sample of both of the densities. This problem arises in classification theory. The main results provide lower bounds for the probability of the estimation errors to be large on a scale determined by the inverse cube root of the sample size. As corollaries, we obtain probabilistic bounds for the prediction error in a classification problem. The key to the proof is an entropy estimate. The lower bounds are based on bounds for general estimators, which are applicable in other contexts as well. Furthermore, we introduce a class of optimal estimators whose errors asymptotically meet the border permitted by the lower bounds.