Sciweavers

43 search results - page 3 / 9
» Bounds for the Loss in Probability of Correct Classification...
Sort
View
ICML
2005
IEEE
14 years 5 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos
ICDIM
2007
IEEE
13 years 6 months ago
Predicting durability in DHTs using Markov chains
We consider the problem of data durability in lowbandwidth large-scale distributed storage systems. Given the limited bandwidth between replicas, these systems suffer from long re...
Fabio Picconi, Bruno Baynat, Pierre Sens
ICML
2009
IEEE
14 years 5 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 5 months ago
MDL Convergence Speed for Bernoulli Sequences
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total...
Jan Poland, Marcus Hutter
NIPS
2001
13 years 6 months ago
Latent Dirichlet Allocation
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
David M. Blei, Andrew Y. Ng, Michael I. Jordan