analiza aiqbench
This paper advances nonparametric machine learning by introducing a robust Local Polynomial Regression framework that mitigates outlier sensitivity through conditional density kernels. The method offers improved empirical bias over existing iterative approaches while maintaining competitiveness with standard LOWESS techniques, providing valuable tools for data scientists handling noisy datasets.
Robust Local Polynomial Regression with Similarity Kernels
arXiv:2501.10729v3 Announce Type: replace-cross Abstract: Local Polynomial Regression (LPR) is a widely used nonparametric method for modeling complex relationships due to its flexibility and simplicity. It estimates a regression function by fitting low-degree polynomials to localized subsets of the data, weighted by proximity. However, traditional LPR is sensitive to outliers and high-leverage points, which can significantly affect estimation accuracy. This paper revisits the kernel function used to compute regression weights and proposes a novel framework that incorporates both predictor and response variables in the weighting mechanism. The focus of this work is a conditional density kernel that robustly estimates weights by mitigating the influence of outliers through localized density estimation. The proposed method is implemented in Python and is publicly available at https://github.com/yaniv-shulman/rsklpr. The population analysis quantifies the bias induced by density-based robust weighting, and the reported experiments show lower empirical bias than iterative robust LOWESS while remaining competitive with standard LOWESS. This advancement provides a promising extension to traditional LPR, opening new possibilities for robust regression applications.
Abstract:Local Polynomial Regression (LPR) is a widely used nonparametric method for modeling complex relationships due to its flexibility and simplicity. It estimates a regression function by fitting low-degree polynomials to localized subsets of the data, weighted by proximity. However, traditional LPR is sensitive to outliers and high-leverage points, which can significantly affect estimation accuracy. This paper revisits the kernel function used to compute regression weights and proposes a novel framework that incorporates both predictor and response variables in the weighting mechanism. The focus of this work is a conditional density kernel that robustly estimates weights by mitigating the influence of outliers through localized density estimation. The proposed method is implemented in Python and is publicly available at this https URL. The population analysis quantifies the bias induced by density-based robust weighting, and the reported experiments show lower empirical bias than iterative robust LOWESS while remaining competitive with standard LOWESS. This advancement provides a promising extension to traditional LPR, opening new possibilities for robust regression applications.
Methodology (stat.ME); Machine Learning (cs.LG); Machine Learning (stat.ML)
arXiv:2501.10729 [stat.ME]
(or arXiv:2501.10729v3 [stat.ME] for this version)
Text integral sub licența deschisă a publicației · 181 cuvinte
Subiecte conexe

Generalization and infinite width
LessWrong · 1 aug. 2026

PIRAMID: Progress and Plans
LessWrong · 27 iul. 2026

[AINews] not much happened today
Latent Space · 3 oct. 2026

How do neural networks regress cubic polynomials? Apparently, they use a trick invented in Milan 500 years ago
LessWrong · 22 iul. 2026