Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1704.05120
Cited By
Does robustness imply tractability? A lower bound for planted clique in the semi-random model
17 April 2017
Jacob Steinhardt
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Does robustness imply tractability? A lower bound for planted clique in the semi-random model"
6 / 6 papers shown
Title
How Does Unlabeled Data Provably Help Out-of-Distribution Detection?
Xuefeng Du
Zhen Fang
Ilias Diakonikolas
Yixuan Li
OODD
48
28
0
05 Feb 2024
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models
Flavio Chierichetti
A. Panconesi
Giuseppe Re
Luca Trevisan
AAML
22
2
0
10 Aug 2021
Statistical and computational thresholds for the planted
k
k
k
-densest sub-hypergraph problem
Luca Corinzia
Paolo Penna
Wojtek Szpankowski
J. M. Buhmann
20
6
0
23 Nov 2020
Sever: A Robust Meta-Algorithm for Stochastic Optimization
Ilias Diakonikolas
Gautam Kamath
D. Kane
Jerry Li
Jacob Steinhardt
Alistair Stewart
23
288
0
07 Mar 2018
Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers
Jacob Steinhardt
Moses Charikar
Gregory Valiant
39
138
0
15 Mar 2017
Improved Graph Clustering
Yudong Chen
Sujay Sanghavi
Huan Xu
94
191
0
11 Oct 2012
1