.png){kind=icon}
返回
Robustness Meets Algorithms
.png){kind=icon}
OA
AI
DOI：10.1145/3453935.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In every corner of machine learning and statistics, there is a need for estimators that work not just in an idealized model, but even when their assumptions are violated. Unfortunately, in high dimensions, being provably robust and being efficiently computable are often at odds with each other. We give the first efficient algorithm for estimating the parameters of a high-dimensional Gaussian that is able to tolerate a constant fraction of corruptions that is independent of the dimension. Prior to our work, all known estimators either needed time exponential in the dimension to compute or could tolerate only an inverse-polynomial fraction of corruptions. Not only does our algorithm bridge the gap between robustness and algorithms, but also it turns out to be highly practical in a variety of settings.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.2
论文数:
1.2W
被引数:
3.7W
机构
引用论文
分享收藏The exon 38-containing ARHGEF11 splice isoform is differentially expressed and is required for migration and growth in invasive breast cancer cells.png)
Oncotarget
OAAI
OncotargetIF0
OAAI分享收藏Vasodilatory effects of adenosine A2 receptor agonists CGS 21680 and CGS 22492 in human vasculature
PREAI
分享收藏
查看更多内容