| Private estimation algorithms for stochastic block models and mixture models H Chen, V Cohen-Addad, T d’Orsi, A Epasto, J Imola, D Steurer, S Tiegel Advances in Neural Information Processing Systems 36, 68134-68183, 2023 | 25 | 2023 |
| A framework for searching in graphs in the presence of errors D Dereniowski, S Tiegel, P Uznanski, D Wolleb-Graf 2nd Symposium on Simplicity in Algorithms (SOSA 2019), 4: 1-4: 17, 2019 | 23 | 2019 |
| Hardness of agnostically learning halfspaces from worst-case lattice problems S Tiegel The Thirty Sixth Annual Conference on Learning Theory, 3029-3064, 2023 | 21 | 2023 |
| Optimal SQ lower bounds for learning halfspaces with massart noise R Nasser, S Tiegel Conference on Learning Theory, 1047-1074, 2022 | 16 | 2022 |
| Consistent estimation for pca and sparse regression with oblivious outliers T d'Orsi, CH Liu, R Nasser, G Novikov, D Steurer, S Tiegel Advances in Neural Information Processing Systems 34, 25427-25438, 2021 | 13 | 2021 |
| Sos degree reduction with applications to clustering and robust moment estimation D Steurer, S Tiegel Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 13 | 2021 |
| Fast algorithm for overcomplete order-3 tensor decomposition J Ding, T d’Orsi, CH Liu, D Steurer, S Tiegel Conference on Learning Theory, 3741-3799, 2022 | 10 | 2022 |
| Improved Hardness Results for Learning Intersections of Halfspaces S Tiegel The Thirty Seventh Annual Conference on Learning Theory, 4764-4786, 2024 | 5 | 2024 |
| A framework for searching in graphs in the presence of errors D Dereniowski, S Tiegel, P Uznański, D Wolleb-Graf arXiv preprint arXiv:1804.02075, 2018 | 5 | 2018 |
| Sos certifiability of subgaussian distributions and its algorithmic applications I Diakonikolas, SB Hopkins, A Pensia, S Tiegel arXiv preprint arXiv:2410.21194, 2024 | 4 | 2024 |
| Robust mean estimation without moments for symmetric distributions G Novikov, D Steurer, S Tiegel Advances in Neural Information Processing Systems 36, 34371-34409, 2023 | 3 | 2023 |
| SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More I Diakonikolas, SB Hopkins, A Pensia, S Tiegel arXiv preprint arXiv:2412.21203, 2024 | 2 | 2024 |
| Testably learning polynomial threshold functions L Slot, S Tiegel, M Wiedmer arXiv preprint arXiv:2406.06106, 2024 | 2 | 2024 |
| Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations K Bangachev, G Bresler, S Tiegel, V Vaikuntanathan arXiv preprint arXiv:2411.12512, 2024 | 1 | 2024 |
| Robust Mixture Learning when Outliers Overwhelm Small Groups D Dmitriev, RD Buhai, S Tiegel, A Wolters, G Novikov, A Sanyal, D Steurer, ... arXiv preprint arXiv:2407.15792, 2024 | 1 | 2024 |
| Computational-statistical gaps for improper learning in sparse linear regression RD Buhai, J Ding, S Tiegel The Thirty Seventh Annual Conference on Learning Theory, 752-771, 2024 | 1 | 2024 |
| Improved Robust Estimation for Erd\H {o} sR\'enyi Graphs: The Sparse Regime and Optimal Breakdown Point H Chen, J Ding, Y Hua, S Tiegel arXiv preprint arXiv:2503.03923, 2025 | | 2025 |
| Robust Mean Estimation Without a Mean: Dimension-Independent Error in Polynomial Time for Symmetric Distributions. G Novikov, D Steurer, S Tiegel CoRR, 2023 | | 2023 |
| OASIcs, Volume 69, SOSA'19, Complete Volume}} JT Fineman, M Mitzenmacher, J Alman, S Liu, RE Tarjan, D Dereniowski, ... 2nd Symposium on Simplicity in Algorithms (SOSA 2019) 69, 0, 2019 | | 2019 |
| 2nd Symposium on Simplicity in Algorithms: SOSA 2019, January 8–9, 2019, San Diego, CA, USA Co-located with the 30th ACM-SIAM Symposium on Discrete Algorithms (SODA 2019) JT Fineman, M Mitzenmacher Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2019 | | 2019 |
