Sciweavers

686 search results - page 40 / 138
» Minimax Probability Machine
Sort
View
ICML
2007
IEEE
14 years 11 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
ICML
2006
IEEE
14 years 11 months ago
Qualitative reinforcement learning
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
Arkady Epshteyn, Gerald DeJong
COLT
2000
Springer
14 years 2 months ago
On the Convergence Rate of Good-Turing Estimators
Good-Turing adjustments of word frequencies are an important tool in natural language modeling. In particular, for any sample of words, there is a set of words not occuring in tha...
David A. McAllester, Robert E. Schapire
COCO
2008
Springer
91views Algorithms» more  COCO 2008»
14 years 3 days ago
Amplifying ZPP^SAT[1] and the Two Queries Problem
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
Richard Chang, Suresh Purini
EWRL
2008
14 years 3 days ago
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
Kirill Dyagilev, Shie Mannor, Nahum Shimkin