Sciweavers

COLT
2003
Springer
14 years 12 days ago
Internal Regret in On-Line Portfolio Selection
This paper extends the game-theoretic notion of internal regret to the case of on-line potfolio selection problems. New sequential investment strategies are designed to minimize th...
Gilles Stoltz, Gábor Lugosi
COLT
2003
Springer
14 years 12 days ago
Kernels and Regularization on Graphs
Alex J. Smola, Risi Imre Kondor
COLT
2003
Springer
14 years 12 days ago
Projective DNF Formulae and Their Revision
Robert H. Sloan, Balázs Szörény...
COLT
2003
Springer
14 years 12 days ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...
Mehryar Mohri
COLT
2003
Springer
14 years 12 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
COLT
2003
Springer
14 years 12 days ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
COLT
2003
Springer
14 years 12 days ago
On-Line Learning with Imperfect Monitoring
We study on-line play of repeated matrix games in which the observations of past actions of the other player and the obtained reward are partial and stochastic. We define the Part...
Shie Mannor, Nahum Shimkin
COLT
2003
Springer
14 years 12 days ago
Fast Kernels for Inexact String Matching
Christina S. Leslie, Rui Kuang
COLT
2003
Springer
14 years 12 days ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio