Tselil Schramm
8 papers · 2017–2025 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Conference Polyglot (2) π Academic Marathon (8) π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (16) π§ Keyword Pioneer
π£
Hot Topic Early Bird
π
Cross-Pollinator
(13)
Conferences
COLT (5)
NIPS (3)
Top co-authors
Research topics
Keywords
tensor decomposition
(2)
spectral algorithm
(2)
hypothesis testing
(2)
robust regression
(1)
semidefinite programming
(1)
graph theory
(1)
graph matching
(1)
markov chain monte carlo
(1)
gaussian process
(1)
statistical query
(1)
gradient descent
(1)
overcomplete representation
(1)
sparse pca
(1)
sparse linear regression
(1)
planted clique
(1)
generalized linear model
(1)
adversarial corruption
(1)
low-degree polynomial
(1)
graph isomorphism
(1)
activation function
(1)
Papers
Some easy optimization problems have the overlap-gap property
COLT 2025
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics
NIPS 2022
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent
COLT 2021
Non-asymptotic approximations of neural networks by Gaussian processes
COLT 2021
Robust Regression Revisited: Acceleration and Improved Estimation Rates
NIPS 2021
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition
COLT 2019
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
NIPS 2019
Fast and robust tensor decomposition with applications to dictionary learning
COLT 2017