Tselil Schramm
9 papers · 2017–2026 · 2 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π£ Hot Topic Early Bird π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver π Conference Polyglot Β· Bronze πΊοΈ Taxonomy Completionist (18)
π§¬
Topic Evolution
ποΈ
Keyword Collector
(50)
Venues
Top co-authors
Research topics
Keywords
spectral algorithm
(2)
markov chain monte carlo
(2)
tensor decomposition
(2)
hypothesis testing
(2)
graph theory
(1)
graph matching
(1)
robust optimization
(1)
gaussian process
(1)
semidefinite programming
(1)
sparse principal component analysis
(1)
statistical query
(1)
approximate sampling
(1)
gradient descent
(1)
overcomplete representation
(1)
sparse linear regression
(1)
sparse pca
(1)
robust regression
(1)
planted clique
(1)
statistical learning
(1)
dictionary learning
(1)
Papers
Polynomial-time sampling despite disorder chaos
COLT 2026
Some easy optimization problems have the overlap-gap property
COLT 2025
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics
NeurIPS 2022
Non-asymptotic approximations of neural networks by Gaussian processes
COLT 2021
Robust Regression Revisited: Acceleration and Improved Estimation Rates
NeurIPS 2021
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent
COLT 2021
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition
COLT 2019
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
NeurIPS 2019
Fast and robust tensor decomposition with applications to dictionary learning
COLT 2017