跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要研究通用多元回归同时置信界,预测变量约束并非所列领域细分的充分依据。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Daniel Q. Naiman

利用预测变量约束构造多元回归同时置信界

研究问题
当预测变量只能取多面体凸集内的值时,如何利用这一范围约束构造具有指定覆盖概率、且更窄的同时置信界?
方法与思路
作者将覆盖概率关联到随机向量在多面锥上的投影范数,借助蒙特卡洛近似,并提供矩形约束下的投影算法。
材料陈述的贡献
摘要称,在所考察设计与区域中,相较给定保守界,单侧置信界改善较大,双侧改善较小,并给出近似临界值。
阅读关注点
应核对回归误差与设计条件、预测变量约束的来源、锥投影算法,以及模拟近似误差和比较界的适用范围。
阅读边界
仅据版本未注明的 OpenAlex 摘要;覆盖概率通过近似计算,宽度改善限于所列设计和约束区域,不能推断普遍优势。

原文摘要

This article presents a method for approximating the coverage probability of simultaneous confidence bounds for multiple regression functions when the vector of predictor variables is constrained to lie in a polyhedral convex set. The method is useful because it allows one to construct simultaneous confidence intervals with prescribed coverage probability for the regression function evaluated at various settings of the predictor variables, which are narrower than bounds obtained without using the predictor variable constraints. For a family of two-sided simultaneous confidence bounds that includes Scheffé-type and constant-width bounds, the probability of coverage is related to the distribution of the maximum Euclidean norm of the projection onto a polyhedral cone for a pair of random vectors with known joint distribution. An analogous relation holds for one-sided bounds. If an algorithm for computing the projection onto the cone is available, then these results enable one to use the Monte Carlo method to approximate the coverage probabilities of bounds. Particular attention is given to the case in which lower and upper bounds can be specified for each of the predictor variables so that the constraint region for bounding the regression function is rectangular. An efficient algorithm for calculating projections onto the appropriate cone for rectangular constraint regions, which facilitates coverage probability approximation of Schefffé-type bounds, is presented. This algorithm is used to calculate approximate critical points of Scheffé-type bounds for some specific designs and constraint regions and we show that substantial improvements for one-sided bounds and modest improvements for two-sided bounds over the conservative bounds of Casella and Strawderman (1980) may be obtained.

笔记与分组
相关领域论文