Least Favorable Pairs for Special Capacities
特殊容量下的最不利分布对AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论稳健检验和最不利分布对的一般统计理论,未提供与所列经济计量细分方向直接对应的证据。
反馈分类问题特殊容量下的最不利分布对AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
The least favorable pair (LFP) that Huber (1965), (1968) wrote down when he considered minimax test problems between neighborhoods of single probability measures $P_0, P_1$ defined in terms of $\varepsilon$-contamination and total variation is a canonical but only one possible choice of an LFP. We treat these neighborhoods by means of special capacities. The minimax test statistic is obtained by explicitly solving a minimization program, all LFP's are characterized by their $(P_0 + P_1)$-densities, another LFP is given explicitly. The technique is similar to that used by Huber and Strassen (1973), but is simpler and more constructive in this special situation.