Tselil Schramm

Orcid: 0000-0002-8494-5778

Affiliations:
  • Stanford University, CA, USA


According to our database1, Tselil Schramm authored at least 34 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Semidefinite programs simulate approximate message passing robustly.
CoRR, 2023

Spectral clustering in the Gaussian mixture block model.
CoRR, 2023

Local and Global Expansion in Random Geometric Graphs.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Testing thresholds for high-dimensional sparse random geometric graphs.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 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

The SDP Value of Random 2CSPs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Sherali-Adams Strikes Back.
Theory Comput., 2021

Playing unique games on certified small-set expanders.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Robust Regression Revisited: Acceleration and Improved Estimation Rates.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

The Strongish Planted Clique Hypothesis and Its Consequences.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Non-asymptotic approximations of neural networks by Gaussian processes.
Proceedings of the Conference on Learning Theory, 2021

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

2020
Computational Barriers to Estimation from Low-Degree Polynomials.
CoRR, 2020

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

2019
The threshold for SDP-refutation of random regular NAE-3SAT.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

SOS Lower Bounds with Hard Constraints: Think Global, Act Local.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

A Robust Spectral Algorithm for Overcomplete Tensor Decomposition.
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

High-dimensional estimation via sum-of-squares proofs.
CoRR, 2018

Computing Exact Minimum Cuts Without Knowing the Graph.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Random Matrices and the Sum-of-Squares Hierarchy.
PhD thesis, 2017

Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors.
Random Struct. Algorithms, 2017

Strongly refuting random CSPs below the spectral threshold.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

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

Fast and robust tensor decomposition with applications to dictionary learning.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Global and Local Information in Clustering Labeled Block Models.
IEEE Trans. Inf. Theory, 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
Low-Rank Matrix Completion with Adversarial Missing Entries.
CoRR, 2015

Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program.
CoRR, 2015

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

Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs.
CoRR, 2014

Gap Amplification for Small-Set Expansion via Random Walks.
Proceedings of the Approximation, 2014


  Loading...