5 citations · 17 across the 23 of their papers we have counts for
4 papers · 1 filter
Agnostic Smoothed Online Learning without Knowledge of the Base Measure
Moïse Blanchard
Classical results in statistical learning typically consider two extreme data-generating models: i.i.d. instances from an unknown distribution, or fully adversarial instances, ofte…
Near-Optimal Mechanisms for Resource Allocation Without Monetary Transfers
Moïse Blanchard, Patrick Jaillet
We study the problem in which a central planner sequentially allocates a single resource to multiple strategic agents using their utility reports at each round, but without using a…
Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems
Moise Blanchard
In this paper we provide oracle complexity lower bounds for finding a point in a given set using a memory-constrained algorithm that has access to a separation oracle. We assume th…
Correlated Binomial Process
Moïse Blanchard, Doron Cohen, Aryeh Kontorovich
Cohen and Kontorovich (COLT 2023) initiated the study of what we call here the Binomial Empirical Process: the maximal absolute value of a sequence of inhomogeneous normalized and…