Anti-concentration and honest, adaptive confidence bands
反集中性与诚实、自适应置信带AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
本页为预印本版本；arXiv 收录、作者填写的期刊信息以及作者既有发表经历，都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对，只展示已核实例，档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要聚焦高斯过程反集中性与通用非参数置信带，未明确面向所列经济或金融细分问题，因此暂不分类。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
反集中性与诚实、自适应置信带
- 研究问题
- 如何在学生化经验过程上确界的极限分布不存在或未知时，构造具有统一覆盖保证、且能适应数据驱动调参的非参数置信带？
- 方法与思路
- 作者以近似高斯过程上确界的反集中性质替代经典 SBR 条件，结合高斯乘子 bootstrap 构造置信带并选择分辨率。
- 材料陈述的贡献
- 摘要称其推导了可分高斯过程的反集中不等式，提出更弱的广义 SBR 条件，并给出密度置信带及实用的 Lepski 方法。
- 阅读关注点
- 应核对高斯近似误差、偏差控制及函数类限制，特别是诚实覆盖与自适应性如何同时成立，以及 bootstrap 调参的适用条件。
- 阅读边界
- 这是 arXiv 预印本，同行评审与接收情况未核实。摘要未说明完整条件和证明，不能将覆盖与自适应保证推广到任意函数类。
原文摘要
Modern construction of uniform confidence bands for nonparametric densities (and other functions) often relies on the classical Smirnov-Bickel-Rosenblatt (SBR) condition; see, for example, Giné and Nickl [Probab. Theory Related Fields 143 (2009) 569-596]. This condition requires the existence of a limit distribution of an extreme value type for the supremum of a studentized empirical process (equivalently, for the supremum of a Gaussian process with the same covariance function as that of the studentized empirical process). The principal contribution of this paper is to remove the need for this classical condition. We show that a considerably weaker sufficient condition is derived from an anti-concentration property of the supremum of the approximating Gaussian process, and we derive an inequality leading to such a property for separable Gaussian processes. We refer to the new condition as a generalized SBR condition. Our new result shows that the supremum does not concentrate too fast around any value. We then apply this result to derive a Gaussian multiplier bootstrap procedure for constructing honest confidence bands for nonparametric density estimators (this result can be applied in other nonparametric problems as well). An essential advantage of our approach is that it applies generically even in those cases where the limit distribution of the supremum of the studentized empirical process does not exist (or is unknown). This is of particular importance in problems where resolution levels or other tuning parameters have been chosen in a data-driven fashion, which is needed for adaptive constructions of the confidence bands. Finally, of independent interest is our introduction of a new, practical version of Lepski's method, which computes the optimal, nonconservative resolution levels via a Gaussian multiplier bootstrap method.