Ilias Zadik
19 papers · 2018–2026 · 4 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 ↓+6 more ↓ Show less ↑
🗺️ Taxonomy Completionist (29) 🏃 Academic Marathon · Sprint 🌍 Conference Polyglot · Bronze 🌉 Interdisciplinary Bridge · Silver 🐣 Hot Topic Early Bird
🔬
Deep Specialist
(11)
🏆
Keyword Champion
(6)
❓
The Questioner
🔥
Unstoppable · Bronze
🗃️
Keyword Collector
(94)
💎
Century Club · Bronze
Venues
Top co-authors
Research topics
Machine Learning
(19)
Optimization & Theory
(17)
Mathematics & Optimization
(16)
Mathematics
(11)
Optimization
(7)
Core Methods
(4)
Artificial Intelligence
(2)
Computer Science
(2)
Application Areas
(2)
Foundations
(2)
Statistics
(2)
Deep Learning
(1)
Architectures
(1)
Bayesian & Probabilistic · Artificial Intelligence
(1)
Bayesian & Probabilistic · Machine Learning
(1)
Keywords
phase transition
(6)
low-degree polynomial
(4)
group testing
(3)
overlap gap property
(3)
markov chain monte carlo
(2)
planted subgraph
(2)
gaussian additive model
(2)
information-theoretic bound
(2)
minimum mean squared error
(2)
computational hardness
(2)
mean squared error
(2)
statistical learning
(2)
hypothesis testing
(2)
lattice basis reduction
(2)
statistical estimation
(2)
differential privacy
(2)
sparse linear regression
(2)
random graph
(2)
average-case complexity
(2)
all-or-nothing phenomenon
(2)
Papers
Stable algorithms Lower Bounds for Estimation from MMSE Discontinuities: Extended Abstract
COLT 2026
The Monotonicity of the Franz–Parisi Potential Is Equivalent to Low-Degree MMSE Lower Bounds: Extended Abstract
COLT 2026
On the Hardness of Learning One Hidden Layer Neural Networks
ALT 2025
The Fundamental Limits of Recovering Planted Subgraphs (extended abstract)
COLT 2025
Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph: Extended Abstract
COLT 2024
Sharp thresholds in inference of planted subgraphs
COLT 2023
Archimedes Meets Privacy: On Privately Estimating Quantiles in High Dimensions Under Minimal Assumptions
NeurIPS 2022
Lattice-Based Methods Surpass Sum-of-Squares in Clustering
COLT 2022
Statistical and Computational Phase Transitions in Group Testing
COLT 2022
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics
NeurIPS 2022
Group testing and local search: is there a computational-statistical gap?
COLT 2021
It was “all” for “nothing”: sharp phase transitions for noiseless discrete channels
COLT 2021
On the Cryptographic Hardness of Learning Single Periodic Neurons
NeurIPS 2021
Free Energy Wells and Overlap Gap Property in Sparse PCA
COLT 2020
Optimal Private Median Estimation under Minimal Distributional Assumptions
NeurIPS 2020
The All-or-Nothing Phenomenon in Sparse Tensor PCA
NeurIPS 2020
The All-or-Nothing Phenomenon in Sparse Linear Regression
COLT 2019
High Dimensional Linear Regression using Lattice Basis Reduction
NeurIPS 2018
Orthogonal Machine Learning: Power and Limitations
ICML 2018