Christos Tzamos
41 papers · 2017–2025 · 6 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 ↓+10 more ↓ Show less ↑
๐บ๏ธ Taxonomy Completionist (49) ๐ Conference Polyglot ยท Silver ๐ Academic Marathon ยท Sprint ๐ Interdisciplinary Bridge ยท Silver ๐ฃ Hot Topic Early Bird
๐ฌ
Deep Specialist
(15)
๐
Grand Slam
๐
Keyword Champion
(2)
๐ค
Dynamic Duo
(16)
๐
Renaissance Researcher
(5)
๐ฅ
Unstoppable ยท Bronze
โก
Prolific Year ยท Productive
๐
Century Club ยท Bronze
๐
Trend Setter
๐๏ธ
Keyword Collector
(184)
Top co-authors
Research topics
Machine Learning
(37)
Optimization & Theory
(28)
Core Methods
(25)
Mathematics & Optimization
(20)
Optimization
(17)
Learning Types
(16)
Mathematics
(6)
Artificial Intelligence
(3)
Computer Science
(3)
Foundations
(3)
Deep Learning
(2)
Application Areas
(2)
Architectures
(2)
Data Science & Analytics
(1)
Reinforcement Learning
(1)
Keywords
massart noise
(7)
stochastic optimization
(5)
halfspace learning
(5)
query complexity
(4)
pac learning
(4)
sample complexity
(4)
stochastic gradient descent
(4)
adversarial label noise
(4)
maximum likelihood estimation
(3)
online learning
(3)
truncated sample
(3)
log-concave distribution
(3)
online algorithm
(2)
bandit setting
(2)
mistake bound
(2)
approximation algorithm
(2)
non-convex optimization
(2)
active learning
(2)
statistical query
(2)
expectation maximization
(2)
Papers
Online Linear Classification with Massart Noise
ICML 2025
Oracle efficient truncated statistics
ICLR 2025
Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise
ICML 2025
Active Classification with Few Queries under Misspecification
NeurIPS 2024
Contextual Pandoraโs Box
AAAI 2024
Fast Co-Training under Weak Dependence via Stream-Based Active Learning
ICML 2024
Optimization Can Learn Johnson Lindenstrauss Embeddings
NeurIPS 2024
Buying Information for Stochastic Optimization
ICML 2023
Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions
COLT 2023
First Order Stochastic Optimization with Oblivious Noise
NeurIPS 2023
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Method
NeurIPS 2023
Self-Directed Linear Classification
COLT 2023
The Gain from Ordering in Online Learning
NeurIPS 2023
Weitzman's Rule for Pandora's Box with Correlations
NeurIPS 2023
Clustering with Queries under Semi-Random Noise
COLT 2022
Learning a Single Neuron with Adversarial Label Noise via Gradient Descent
COLT 2022
Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent
ICML 2022
Linear Label Ranking with Bounded Noise
NeurIPS 2022
Online Learning for Min Sum Set Cover and Pandoraโs Box
ICML 2022
Perfect Sampling from Pairwise Comparisons
NeurIPS 2022
Agnostic Proper Learning of Halfspaces under Gaussian Marginals
COLT 2021
A Statistical Taylor Theorem and Extrapolation of Truncated Densities
COLT 2021
Boosting in the Presence of Massart Noise
COLT 2021
Efficient Algorithms for Learning from Coarse Labels
COLT 2021
Forster Decomposition and Learning Halfspaces with Noise
NeurIPS 2021
Learning Online Algorithms with Distributional Advice
ICML 2021
On Robust Mean Estimation under Coordinate-level Corruption
ICML 2021
ReLU Regression with Massart Noise
NeurIPS 2021
Black-Box Methods for Restoring Monotonicity
ICML 2020
Efficient Parameter Estimation of Truncated Boolean Product Distributions
COLT 2020
Learning Halfspaces with Massart Noise Under Structured Distributions
COLT 2020
Non-Convex SGD Learns Halfspaces with Adversarial Label Noise
NeurIPS 2020
Optimal Private Median Estimation under Minimal Distributional Assumptions
NeurIPS 2020
Computationally and Statistically Efficient Truncated Regression
COLT 2019
Distribution-Independent PAC Learning of Halfspaces with Massart Noise
NeurIPS 2019
Learning to Prune: Speeding up Repeated Computations
COLT 2019
Actively Avoiding Nonsense in Generative Models
COLT 2018
Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model
AISTATS 2018
Certified Computation from Unreliable Datasets
COLT 2018
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms
ICML 2017
Ten Steps of EM Suffice for Mixtures of Two Gaussians
COLT 2017