Limit distribution theory for block estimators in multiple isotonic regression
多元保序回归块估计量的极限分布理论AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要聚焦一般多元保序回归的局部理论,没有所列经济领域细分的明确应用依据。
反馈分类问题多元保序回归块估计量的极限分布理论AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We study limit distributions for the tuning-free max–min block estimator originally proposed in (Fokianos, Leucht and Neumann (2017)) in the problem of multiple isotonic regression, under both fixed lattice design and random design settings. We show that, if the regression function $f_{0}$ admits vanishing derivatives up to order $\alpha_{k}$ along the $k$th dimension ($k=1,\ldots,d$) at a fixed point $x_{0}\in(0,1)^{d}$, and the errors have variance $\sigma^{2}$, then the max–min block estimator $\hat{f}_{n}$ satisfies \begin{equation*}\bigl(n_{\ast}/\sigma^{2}\bigr)^{\frac{1}{2+\sum_{k\in\mathcal{D}_{\ast}}\alpha_{k}^{-1}}}\bigl(\hat{f}_{n}(x_{0})-f_{0}(x_{0})\bigr)\rightsquigarrow \mathbb{C}(f_{0},x_{0}).\end{equation*} Here, $\mathcal{D}_{\ast},n_{\ast}$, depending on $\{\alpha_{k}\}$ and the design points, are the set of all “effective dimensions” and the size of “effective samples” that drive the asymptotic limiting distribution, respectively. If furthermore either $\{\alpha_{k}\}$ are relative primes to each other or all mixed derivatives of $f_{0}$ of certain critical order vanish at $x_{0}$, then the limiting distribution can be represented as $\mathbb{C}(f_{0},x_{0})=_{d}K(f_{0},x_{0})\cdot\mathbb{D}_{\boldsymbol{\alpha}}$, where $K(f_{0},x_{0})$ is a constant depending on the local structure of the regression function $f_{0}$ at $x_{0}$, and $\mathbb{D}_{\boldsymbol{\alpha}}$ is a nonstandard limiting distribution generalizing the well-known Chernoff distribution in univariate problems. The above limit theorem is also shown to be optimal both in terms of the local rate of convergence and the dependence on the unknown regression function whenever such dependence is explicit (i.e., $K(f_{0},x_{0})$), for the full range of $\{\alpha_{k}\}$ in a local asymptotic minimax sense. There are two interesting features in our local theory. First, the max–min block estimator automatically adapts to the local smoothness and the intrinsic dimension of the isotonic regression function at the optimal rate. Second, the optimally adaptive local rates are in general not the same in fixed lattice and random designs. In fact, the local rate in the fixed lattice design case is no slower than that in the random design case, and can be much faster when the local smoothness levels of the isotonic regression function or the sizes of the lattice differ substantially along different dimensions.