Adaptive estimation of the L2-norm of a probability density and related topics II. Upper bounds via the oracle approach
概率密度 L2 范数的自适应估计及相关问题(二):基于预言方法的上界AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究一般密度泛函的自适应估计与风险界,未涉及经济学分布效应或其他所列细分方向,故保留空分类。
概率密度 L2 范数的自适应估计及相关问题(二):基于预言方法的上界AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This is the second part of the research project initiated in Cleanthous, Georgiadis and Lepski (2024a). We deal with the problem of the adaptive estimation of the L2-norm of a probability density on Rd, d≥1, from independent observations. The unknown density is assumed to be uniformly bounded by unknown constant and to belong to the union of balls in the isotropic/anisotropic Nikolskii’s spaces. In Cleanthous, Georgiadis and Lepski (2024a), we have proved that the optimally adaptive estimators do no exist in the considered problem and provided with several lower bounds for the adaptive risk. In this part, we show that these bounds are tight and present the adaptive estimator which is obtained by a data-driven selection from a family of kernel-based estimators. The proposed estimation procedure as well as the computation of its risk are heavily based on new concentration inequalities for decoupled U-statistics of order two established in Section 4. It is also worth noting that all our results are derived from the unique oracle inequality which may be of independent interest.