Samuel B. Hopkins

According to our database1, Samuel B. Hopkins authored at least 37 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Insufficient Statistics Perturbation: Stable Estimators for Private Least Squares.
CoRR, 2024

Adversarially-Robust Inference on Trees via Belief Propagation.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Insufficient Statistics Perturbation: Stable Estimators for Private Least Squares Extended Abstract.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
A quasi-polynomial time algorithm for Multi-Dimensional Scaling via LP hierarchies.
CoRR, 2023

Towards Practical Robustness Auditing for Linear Regression.
CoRR, 2023

Robustness Implies Privacy in Statistical Estimation.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Fast, Sample-Efficient, Affine-Invariant Private Mean and Covariance Estimation for Subgaussian Distributions.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Matrix discrepancy from Quantum communication.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Counterexamples to New Circular Security Assumptions Underlying iO.
IACR Cryptol. ePrint Arch., 2021

Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent.
Proceedings of the Conference on Learning Theory, 2021

2020
Robustly Learning any Clusterable Mixture of Gaussians.
CoRR, 2020

Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Subexponential LPs Approximate Max-Cut.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Smoothed Complexity of 2-player Nash Equilibria.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.
SIAM J. Comput., 2019

Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

A Robust Spectral Algorithm for Overcomplete Tensor Decomposition.
Proceedings of the Conference on Learning Theory, 2019

How Hard is Robust Mean Estimation?
Proceedings of the Conference on Learning Theory, 2019

2018
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique.
ACM Trans. Algorithms, 2018

Sum-of-Squares Meets Program Obfuscation, Revisited.
IACR Cryptol. ePrint Arch., 2018

Sub-Gaussian Mean Estimation in Polynomial Time.
CoRR, 2018

Mixture models, robustness, and sum of squares proofs.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
Bayesian estimation from few samples: community detection and related problems.
CoRR, 2017

Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

The Power of Sum-of-Squares for Detecting Hidden Structures.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015
Speeding up sum-of-squares for tensor decomposition and planted sparse vectors.
CoRR, 2015

Tensor principal component analysis via sum-of-squares proofs.
CoRR, 2015

SoS and Planted Clique: Tight Analysis of MPW Moments at all Degrees and an Optimal Lower Bound at Degree Four.
CoRR, 2015

Tensor principal component analysis via sum-of-square proofs.
Proceedings of The 28th Conference on Learning Theory, 2015


  Loading...