On the Estimation of Quadratic Functionals
二次泛函的估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于非参数泛函估计理论,未明确分位数、分布效应或其他所列计量方向。
二次泛函的估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We discuss the difficulties of estimating quadratic functionals based on observations $Y(t)$ from the white noise model $Y(t) = \int^t_0 f(u) du + \sigma W(t),\quad t \in \lbrack 0, 1\rbrack,$ where $W(t)$ is a standard Wiener process on $\lbrack 0, 1\rbrack$. The optimal rates of convergence (as $\sigma \rightarrow 0$) for estimating quadratic functionals under certain geometric constraints are found. Specifically, the optimal rates of estimating $\int^1_0\lbrack f^{(k)}(x)\rbrack^2 dx$ under hyperrectangular constraints $\sum = \{f: |x_j(f)| \leq Cj^{-\alpha}\}$ and weighted $l_p$-body constraints $\sum_p = \{f: \sum^\infty_1 j^r|x_j(f)|^p \leq C\}$ are computed explicitly, where $x_j(f)$ is the $j$th Fourier-Bessel coefficient of the unknown function $f$. We develop lower bounds based on testing two highly composite hypercubes and address their advantages. The attainable lower bounds are found by applying the hardest one-dimensional approach as well as the hypercube method. We demonstrate that for estimating regular quadratic functionals [i.e., the functionals which can be estimated at rate $O(\sigma^2)$], the difficulties of the estimation are captured by the hardest one-dimensional subproblems, and for estimating nonregular quadratic functionals [i.e., no $O(\sigma^2)$-consistent estimator exists], the difficulties are captured at certain finite-dimensional (the dimension goes to infinity as $\sigma \rightarrow 0$) hypercube subproblems.