Samuel B. Hopkins
Samuel B. Hopkins
Miller Fellow, UC Berkeley
Geverifieerd e-mailadres voor - Homepage
Geciteerd door
Geciteerd door
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
Tensor principal component analysis via sum-of-squares proofs
SB Hopkins, J Shi, D Steurer
arXiv preprint arXiv:1507.03269, 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
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
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
Bayesian estimation from few samples: community detection and related problems
SB Hopkins, D Steurer
arXiv preprint arXiv:1710.00264, 2017
Sub-gaussian mean estimation in polynomial time
SB Hopkins
arXiv preprint arXiv:1809.07425, 120, 2018
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
Quantum entropy scoring for fast robust mean estimation and improved outlier detection
Y Dong, SB Hopkins, J Li
arXiv preprint arXiv:1906.11366, 2019
Statistical inference and the sum of squares method
SBK Hopkins
Robustly learning any clusterable mixture of gaussians
I Diakonikolas, SB Hopkins, D Kane, S Karmalkar
arXiv preprint arXiv:2005.06417, 2020
How Hard is Robust Mean Estimation?
SB Hopkins, J Li
Conference on Learning Theory, 1649-1682, 2019
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
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic.
E Allender, G Davie, L Friedman, S Hopkins, I Tzameret
Chicago Journal of Theoretical Computer Science 2013, 15, 2013
Sum-of-squares meets program obfuscation, revisited
B Barak, SB Hopkins, A Jain, P Kothari, A Sahai
Annual International Conference on the Theory and Applications of …, 2019
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
A robust spectral algorithm for overcomplete tensor decomposition
SB Hopkins, T Schramm, J Shi
Conference on Learning Theory, 1683-1722, 2019
Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization
SB Hopkins, J Li, F Zhang
arXiv preprint arXiv:2007.15839, 2020
Subexponential lps approximate max-cut
SB Hopkins, T Schramm, L Trevisan
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks
J Ding, SB Hopkins, D Steurer
arXiv preprint arXiv:2008.13735, 2020
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20