用森林中位数提升密度估计抗异常值能力
Median of Forests for Robust Density Estimation
- 对子采样数据的森林密度估计取逐点中位数,增强鲁棒性
- 即使异常值数量达样本量多项式级,仍保持接近无污染时的收敛速度
- 适合含大量异常值的数据场景,尤其适用于异常检测
稳健密度估计指在数据受异常值污染时仍能一致地估计密度函数。我们发现现有森林密度估计在某一点上对不包含该点所在单元格的异常值(非局部异常值)具有天然抗性,但对其他局部异常值则不具鲁棒性。为实现对所有异常值的鲁棒性,我们提出一种集成学习算法——中位数森林稳健密度估计(MFRDE),该方法对子采样数据上拟合的森林密度估计器进行逐点中位数操作。相较于现有鲁棒核方法,MFRDE可选择更大的子采样规模,在牺牲较少精度的同时实现更强鲁棒性。理论上,我们引入局部异常指数以量化局部异常值数量;在此指数下,即便异常值数量达到样本量的多项式阶,MFRDE仍可实现与无污染数据上相同算法几乎相同的收敛速率,而鲁棒核方法则失效。实验表明,真实数据中MFRDE优于现有鲁棒核方法,并进一步应用于异常检测任务。
原文摘要 · Abstract (English)
Robust density estimation refers to the consistent estimation of the density function even when the data is contaminated by outliers. We find that existing forest density estimation at a certain point is inherently resistant to the outliers outside the cells containing the point, which we call \textit{non-local outliers}, but not resistant to the rest \textit{local outliers}. To achieve robustness against all outliers, we propose an ensemble learning algorithm called \textit{medians of forests for robust density estimation} (\textit{MFRDE}), which adopts a pointwise median operation on forest density estimators fitted on subsampled datasets. Compared to existing robust kernel-based methods, MFRDE enables us to choose larger subsampling sizes, sacrificing less accuracy for density estimation while achieving robustness. On the theoretical side, we introduce the local outlier exponent to quantify the number of local outliers. Under this exponent, we show that even if the number of outliers reaches a certain polynomial order in the sample size, MFRDE is able to achieve almost the same convergence rate as the same algorithm on uncontaminated data, whereas robust kernel-based methods fail. On the practical side, real data experiments show that MFRDE outperforms existing robust kernel-based methods. Moreover, we apply MFRDE to anomaly detection to showcase a further application.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。