conftrace_

Vasilis Kontonis

24 papers · 2020–2025 · 4 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+9 more ↓ 🐝 Cross-Pollinator (15) 🧭 Keyword Pioneer πŸƒ Academic Marathon (5) 🌍 Conference Polyglot (4) 🌈 Renaissance Researcher (5)
πŸŒ‰ Interdisciplinary Bridge πŸ—ΊοΈ Taxonomy Completionist (28) 🧭 Keyword Pioneer 🀝 Dynamic Duo (15) πŸ”¬ Deep Specialist (11) ⚑ Prolific Year (5) πŸ—ƒοΈ Keyword Collector (79) πŸ’Ž Century Club (24) πŸ”₯ Unstoppable (6)

Conferences

NIPS (10) COLT (9) ICML (4) ICLR (1)

Papers

Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions ICML 2025 Learning general Gaussian mixtures with efficient score matching COLT 2025 Oracle efficient truncated statistics ICLR 2025 Online Linear Classification with Massart Noise ICML 2025 Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension COLT 2024 Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random NIPS 2024 Active Classification with Few Queries under Misspecification NIPS 2024 Efficient Discrepancy Testing for Learning with Distribution Shift NIPS 2024 Efficient Testable Learning of Halfspaces with Adversarial Label Noise NIPS 2023 The Gain from Ordering in Online Learning NIPS 2023 SLaM: Student-Label Mixing for Distillation with Unlabeled Examples NIPS 2023 Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Method NIPS 2023 Self-Directed Linear Classification COLT 2023 Linear Label Ranking with Bounded Noise NIPS 2022 Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent ICML 2022 Weighted Distillation with Unlabeled Examples NIPS 2022 Learning a Single Neuron with Adversarial Label Noise via Gradient Descent COLT 2022 A Statistical Taylor Theorem and Extrapolation of Truncated Densities COLT 2021 Agnostic Proper Learning of Halfspaces under Gaussian Marginals COLT 2021 Efficient Algorithms for Learning from Coarse Labels COLT 2021 Learning Online Algorithms with Distributional Advice ICML 2021 Non-Convex SGD Learns Halfspaces with Adversarial Label Noise NIPS 2020 Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks COLT 2020 Learning Halfspaces with Massart Noise Under Structured Distributions COLT 2020