Sciweavers

701 search results - page 58 / 141
» Self Bounding Learning Algorithms
Sort
View
ML
2002
ACM
121views Machine Learning» more  ML 2002»
13 years 8 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
JMLR
2010
132views more  JMLR 2010»
13 years 3 months ago
On the Impact of Kernel Approximation on Learning Accuracy
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
Corinna Cortes, Mehryar Mohri, Ameet Talwalkar
AUTOMATICA
2006
81views more  AUTOMATICA 2006»
13 years 9 months ago
An energy-gain bounding approach to robust fuzzy identification
A novel method for the robust identification of interpretable fuzzy models, based on the criterion that identification errors are least sensitive to data uncertainties and modelli...
Mohit Kumar, Norbert Stoll, Regina Stoll
COLT
2008
Springer
13 years 10 months ago
Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...
Andrey Bernstein, Nahum Shimkin
ALT
2006
Springer
14 years 6 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen