arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1411.6160math.STcs.LGmath.OCstat.MLstat.TH

Characterization of the equivalence of robustification and regularization in linear and matrix regression

MIT(麻省理工学院)

Dimitris Bertsimas, Martin S. Copenhaver

英文摘要:

The notion of developing statistical methods in machine learning which are robust to adversarial perturbations in the underlying data has been the subject of increasing interest in recent years. A common feature of this work is that the adversarial robustification often corresponds exactly to regularization methods which appear as a loss function plus a penalty. In this paper we deepen and extend the understanding of the connection between robustification and regularization (as achieved by penalization) in regression problems. Specifically, (a) in the context of linear regression, we characterize precisely under which conditions on the model of uncertainty used and on the loss function penalties robustification and regularization are equivalent, and (b) we extend the characterization of robustification and regularization to matrix regression problems (matrix completion and Principal Component Analysis).

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

↑