arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.05990math.STcs.LGstat.MLstat.TH
收藏

输出受到对抗性污染时基于Lasso的稳健估计

Robust estimation with Lasso when outputs are adversarially contaminated

The Graduate University for Advanced Studies, SOKENDAI(高等研究生院(SOKENDAI));The Institute of Statistical Mathematics(统计数学研究所);RIKEN(理化学研究所)

Takeyuki Sasai, Hironori Fujisawa

AI总结:

针对输出受对抗性污染时的稳健估计问题,本文利用Huber函数的特定性质,给出了一种不同于现有文献的证明方法,并获得了与最新结果相同的收敛速率。

摘要:

我们考虑当输出受到对抗性污染时的稳健估计问题。Nguyen和Tran(2012)提出了一种扩展的Lasso方法用于稳健参数估计,并给出了估计误差的收敛速率。最近,Dalalyan和Thompson(2019)给出了一些有用的不等式,并展示了比Nguyen和Tran(2012)更快的收敛速率。他们关注到扩展Lasso的最小化问题可以转化为带有$L_1$惩罚的Huber损失函数的最小化问题。其显著特点在于Huber损失函数包含一个额外的调优参数,这与传统方法不同。我们给出了与Dalalyan和Thompson(2019)不同的证明,并得到了与Dalalyan和Thompson(2019)相同的收敛速率。我们证明的意义在于利用了Huber函数的一些特定性质,这些技巧在以往的证明中未曾使用过。

英文摘要:

We consider robust estimation when outputs are adversarially contaminated. Nguyen and Tran (2012) proposed an extended Lasso for robust parameter estimation and then they showed the convergence rate of the estimation error. Recently, Dalalyan and Thompson (2019) gave some useful inequalities and then they showed a faster convergence rate than Nguyen and Tran (2012). They focused on the fact that the minimization problem of the extended Lasso can become that of the penalized Huber loss function with $L_1$ penalty. The distinguishing point is that the Huber loss function includes an extra tuning parameter, which is different from the conventional method. We give the proof, which is different from Dalalyan and Thompson (2019) and then we give the same convergence rate as Dalalyan and Thompson (2019). The significance of our proof is to use some specific properties of the Huber function. Such techniques have not been used in the past proofs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑