An assumption-free exact test for fixed-design linear models with exchangeable errors
可交换误差下固定设计线性模型的精确检验AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用固定设计线性模型的精确检验,没有明确的因果识别、面板结构或宏观金融对象,所给细分证据不足。
可交换误差下固定设计线性模型的精确检验AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Summary We propose the cyclic permutation test to test general linear hypotheses for linear models. The test is nonrandomized and valid in finite samples with exact Type I error $\alpha$ for an arbitrary fixed design matrix and arbitrary exchangeable errors, whenever $1 / \alpha$ is an integer and $n / p \geqslant 1 / \alpha - 1$, where $n$ is the sample size and $p$ is the number of parameters. The test involves applying the marginal rank test to $1 / \alpha$ linear statistics of the outcome vector, where the coefficient vectors are determined by solving a linear system such that the joint distribution of the linear statistics is invariant with respect to a nonstandard cyclic permutation group under the null hypothesis. The power can be further enhanced by solving a secondary nonlinear travelling salesman problem, for which the genetic algorithm can find a reasonably good solution. Extensive simulation studies show that the cyclic permutation test has comparable power to existing tests. When testing for a single contrast of coefficients, an exact confidence interval can be obtained by inverting the test.