TS
Tselil Schramm
cs.DScs.CCstat.MLcs.LGmath.PRmath.STstat.THmath.COcs.DMcs.IT
On Valency
published · living versionsW_h9vbz4y6·v1 · currentpublished
Preprints & journals
40 papers in the corpus · 2012–2026Averaged Annealed Markov Chains Achieve the Algorithmic Threshold for Tensor PCA, Part I: Glauber Dynamics2610.16705v1 · Aniket Das, Tselil Schramm2026 · 0 citationsarXiv
Algorithms for adaptive and heteroskedastic linear regression at the computational threshold2608.18402v2 · Spencer Compton, Tselil Schramm2026 · 0 citationsarXiv
High-Dimensional Procrustes Matching via Tree Counts2607.08538v1 · Xiaochun Niu, Tselil Schramm, Jiaming Xu2026 · 0 citationsarXiv
Easy, robust approximate message passing for planted spike models2606.00500v1 · Misha Ivkov, Tselil Schramm2026 · 0 citationsarXiv
The statistical threshold for planted matchings and spanning trees2602.07669v1 · Louigi Addario-Berry, Omer Angel, G'abor Lugosi et al.2026 · 0 citationsarXiv
Polynomial-time sampling despite disorder chaos2508.04133v1 · Eric Ma, Tselil Schramm2025 · 0 citationsarXiv
Fast, robust approximate message passing2411.02764v1 · Misha Ivkov, Tselil Schramm2024 · 1 citationarXiv
Some easy optimization problems have the overlap-gap property2411.01836v3 · Shuangping Li, Tselil Schramm2024 · 0 citationsarXiv
Discrepancy Algorithms for the Binary Perceptron2408.00796v2 · Shuangping Li, Tselil Schramm, Kangjie Zhou2024 · 3 citationsarXiv
Semidefinite programs simulate approximate message passing robustly2311.09017v1 · Misha Ivkov, Tselil Schramm2023 · 3 citationsarXiv
Spectral clustering in the Gaussian mixture block model2305.00979v4 · Shuangping Li, Tselil Schramm2023 · 4 citationsarXiv
Local and global expansion in random geometric graphs2210.00158v1 · Siqi Liu, Sidhanth Mohanty, Tselil Schramm et al.2022 · 4 citationsarXiv
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics2205.09727v2 · Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins et al.2022 · 17 citationsarXiv
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition2203.02790v1 · Samuel B. Hopkins, Tselil Schramm, Jonathan Shi2022 · 13 citationsProceedings of the Thirty-Second Conference on Learning Theory. PMLR. p. 1683--1722. 2019
Testing thresholds for high-dimensional sparse random geometric graphs2111.11316v1 · Siqi Liu, Sidhanth Mohanty, Tselil Schramm et al.2021 · 11 citationsarXiv
The SDP value of random 2CSPs2108.01038v1 · Amulya Musipatla, Ryan O'Donnell, Tselil Schramm et al.2021 · 0 citationsarXiv
Robust Regression Revisited: Acceleration and Improved Estimation Rates2106.11938v1 · Arun Jambulapati, Jerry Li, Tselil Schramm et al.2021 · 7 citationsarXiv
Non-asymptotic approximations of neural networks by Gaussian processes2102.08668v1 · Ronen Eldan, Dan Mikulincer, Tselil Schramm2021 · 7 citationsarXiv
The Strongish Planted Clique Hypothesis and Its Consequences2011.05555v1 · Pasin Manurangsi, Aviad Rubinstein, Tselil Schramm2020 · 11 citationsarXiv
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent2009.06107v3 · Matthew Brennan, Guy Bresler, Samuel B. Hopkins et al.2020 · 28 citationsarXiv
Computational Barriers to Estimation from Low-Degree Polynomials2008.02269v2 · Tselil Schramm, Alexander S. Wein2020 · 48 citationsAnnals of Statistics 2022, Vol. 50, No. 3, 1833-1858
Playing Unique Games on Certified Small-Set Expanders2006.09969v3 · Mitali Bafna, Boaz Barak, Pravesh Kothari et al.2020 · 23 citationsarXiv
Subexponential LPs Approximate Max-Cut1911.10304v2 · Samuel B. Hopkins, Tselil Schramm, Luca Trevisan2019 · 9 citationsarXiv
Sherali--Adams Strikes Back1812.09967v1 · Ryan O'Donnell, Tselil Schramm2018 · 0 citationsarXiv
SOS lower bounds with hard constraints: think global, act local1809.01207v1 · Pravesh Kothari, Ryan O'Donnell, Tselil Schramm2018 · 4 citationsarXiv
High-dimensional estimation via sum-of-squares proofs1807.11419v2 · Prasad Raghavendra, Tselil Schramm, David Steurer2018 · 37 citationsarXiv
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs1805.02349v2 · Boaz Barak, Chi-Ning Chou, Zhixian Lei et al.2018 · 38 citationsarXiv
The threshold for SDP-refutation of random regular NAE-3SAT1804.05230v1 · Yash Deshpande, Andrea Montanari, Ryan O'Donnell et al.2018 · 15 citationsarXiv
Computing exact minimum cuts without knowing the graph1711.03165v2 · Aviad Rubinstein, Tselil Schramm, S. Matthew Weinberg2017 · 6 citationsarXiv
The power of sum-of-squares for detecting hidden structures1710.05017v1 · Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin et al.2017 · 103 citationsarXiv
Fast and robust tensor decomposition with applications to dictionary learning1706.08672v1 · Tselil Schramm, David Steurer2017 · 25 citationsarXiv
Strongly Refuting Random CSPs Below the Spectral Threshold1605.00058v2 · Prasad Raghavendra, Satish Rao, Tselil Schramm2016 · 50 citationsarXiv
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors1512.02337v2 · Samuel B. Hopkins, Tselil Schramm, Jonathan Shi et al.2015 · 99 citationsarXiv
Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program1507.05136v3 · Prasad Raghavendra, Tselil Schramm2015 · 14 citationsarXiv
Symmetric Tensor Completion from Multilinear Entries and Learning Product Mixtures over the Hypercube1506.03137v3 · Tselil Schramm, Benjamin Weitz2015 · 0 citationsarXiv
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors1504.07669v2 · Ronen Eldan, Mikl'os R'acz, Tselil Schramm2015 · 43 citationsarXiv
Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs1412.0681v3 · Shuchi Chawla, Konstantin Makarychev, Tselil Schramm et al.2014 · 79 citationsarXiv
Global and Local Information in Clustering Labeled Block Models1404.6325v4 · Varun Kanade, Elchanan Mossel, Tselil Schramm2014 · 29 citationsarXiv
Gap Amplification for Small-Set Expansion via Random Walks1310.1493v3 · Prasad Raghavendra, Tselil Schramm2013 · 5 citationsarXiv
An extreme case of plant-insect codiversification: figs and fig-pollinating wasps.22848088 · Cruaud, Astrid, Rønsted, Nina, Chantarasuwan, Bhanumas et al.2013 · 397 citationsSystematic biology. 2012;61(6):1029-47
Career total: 75 works. 40 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.