Samuel B. Hopkins

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 58

Top Topics

Related Problems

Nash Equilibria

Statistical Estimation

Regret Minimization

Top Venues

Publications

Gavin Brown, Jonathan Hayase, Samuel B. Hopkins, Weihao Kong, Xiyang Liu, Sewoong Oh, Juan C. Perdomo, Adam Smith
Insufficient Statistics Perturbation: Stable Estimators for Private Least Squares. CoRR (2024)
Samuel B. Hopkins, Anqi Li
Adversarially-Robust Inference on Trees via Belief Propagation. COLT (2024)
Samuel B. Hopkins, Anqi Li
Adversarially-Robust Inference on Trees via Belief Propagation. CoRR (2024)
Gavin Brown, Jonathan Hayase, Samuel B. Hopkins, Weihao Kong, Xiyang Liu, Sewoong Oh, Juan C. Perdomo, Adam Smith
Insufficient Statistics Perturbation: Stable Estimators for Private Least Squares Extended Abstract. COLT (2024)
Samuel B. Hopkins, Gautam Kamath, Mahbod Majid, Shyam Narayanan
Robustness Implies Privacy in Statistical Estimation. STOC (2023)
Clément L. Canonne, Samuel B. Hopkins, Jerry Li, Allen Liu, Shyam Narayanan
The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination. FOCS (2023)
Shivam Gupta, Samuel B. Hopkins, Eric Price
Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation. CoRR (2023)
Clément L. Canonne, Samuel B. Hopkins, Jerry Li, Allen Liu, Shyam Narayanan
The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination. CoRR (2023)
Gavin Brown, Samuel B. Hopkins, Adam D. Smith
Fast, Sample-Efficient, Affine-Invariant Private Mean and Covariance Estimation for Subgaussian Distributions. CoRR (2023)
Ainesh Bakshi, Vincent Cohen-Addad, Samuel B. Hopkins, Rajesh Jayaram, Silvio Lattanzi
A quasi-polynomial time algorithm for Multi-Dimensional Scaling via LP hierarchies. CoRR (2023)
Daniel Freund, Samuel B. Hopkins
Towards Practical Robustness Auditing for Linear Regression. CoRR (2023)
Samuel B. Hopkins, Gautam Kamath, Mahbod Majid, Shyam Narayanan
Robustness Implies Privacy in Statistical Estimation. CoRR (2022)
Samuel B. Hopkins, Gautam Kamath, Mahbod Majid
Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism. STOC (2022)
Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. NeurIPS (2022)
Samuel B. Hopkins, Prasad Raghavendra, Abhishek Shetty
Matrix discrepancy from Quantum communication. STOC (2022)
Kristian Georgiev, Samuel B. Hopkins
Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation. NeurIPS (2022)
Kristian Georgiev, Samuel B. Hopkins
Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation. CoRR (2022)
Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. CoRR (2022)
Samuel B. Hopkins, Tselil Schramm, Jonathan Shi
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. CoRR (2022)
Samuel B. Hopkins, Aayush Jain, Huijia Lin
Counterexamples to New Circular Security Assumptions Underlying iO. CRYPTO (2) (2021)
Samuel B. Hopkins, Aayush Jain, Huijia Lin
Counterexamples to New Circular Security Assumptions Underlying iO. IACR Cryptol. ePrint Arch. 2021 (2021)
Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. COLT (2021)
Samuel B. Hopkins, Gautam Kamath, Mahbod Majid
Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanism. CoRR (2021)
Samuel B. Hopkins, Prasad Raghavendra, Abhishek Shetty
Matrix Discrepancy from Quantum Communication. CoRR (2021)
Samuel B. Hopkins, Jerry Li, Fred Zhang
Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization. CoRR (2020)
Jingqiu Ding, Samuel B. Hopkins, David Steurer
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks. NeurIPS (2020)
Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein
Smoothed Complexity of 2-player Nash Equilibria. FOCS (2020)
Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein
Smoothed Complexity of 2-player Nash Equilibria. CoRR (2020)
Samuel B. Hopkins, Jerry Li, Fred Zhang
Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization. NeurIPS (2020)
Ainesh Bakshi, Ilias Diakonikolas, Samuel B. Hopkins, Daniel Kane, Sushrut Karmalkar, Pravesh K. Kothari
Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures. FOCS (2020)
Yeshwanth Cherapanamjeri, Samuel B. Hopkins, Tarun Kathuria, Prasad Raghavendra, Nilesh Tripuraneni
Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond. STOC (2020)
Samuel B. Hopkins, Tselil Schramm, Luca Trevisan
Subexponential LPs Approximate Max-Cut. FOCS (2020)
Jingqiu Ding, Samuel B. Hopkins, David Steurer
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks. CoRR (2020)
Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent. CoRR (2020)
Ilias Diakonikolas, Samuel B. Hopkins, Daniel Kane, Sushrut Karmalkar
Robustly Learning any Clusterable Mixture of Gaussians. CoRR (2020)
Yeshwanth Cherapanamjeri, Samuel B. Hopkins, Tarun Kathuria, Prasad Raghavendra, Nilesh Tripuraneni
Algorithms for Heavy-Tailed Statistics: Regression, Covariance Estimation, and Beyond. CoRR (2019)
Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh K. Kothari, Ankur Moitra, Aaron Potechin
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. SIAM J. Comput. 48 (2) (2019)
Samuel B. Hopkins, Tselil Schramm, Jonathan Shi
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. COLT (2019)
Yihe Dong, Samuel B. Hopkins, Jerry Li
Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection. NeurIPS (2019)
Boaz Barak, Samuel B. Hopkins, Aayush Jain, Pravesh Kothari, Amit Sahai
Sum-of-Squares Meets Program Obfuscation, Revisited. EUROCRYPT (1) (2019)
Samuel B. Hopkins, Jerry Li
How Hard is Robust Mean Estimation? COLT (2019)
Samuel B. Hopkins, Jerry Li
How Hard Is Robust Mean Estimation? CoRR (2019)
Yihe Dong, Samuel B. Hopkins, Jerry Li
Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection. CoRR (2019)
Samuel B. Hopkins, Tselil Schramm, Luca Trevisan
Subexponential LPs Approximate Max-Cut. CoRR (2019)
Boaz Barak, Samuel B. Hopkins, Aayush Jain, Pravesh Kothari, Amit Sahai
Sum-of-Squares Meets Program Obfuscation, Revisited. IACR Cryptol. ePrint Arch. 2018 (2018)
Samuel B. Hopkins
Sub-Gaussian Mean Estimation in Polynomial Time. CoRR (2018)
Samuel B. Hopkins, Jerry Li
Mixture models, robustness, and sum of squares proofs. STOC (2018)
Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. ACM Trans. Algorithms 14 (3) (2018)
Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer
The power of sum-of-squares for detecting hidden structures. CoRR (2017)
Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer
The Power of Sum-of-Squares for Detecting Hidden Structures. FOCS (2017)
Samuel B. Hopkins, David Steurer
Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems. FOCS (2017)
Samuel B. Hopkins, Jerry Li
Mixture Models, Robustness, and Sum of Squares Proofs. CoRR (2017)
Samuel B. Hopkins, David Steurer
Bayesian estimation from few samples: community detection and related problems. CoRR (2017)
Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. FOCS (2016)
Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. CoRR (2016)
Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. Electron. Colloquium Comput. Complex. 23 (2016)
Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. STOC (2016)
Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. SODA (2016)
Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin
SoS and Planted Clique: Tight Analysis of MPW Moments at all Degrees and an Optimal Lower Bound at Degree Four. CoRR (2015)
Samuel B. Hopkins, Jonathan Shi, David Steurer
Tensor principal component analysis via sum-of-square proofs. COLT (2015)
Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer
Speeding up sum-of-squares for tensor decomposition and planted sparse vectors. CoRR (2015)
Samuel B. Hopkins, Jonathan Shi, David Steurer
Tensor principal component analysis via sum-of-squares proofs. CoRR (2015)