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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要研究通用稳健非参数回归,未明确开展分位数效应分析或其他给定领域的问题。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Ferdinand T. Wang
David W. Scott

稳健非参数回归的 L1 方法

研究问题
当误差具有厚尾且离群点可能成群出现时,如何在不预设回归函数形式的情况下,实现计算可行的多维稳健平滑?
方法与思路
作者在局部邻域内以绝对偏差准则拟合多项式,将计算转化为具有特殊结构的线性规划,并推广到多维。
材料陈述的贡献
摘要称,该方法无需估计残差尺度即可处理多种离群点,给出一致性证明,并展示真实数据和模拟应用。
阅读关注点
应核对局部邻域及多项式阶数选择、一致性所需误差与设计条件,以及维数增加时的计算和统计表现。
阅读边界
仅据 OpenAlex 索引摘要,稿件版本未注明;未说明具体一致性条件、收敛速度和污染边界,不能断言任意厚尾情形均适用。

原文摘要

Consider the problem of estimating the regression function underlying a set of data that is contaminated by a heavy-tailed error distribution. The two standard approaches to such a problem are each flawed. Robust parametric least squares is appropriate only if there is good reason to believe that the underlying function has some particular form, whereas most nonparametric regression methods are asymptotically equivalent to kernel regression methods, which are not resistant against outliers. Existing algorithms for robustifying nonparametric regression procedures use either nonlinear optimization of an influence function or iterative solution of local polynomial fitting using reweighted least squares. Neither of these two approaches combines computational ease with asymptotic theoretical results. Furthermore, application of the robust procedure has been limited almost exclusively to the case of a single explanatory variable with the response variable. In this article a new hybrid method is proposed that combines nonparametric regression with the L 1 norm. Applying the L 1 norm on the regression residuals leads naturally to a robust estimator in any dimension. Unlike diagnostic and influence approaches, the L 1 metric can handle many outliers, whether isolated or clumped, without any requirement to estimate the scale of the residuals. Despite L 1's reputation for being computationally intractable, fitting a polynomial by the least absolute deviations criterion is equivalent to solving a linear program with special structure. By using the L 1 norm over local neighborhoods, a method that is also nonparametric is constructed. Additionally, the new method generalizes easily to several dimensions. To date, the problem of robust smoothing directly in several dimensions has met with little success, without resorting to robust additive models. A proof of consistency for the L 1 algorithm is presented, and results from both real and simulated data are shown.

笔记与分组
相关领域论文