Tukey回归的降维
Dimensionality Reduction for Tukey Regression
摘要:
给出了过约束Tukey回归问题的第一种降维方法。Tukey损失函数$\|y\|_M = \sum_i M(y_i)$对于小于规定阈值$τ$的残留误差$y_i$具有$M(y_i) \approx |y_i|^p$,但是对于误差$|y_i| > τ$ $M(y_i)$变为常数。我们的结果依赖于一个新的结构结果,证明建设性的,表明任何$d$维子空间$L \subset \mathbb{R}^n$,有一个固定的有界大小的坐标子集包含,对于每个$y \in L$,所有的大坐标,相对于Tukey损失函数,$y$。我们的方法减少了一个给定的Tukey回归问题到一个较小的加权版本,其解决方案是一个可证明的良好的近似解的原始问题。我们的减少是快速,简单,易于实现,我们给出的实证结果证明其实用性,使用现有的启发式求解器的小版本。我们还给出了指数时间算法,可证明良好的解决方案,和硬度的结果表明,在最坏的情况下,显着的加速是不可能的。
英文摘要:
We give the first dimensionality reduction methods for the overconstrained Tukey regression problem. The Tukey loss function $\|y\|_M = \sum_i M(y_i)$ has $M(y_i) \approx |y_i|^p$ for residual errors $y_i$ smaller than a prescribed threshold $τ$, but $M(y_i)$ becomes constant for errors $|y_i| > τ$. Our results depend on a new structural result, proven constructively, showing that for any $d$-dimensional subspace $L \subset \mathbb{R}^n$, there is a fixed bounded-size subset of coordinates containing, for every $y \in L$, all the large coordinates, with respect to the Tukey loss function, of $y$. Our methods reduce a given Tukey regression problem to a smaller weighted version, whose solution is a provably good approximate solution to the original problem. Our reductions are fast, simple and easy to implement, and we give empirical results demonstrating their practicality, using existing heuristic solvers for the small versions. We also give exponential-time algorithms giving provably good solutions, and hardness results suggesting that a significant speedup in the worst case is unlikely.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。