Samuel B. Hopkins

Citado por

	Total	Desde 2020
Citas	2306	1950
Índice h	21	21
Índice i10	26	25

560

280

140

420

201620172018201920202021202220232024202544 59 88 141 222 259 433 456 558 20

Acceso público

Ver todo

19 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

David SteurerETH ZürichDirección de correo verificada de inf.ethz.ch
Tselil SchrammStanford UniversityDirección de correo verificada de stanford.edu
Pravesh K. KothariPrinceton UniversityDirección de correo verificada de cs.cmu.edu
Jerry LiUniversity of WashingtonDirección de correo verificada de cs.washington.edu
Aaron PotechinUniversity of ChicagoDirección de correo verificada de uchicago.edu
Jonathan ShiDirección de correo verificada de cornell.edu
Prasad RaghavendraProfessor, University of California BerkeleyDirección de correo verificada de cs.berkeley.edu
Boaz BarakHarvard UniversityDirección de correo verificada de boazbarak.org
Ilias DiakonikolasUniversity of Wisconsin-MadisonDirección de correo verificada de wisc.edu
Gautam KamathAssistant Professor @ University of Waterloo, Faculty Member @ Vector InstituteDirección de correo verificada de uwaterloo.ca
Mahbod MajidPhD Student, Carnegie Mellon UniverityDirección de correo verificada de andrew.cmu.edu
Ankur MoitraNorbert Wiener Professor of Mathematics, MITDirección de correo verificada de mit.edu
Sushrut KarmalkarUniversity of Wisconsin-MadisonDirección de correo verificada de cs.utexas.edu
Daniel KaneUniversity of California, San DiegoDirección de correo verificada de ucsd.edu
Shyam NarayananPhD Student, MITDirección de correo verificada de mit.edu
Yihe DongPrinceton UniversityDirección de correo verificada de princeton.edu
Ainesh BakshiMassachusetts Institute of TechnologyDirección de correo verificada de cs.cmu.edu
Fred ZhangGoogle DeepMindDirección de correo verificada de berkeley.edu
Guy BreslerMITDirección de correo verificada de mit.edu
Adam SmithProfessor of Computer Science, Boston UniversityDirección de correo verificada de bu.edu

Seguir

Samuel B. Hopkins

Massachusetts Institute of Technology

Dirección de correo verificada de mit.edu - Página principal

Algorithms Complexity Machine Learning


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
A nearly tight sum-of-squares lower bound for the planted clique problem B Barak, S Hopkins, J Kelner, PK Kothari, A Moitra, A Potechin SIAM Journal on Computing 48 (2), 687-735, 2019	285	2019
Mixture models, robustness, and sum of squares proofs SB Hopkins, J Li Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	207	2018
Tensor principal component analysis via sum-of-squares proofs SB Hopkins, J Shi, D Steurer arXiv preprint arXiv:1507.03269, 2015	197	2015
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors SB Hopkins, T Schramm, J Shi, D Steurer arXiv preprint arXiv:1512.02337, 2016	169	2016
Bayesian estimation from few samples: community detection and related problems SB Hopkins, D Steurer arXiv preprint arXiv:1710.00264, 2017	162*	2017
The power of sum-of-squares for detecting hidden structures SB Hopkins, PK Kothari, A Potechin, P Raghavendra, T Schramm, ... 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017	161	2017
Sub-gaussian mean estimation in polynomial time SB Hopkins arXiv preprint arXiv:1809.07425 120, 2018	135*	2018
Statistical inference and the sum of squares method S Hopkins Cornell University, 2018	127	2018
Quantum entropy scoring for fast robust mean estimation and improved outlier detection Y Dong, S Hopkins, J Li Advances in Neural Information Processing Systems 32, 2019	115	2019
Robust and heavy-tailed mean estimation made simple, via regret minimization S Hopkins, J Li, F Zhang Advances in Neural Information Processing Systems 33, 11902-11912, 2020	78	2020
Statistical query algorithms and low-degree tests are almost equivalent M Brennan, G Bresler, SB Hopkins, J Li, T Schramm arXiv preprint arXiv:2009.06107, 2020	74	2020
Robustly learning any clusterable mixture of gaussians I Diakonikolas, SB Hopkins, D Kane, S Karmalkar arXiv preprint arXiv:2005.06417, 2020	74*	2020
Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism SB Hopkins, G Kamath, M Majid Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022	73	2022
On the integrality gap of degree-4 sum of squares for planted clique SB Hopkins, P Kothari, AH Potechin, P Raghavendra, T Schramm ACM Transactions on Algorithms (TALG) 14 (3), 1-31, 2018	70*	2018
Robustness implies privacy in statistical estimation SB Hopkins, G Kamath, M Majid, S Narayanan Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 497-506, 2023	62	2023
Algorithms for heavy-tailed statistics: Regression, covariance estimation, and beyond Y Cherapanamjeri, SB Hopkins, T Kathuria, P Raghavendra, ... Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020	50	2020
The Franz-Parisi criterion and computational trade-offs in high dimensional statistics AS Bandeira, A El Alaoui, S Hopkins, T Schramm, AS Wein, I Zadik Advances in Neural Information Processing Systems 35, 33831-33844, 2022	41	2022
How hard is robust mean estimation? SB Hopkins, J Li Conference on learning theory, 1649-1682, 2019	39	2019
A robust spectral algorithm for overcomplete tensor decomposition SB Hopkins, T Schramm, J Shi Conference on Learning Theory, 1683-1722, 2019	29	2019
Privacy induces robustness: Information-computation gaps and sparse mean estimation K Georgiev, S Hopkins Advances in neural information processing systems 35, 6829-6842, 2022	27	2022

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores