Moise Blanchard
11 papers · 2022–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 ↓+1 more ↓ Show less ↑
🌍 Conference Polyglot · Bronze 🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (20) 💎 Century Club · Bronze 🔥 Unstoppable · Bronze
🗃️
Keyword Collector
(61)
Venues
Top co-authors
Research topics
Keywords
online learning
(5)
memory complexity
(2)
universal consistency
(2)
convex optimization
(2)
learning theory
(2)
sequential decision making
(1)
multi-class classification
(1)
function approximation
(1)
covariance structure
(1)
gradient descent
(1)
vc dimension
(1)
stochastic process
(1)
oracle complexity
(1)
curse of dimensionality
(1)
cutting plane method
(1)
query complexity
(1)
distribution-free learning
(1)
sequential prediction
(1)
gaussian process
(1)
binary classification
(1)
Papers
Characterizing Online and Private Learnability under Distributional Constraints via Generalized Smoothness
COLT 2026
Distribution-Free Sequential Prediction with Abstentions
COLT 2026
Non-Monetary Mechanism Design without Distributional Information: Using Scarce Audits Wisely (Extended Abstract)
COLT 2025
Correlated Binomial Process
COLT 2024
Tight Bounds for Local Glivenko-Cantelli
ALT 2024
Memory-Constrained Algorithms for Convex Optimization
NeurIPS 2023
Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal
COLT 2023
Shallow and Deep Networks are Near-Optimal Approximators of Korobov Functions
ICLR 2022
Universal Online Learning: an Optimistically Universal Learning Rule
COLT 2022
Universal Online Learning with Bounded Loss: Reduction to Binary Classification
COLT 2022
Universal Online Learning with Unbounded Losses: Memory Is All You Need
ALT 2022