no code implementations • 26 Mar 2021 • Quentin Paris
This paper addresses the problem of online learning in metric spaces using exponential weights.
no code implementations • 3 Feb 2020 • Quentin Paris
We shortly discuss the application of these results in the context of aggregation and for the problem of barycenter estimation.
no code implementations • 29 Jan 2018 • Thibaut Le Gouic, Quentin Paris
In this paper, we define and study a new notion of stability for the $k$-means clustering scheme building upon the notion of quantization of a probability measure.
no code implementations • 25 Nov 2016 • Arnak S. Dalalyan, Edwin Grappin, Quentin Paris
These inequalities show that if the temperature parameter is small, the EWA with the Laplace prior satisfies the same type of oracle inequality as the lasso estimator does, as long as the quality of estimation is measured by the prediction loss.
no code implementations • 20 Jun 2016 • Pierre C. Bellec, Arnak S. Dalalyan, Edwin Grappin, Quentin Paris
In this paper we revisit the risk bounds of the lasso estimator in the context of transductive and semi-supervised learning.