default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamuel B. Hopkins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]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: 750-751- [c27]Samuel B. Hopkins, Anqi Li:
Adversarially-Robust Inference on Trees via Belief Propagation. COLT 2024: 2389-2417 - [i35]Samuel B. Hopkins, Anqi Li:
Adversarially-Robust Inference on Trees via Belief Propagation. CoRR abs/2404.00768 (2024) - [i34]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 abs/2404.15409 (2024) - [i33]Ittai Rubinstein, Samuel B. Hopkins:
Robustness Auditing for Linear Regression: To Singularity and Beyond. CoRR abs/2410.07916 (2024) - [i32]Ilias Diakonikolas, Samuel B. Hopkins, Ankit Pensia, Stefan Tiegel:
SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications. CoRR abs/2410.21194 (2024) - [i31]Ilias Diakonikolas, Samuel B. Hopkins, Ankit Pensia, Stefan Tiegel:
SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More. CoRR abs/2412.21203 (2024) - 2023
- [c26]Gavin Brown, Samuel B. Hopkins, Adam D. Smith:
Fast, Sample-Efficient, Affine-Invariant Private Mean and Covariance Estimation for Subgaussian Distributions. COLT 2023: 5578-5579 - [c25]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: 2159-2168 - [c24]Samuel B. Hopkins, Gautam Kamath
, Mahbod Majid, Shyam Narayanan:
Robustness Implies Privacy in Statistical Estimation. STOC 2023: 497-506 - [i30]Gavin Brown, Samuel B. Hopkins, Adam D. Smith:
Fast, Sample-Efficient, Affine-Invariant Private Mean and Covariance Estimation for Subgaussian Distributions. CoRR abs/2301.12250 (2023) - [i29]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 abs/2307.10273 (2023) - [i28]Daniel Freund, Samuel B. Hopkins:
Towards Practical Robustness Auditing for Linear Regression. CoRR abs/2307.16315 (2023) - [i27]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 abs/2311.17840 (2023) - 2022
- [c23]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 - [c22]Kristian Georgiev, Samuel B. Hopkins:
Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation. NeurIPS 2022 - [c21]Samuel B. Hopkins, Prasad Raghavendra, Abhishek Shetty:
Matrix discrepancy from Quantum communication. STOC 2022: 637-648 - [c20]Samuel B. Hopkins, Gautam Kamath, Mahbod Majid:
Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism. STOC 2022: 1406-1417 - [i26]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi:
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. CoRR abs/2203.02790 (2022) - [i25]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 abs/2205.09727 (2022) - [i24]Kristian Georgiev, Samuel B. Hopkins:
Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation. CoRR abs/2211.00724 (2022) - [i23]Samuel B. Hopkins, Gautam Kamath, Mahbod Majid, Shyam Narayanan:
Robustness Implies Privacy in Statistical Estimation. CoRR abs/2212.05015 (2022) - 2021
- [c19]Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm:
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. COLT 2021: 774 - [c18]Samuel B. Hopkins, Aayush Jain, Huijia Lin:
Counterexamples to New Circular Security Assumptions Underlying iO. CRYPTO (2) 2021: 673-700 - [i22]Samuel B. Hopkins, Prasad Raghavendra, Abhishek Shetty:
Matrix Discrepancy from Quantum Communication. CoRR abs/2110.10099 (2021) - [i21]Samuel B. Hopkins, Gautam Kamath, Mahbod Majid:
Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanism. CoRR abs/2111.12981 (2021) - [i20]Samuel B. Hopkins, Aayush Jain, Huijia Lin:
Counterexamples to New Circular Security Assumptions Underlying iO. IACR Cryptol. ePrint Arch. 2021: 889 (2021) - 2020
- [c17]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: 149-159 - [c16]Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein:
Smoothed Complexity of 2-player Nash Equilibria. FOCS 2020: 271-282 - [c15]Samuel B. Hopkins, Tselil Schramm, Luca Trevisan:
Subexponential LPs Approximate Max-Cut. FOCS 2020: 943-953 - [c14]Jingqiu Ding, Samuel B. Hopkins, David Steurer:
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks. NeurIPS 2020 - [c13]Samuel B. Hopkins, Jerry Li, Fred Zhang:
Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization. NeurIPS 2020 - [c12]Yeshwanth Cherapanamjeri, Samuel B. Hopkins, Tarun Kathuria, Prasad Raghavendra, Nilesh Tripuraneni:
Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond. STOC 2020: 601-609 - [i19]Ilias Diakonikolas, Samuel B. Hopkins, Daniel Kane, Sushrut Karmalkar:
Robustly Learning any Clusterable Mixture of Gaussians. CoRR abs/2005.06417 (2020) - [i18]Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein:
Smoothed Complexity of 2-player Nash Equilibria. CoRR abs/2007.10857 (2020) - [i17]Samuel B. Hopkins, Jerry Li, Fred Zhang:
Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization. CoRR abs/2007.15839 (2020) - [i16]Jingqiu Ding, Samuel B. Hopkins, David Steurer:
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks. CoRR abs/2008.13735 (2020) - [i15]Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm:
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent. CoRR abs/2009.06107 (2020)
2010 – 2019
- 2019
- [j2]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): 687-735 (2019) - [c11]Samuel B. Hopkins, Jerry Li:
How Hard is Robust Mean Estimation? COLT 2019: 1649-1682 - [c10]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi:
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. COLT 2019: 1683-1722 - [c9]Boaz Barak, Samuel B. Hopkins, Aayush Jain, Pravesh Kothari, Amit Sahai:
Sum-of-Squares Meets Program Obfuscation, Revisited. EUROCRYPT (1) 2019: 226-250 - [c8]Yihe Dong, Samuel B. Hopkins, Jerry Li:
Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection. NeurIPS 2019: 6065-6075 - [i14]Samuel B. Hopkins, Jerry Li:
How Hard Is Robust Mean Estimation? CoRR abs/1903.07870 (2019) - [i13]Yihe Dong, Samuel B. Hopkins, Jerry Li:
Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection. CoRR abs/1906.11366 (2019) - [i12]Samuel B. Hopkins, Tselil Schramm, Luca Trevisan:
Subexponential LPs Approximate Max-Cut. CoRR abs/1911.10304 (2019) - [i11]Yeshwanth Cherapanamjeri, Samuel B. Hopkins, Tarun Kathuria, Prasad Raghavendra, Nilesh Tripuraneni:
Algorithms for Heavy-Tailed Statistics: Regression, Covariance Estimation, and Beyond. CoRR abs/1912.11071 (2019) - 2018
- [j1]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): 28:1-28:31 (2018) - [c7]Samuel B. Hopkins, Jerry Li:
Mixture models, robustness, and sum of squares proofs. STOC 2018: 1021-1034 - [i10]Samuel B. Hopkins:
Sub-Gaussian Mean Estimation in Polynomial Time. CoRR abs/1809.07425 (2018) - [i9]Boaz Barak, Samuel B. Hopkins, Aayush Jain, Pravesh Kothari, Amit Sahai:
Sum-of-Squares Meets Program Obfuscation, Revisited. IACR Cryptol. ePrint Arch. 2018: 1237 (2018) - 2017
- [c6]Samuel B. Hopkins, David Steurer:
Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems. FOCS 2017: 379-390 - [c5]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: 720-731 - [i8]Samuel B. Hopkins, David Steurer:
Bayesian estimation from few samples: community detection and related problems. CoRR abs/1710.00264 (2017) - [i7]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 abs/1710.05017 (2017) - [i6]Samuel B. Hopkins, Jerry Li:
Mixture Models, Robustness, and Sum of Squares Proofs. CoRR abs/1711.07454 (2017) - 2016
- [c4]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: 428-437 - [c3]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: 1079-1095 - [c2]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: 178-191 - [i5]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 abs/1604.03084 (2016) - [i4]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. TR16 (2016) - 2015
- [c1]Samuel B. Hopkins, Jonathan Shi, David Steurer:
Tensor principal component analysis via sum-of-square proofs. COLT 2015: 956-1006 - [i3]Samuel B. Hopkins, Jonathan Shi, David Steurer:
Tensor principal component analysis via sum-of-squares proofs. CoRR abs/1507.03269 (2015) - [i2]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 abs/1507.05230 (2015) - [i1]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer:
Speeding up sum-of-squares for tensor decomposition and planted sparse vectors. CoRR abs/1512.02337 (2015)
Coauthor Index
aka: Pravesh K. Kothari
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-26 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
