Moise Blanchard
9 papers · 2022–2025 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
🌍 Conference Polyglot (4) 🌉 Interdisciplinary Bridge 🗺️ Taxonomy Completionist (13) 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird
🐝
Cross-Pollinator
(14)
Conferences
COLT (5)
ALT (2)
ICLR (1)
NIPS (1)
Top co-authors
Keywords
convex optimization
(2)
memory complexity
(2)
online learning
(2)
gaussian process
(1)
universal consistency
(1)
gradient descent
(1)
stochastic process
(1)
oracle complexity
(1)
cutting-plane method
(1)
query complexity
(1)
covariance structure
(1)
concentration inequality
(1)
k-nearest neighbor
(1)
universal learning
(1)
covering number
(1)
first-order oracle
(1)
nearest neighbor algorithm
(1)
high-dimensional distribution
(1)
bernoulli distribution
(1)
binomial process
(1)
Papers
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
Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal
COLT 2023
Memory-Constrained Algorithms for Convex Optimization
NIPS 2023
Shallow and Deep Networks are Near-Optimal Approximators of Korobov Functions
ICLR 2022
Universal Online Learning with Unbounded Losses: Memory Is All You Need
ALT 2022
Universal Online Learning with Bounded Loss: Reduction to Binary Classification
COLT 2022
Universal Online Learning: an Optimistically Universal Learning Rule
COLT 2022