1062 search results - page 60 / 213 » Sublinear Optimization for Machine Learning |
105
click to vote
ECML
2007
Springer
15 years 11 months ago
2007
Springer
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
157
click to vote
COLT
2007
Springer
15 years 11 months ago
2007
Springer
Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, t...
142
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
156
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
120
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...