Samuel B. Hopkins

About Samuel B. Hopkins

Samuel B. Hopkins, With an exceptional h-index of 19 and a recent h-index of 19 (since 2020), a distinguished researcher at University of California, Berkeley, specializes in the field of Algorithms, Complexity, Machine Learning.

His recent articles reflect a diverse array of research interests and contributions to the field:

Insufficient Statistics Perturbation: Stable Estimators for Private Least Squares

Adversarially-Robust Inference on Trees via Belief Propagation

A quasi-polynomial time algorithm for Multi-Dimensional Scaling via LP hierarchies

Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation

The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination

Towards Practical Robustness Auditing for Linear Regression

Fast, sample-efficient, affine-invariant private mean and covariance estimation for subgaussian distributions

Robustness implies privacy in statistical estimation

Samuel B. Hopkins Information

University

Position

Miller Fellow

Citations(all)

1818

Citations(since 2020)

1607

Cited By

759

hIndex(all)

19

hIndex(since 2020)

19

i10Index(all)

25

i10Index(since 2020)

24

Email

University Profile Page

Google Scholar

Samuel B. Hopkins Skills & Research Interests

Algorithms

Complexity

Machine Learning

Top articles of Samuel B. Hopkins

Insufficient Statistics Perturbation: Stable Estimators for Private Least Squares

arXiv preprint arXiv:2404.15409

2024/4/23

Adversarially-Robust Inference on Trees via Belief Propagation

arXiv preprint arXiv:2404.00768

2024/3/31

A quasi-polynomial time algorithm for Multi-Dimensional Scaling via LP hierarchies

arXiv preprint arXiv:2311.17840

2023/11/29

Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation

arXiv preprint arXiv:2311.13010

2023/11/21

The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination

2023/11/6

Towards Practical Robustness Auditing for Linear Regression

arXiv preprint arXiv:2307.16315

2023/7/30

Fast, sample-efficient, affine-invariant private mean and covariance estimation for subgaussian distributions

2023/7/12

Robustness implies privacy in statistical estimation

2023/6/2

Privacy induces robustness: Information-computation gaps and sparse mean estimation

Advances in neural information processing systems

2022/12/6

The Franz-Parisi criterion and computational trade-offs in high dimensional statistics

Advances in Neural Information Processing Systems

2022/12/6

Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism

2022/6/9

Smoothed complexity of 2-player Nash equilibria

2020/11/16

Subexponential LPs approximate max-cut

2020/11/16

Statistical query algorithms and low-degree tests are almost equivalent

arXiv preprint arXiv:2009.06107

2020/9/13

Algorithms for heavy-tailed statistics: Regression, covariance estimation, and beyond

2020/6/8

Robustly learning any clusterable mixture of gaussians

arXiv preprint arXiv:2005.06417

2020/5/13

Estimating rank-one spikes from heavy-tailed noise via self-avoiding walks

Advances in Neural Information Processing Systems

2020

Robust and heavy-tailed mean estimation made simple, via regret minimization

Advances in Neural Information Processing Systems

2020

See List of Professors in Samuel B. Hopkins University(University of California, Berkeley)

Co-Authors

academic-engine