Tselil Schramm

66 papers A* 22A 4Journal 37Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Discrepancy Algorithms for the Binary Perceptron. STOC Shuangping Li, Tselil Schramm, Kangjie Zhou
2025	A*	`conf`	Fast, Robust Approximate Message Passing. STOC Misha Ivkov, Tselil Schramm
2025	J	`jnl`	Polynomial-time sampling despite disorder chaos. CoRR Eric Ma, Tselil Schramm
2025	A*	`conf`	Some easy optimization problems have the overlap-gap property. COLT Shuangping Li, Tselil Schramm
2024	J	`jnl`	Discrepancy Algorithms for the Binary Perceptron. CoRR Shuangping Li, Tselil Schramm, Kangjie Zhou
2024	J	`jnl`	Fast, robust approximate message passing. CoRR Misha Ivkov, Tselil Schramm
2024	A*	`conf`	Semidefinite Programs Simulate Approximate Message Passing Robustly. STOC Misha Ivkov, Tselil Schramm
2024	J	`jnl`	Some easy optimization problems have the overlap-gap property. CoRR Shuangping Li, Tselil Schramm
2023	A*	`conf`	Local and Global Expansion in Random Geometric Graphs. STOC Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang
2023	J	`jnl`	Semidefinite programs simulate approximate message passing robustly. CoRR Misha Ivkov, Tselil Schramm
2023	J	`jnl`	Spectral clustering in the Gaussian mixture block model. CoRR Shuangping Li, Tselil Schramm
2022	J	`jnl`	A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. CoRR Samuel B. Hopkins, Tselil Schramm, Jonathan Shi
2022	J	`jnl`	Local and global expansion in random geometric graphs. CoRR Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang
2022	A*	`conf`	Testing thresholds for high-dimensional sparse random geometric graphs. STOC Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang
2022	A*	`conf`	The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. NeurIPS Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik
2022	J	`jnl`	The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. CoRR Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik
2022	A*	`conf`	The SDP Value of Random 2CSPs. ICALP Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, Xinyu Wu
2021	A*	`conf`	Non-asymptotic approximations of neural networks by Gaussian processes. COLT Ronen Eldan, Dan Mikulincer, Tselil Schramm
2021	J	`jnl`	Non-asymptotic approximations of neural networks by Gaussian processes. CoRR Ronen Eldan, Dan Mikulincer, Tselil Schramm
2021	A*	`conf`	Playing unique games on certified small-set expanders. STOC Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer
2021	A*	`conf`	Robust Regression Revisited: Acceleration and Improved Estimation Rates. NeurIPS Arun Jambulapati, Jerry Li, Tselil Schramm, Kevin Tian
2021	J	`jnl`	Robust Regression Revisited: Acceleration and Improved Estimation Rates. CoRR Arun Jambulapati, Jerry Li, Tselil Schramm, Kevin Tian
2021	J	`jnl`	Sherali-Adams Strikes Back. Theory Comput. Ryan O'Donnell, Tselil Schramm
2021	A*	`conf`	Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. COLT Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm
2021	J	`jnl`	Testing thresholds for high-dimensional sparse random geometric graphs. CoRR Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang
2021	J	`jnl`	The SDP value of random 2CSPs. CoRR Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, Xinyu Wu
2021	A	`conf`	The Strongish Planted Clique Hypothesis and Its Consequences. ITCS Pasin Manurangsi, Aviad Rubinstein, Tselil Schramm
2020	J	`jnl`	Computational Barriers to Estimation from Low-Degree Polynomials. CoRR Tselil Schramm, Alexander S. Wein
2020	J	`jnl`	Playing Unique Games on Certified Small-Set Expanders. CoRR Mitali Bafna, Boaz Barak, Pravesh Kothari, Tselil Schramm, David Steurer
2020	J	`jnl`	Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent. CoRR Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm
2020	A*	`conf`	Subexponential LPs Approximate Max-Cut. FOCS Samuel B. Hopkins, Tselil Schramm, Luca Trevisan
2020	J	`jnl`	The Strongish Planted Clique Hypothesis and Its Consequences. CoRR Pasin Manurangsi, Aviad Rubinstein, Tselil Schramm
2019	A*	`conf`	(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. NeurIPS Boaz Barak, Chi-Ning Chou, Zhixian Lei, Tselil Schramm, Yueqi Sheng
2019	A*	`conf`	A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. COLT Samuel B. Hopkins, Tselil Schramm, Jonathan Shi
2019	A	`conf`	SOS Lower Bounds with Hard Constraints: Think Global, Act Local. ITCS Pravesh K. Kothari, Ryan O'Donnell, Tselil Schramm
2019	A	`conf`	Sherali - Adams Strikes Back. CCC Ryan O'Donnell, Tselil Schramm
2019	J	`jnl`	Subexponential LPs Approximate Max-Cut. CoRR Samuel B. Hopkins, Tselil Schramm, Luca Trevisan
2019	A*	`conf`	The threshold for SDP-refutation of random regular NAE-3SAT. SODA Yash Deshpande, Andrea Montanari, Ryan O'Donnell, Tselil Schramm, Subhabrata Sen
2018	J	`jnl`	(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. CoRR Boaz Barak, Chi-Ning Chou, Zhixian Lei, Tselil Schramm, Yueqi Sheng
2018	A	`conf`	Computing Exact Minimum Cuts Without Knowing the Graph. ITCS Aviad Rubinstein, Tselil Schramm, S. Matthew Weinberg
2018	J	`jnl`	High-dimensional estimation via sum-of-squares proofs. CoRR Prasad Raghavendra, Tselil Schramm, David Steurer
2018	J	`jnl`	On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. ACM Trans. Algorithms Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm
2018	J	`jnl`	SOS lower bounds with hard constraints: think global, act local. CoRR Pravesh Kothari, Ryan O'Donnell, Tselil Schramm
2018	J	`jnl`	Sherali-Adams Strikes Back. CoRR Ryan O'Donnell, Tselil Schramm
2018	J	`jnl`	The threshold for SDP-refutation of random regular NAE-3SAT. CoRR Yash Deshpande, Andrea Montanari, Ryan O'Donnell, Tselil Schramm, Subhabrata Sen
2017	J	`jnl`	Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors. Random Struct. Algorithms Ronen Eldan, Miklós Z. Rácz, Tselil Schramm
2017	J	`jnl`	Computing exact minimum cuts without knowing the graph. CoRR Aviad Rubinstein, Tselil Schramm, S. Matthew Weinberg
2017	A*	`conf`	Fast and robust tensor decomposition with applications to dictionary learning. COLT Tselil Schramm, David Steurer
2017	J	`jnl`	Fast and robust tensor decomposition with applications to dictionary learning. CoRR Tselil Schramm, David Steurer
2017	—	`—`	Random Matrices and the Sum-of-Squares Hierarchy. Tselil Schramm
2017	A*	`conf`	Strongly refuting random CSPs below the spectral threshold. STOC Prasad Raghavendra, Satish Rao, Tselil Schramm
2017	A*	`conf`	The Power of Sum-of-Squares for Detecting Hidden Structures. FOCS Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer
2017	J	`jnl`	The power of sum-of-squares for detecting hidden structures. CoRR Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer
2016	A*	`conf`	Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. STOC Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer
2016	J	`jnl`	Global and Local Information in Clustering Labeled Block Models. IEEE Trans. Inf. Theory Varun Kanade, Elchanan Mossel, Tselil Schramm
2016	A*	`conf`	On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. SODA Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm
2016	J	`jnl`	Strongly Refuting Random CSPs Below the Spectral Threshold. CoRR Prasad Raghavendra, Satish Rao, Tselil Schramm
2015	J	`jnl`	Low-Rank Matrix Completion with Adversarial Missing Entries. CoRR Tselil Schramm, Benjamin Weitz
2015	A*	`conf`	Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs. STOC Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev
2015	J	`jnl`	Speeding up sum-of-squares for tensor decomposition and planted sparse vectors. CoRR Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer
2015	J	`jnl`	Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program. CoRR Prasad Raghavendra, Tselil Schramm
2014	—	`conf`	Gap Amplification for Small-Set Expansion via Random Walks. APPROX-RANDOM Prasad Raghavendra, Tselil Schramm
2014	—	`conf`	Global and Local Information in Clustering Labeled Block Models. APPROX-RANDOM Varun Kanade, Elchanan Mossel, Tselil Schramm
2014	J	`jnl`	Global and Local Information in Clustering Labeled Block Models. CoRR Varun Kanade, Elchanan Mossel, Tselil Schramm
2014	J	`jnl`	Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs. CoRR Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev
2013	J	`jnl`	Gap Amplification for Small-Set Expansion via Random Walks. CoRR Prasad Raghavendra, Tselil Schramm