We study the classical problem of approximating a non-decreasing functio...
Counterfactual Risk Minimization (CRM) is a framework for dealing with t...
We consider a finite-horizon Mean Field Control problem for Markovian mo...
In this paper, we tackle the computational efficiency of kernelized UCB
...
In the fixed budget thresholding bandit problem, an algorithm sequential...
Mixability has been shown to be a powerful tool to obtain algorithms wit...
We introduce the continuized Nesterov acceleration, a close variant of
N...
We introduce the "continuized" Nesterov acceleration, a close variant of...
In this work we investigate the variation of the online kernelized ridge...
Online forecasting under a changing environment has been a problem of
in...
In the context of statistical supervised learning, the noiseless linear ...
In this paper, we consider the problem of sleeping bandits with stochast...
We consider the setting of online logistic regression and consider the r...
In this paper, we make an experimental comparison of semi-parametric (Co...
We are interested in a framework of online learning with kernels for
low...
Uncertainty Quantification of closure relationships integrated into
ther...
We propose a contextual-bandit approach for demand side management by
of...
We consider the setting of online linear regression for arbitrary
determ...
We consider the online convex optimization problem. In the setting of
ar...
Consider a network of agents connected by communication links, where eac...
We investigate contextual online learning with nonparametric (Lipschitz)...
We consider the problem of online nonparametric regression with arbitrar...
We study online prediction of bounded stationary ergodic processes. To d...
We study online aggregation of the predictions of experts, and first sho...
We consider the setting of sequential prediction of arbitrary sequences ...
Mirror descent with an entropic regularizer is known to achieve shifting...