This paper addresses the statistical problem of estimating the infinite-...
We propose a family of recursive cutting-plane algorithms to solve
feasi...
We study the fundamental limits of learning in contextual bandits, where...
We give query complexity lower bounds for convex optimization and the re...
We consider the contextual bandit problem on general action and context
...
This work resolves the following question in non-Euclidean statistics: I...
This technical report provides additional results for the main paper
“Pr...
The k-traveling salesman problem (k-TSP) seeks a tour of minimal length
...
We provide algorithms for regression with adversarial responses under la...
We resolve an open problem of Hanneke on the subject of universally
cons...
We study the subject of universal online learning with non-i.i.d. proces...
We study universal consistency of non-i.i.d. processes in the context of...
In this paper, we analyze the number of neurons and training parameters ...