High-Breakdown Rank Regression
高崩溃点秩回归AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用稳健回归、崩溃点与秩推断,未提供对应目录中具体应用方向的证据。
反馈分类问题高崩溃点秩回归AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
A weighted rank estimate is proposed that has 50% breakdown and is asymptotically normal at rate √n. Based on this theory, inferential procedures, including asymptotic confidence and tests, and diagnostic procedures, such as studentized residuals, are developed. The influence function of the estimate is derived and shown to be continuous and bounded everywhere in (x, Y) space. Examples show that robustness against outlying high-leverage clusters may approach that of the least median of squares, while retaining more stability against inliers. The estimator uses weights that correct for both factor and response spaces. A Monte Carlo study shows that the estimate is more efficient than the generalized rank estimates, which are generalized R estimates with weights that only correct for factor space. When weights are constant, the estimate reduces to the regular Wilcoxon rank estimate.