Sciweavers

3250 search results - page 67 / 650
» Parameterized Learning Complexity
Sort
View
AAAI
2007
14 years 9 days ago
A Reinforcement Learning Algorithm with Polynomial Interaction Complexity for Only-Costly-Observable MDPs
An Unobservable MDP (UMDP) is a POMDP in which there are no observations. An Only-Costly-Observable MDP (OCOMDP) is a POMDP which extends an UMDP by allowing a particular costly a...
Roy Fox, Moshe Tennenholtz
IUI
2009
ACM
14 years 6 months ago
Learning to generalize for complex selection tasks
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
Alan Ritter, Sumit Basu
ICRA
1998
IEEE
154views Robotics» more  ICRA 1998»
14 years 2 months ago
Environmental Complexity Control for Vision-Based Learning Mobile Robot
This paper discusses how a robot can develop its state vector according to the complexity of the interactions with its environment. A method for controlling the complexity is prop...
Eiji Uchibe, Minoru Asada, Koh Hosoda
IJRR
2010
177views more  IJRR 2010»
13 years 8 months ago
Learning from Demonstration for Autonomous Navigation in Complex Unstructured Terrain
Rough terrain autonomous navigation continues to pose a challenge to the robotics community. Robust navigation by a mobile robot depends not only on the individual performance of ...
David Silver, J. Andrew Bagnell, Anthony Stentz
COLT
2008
Springer
13 years 11 months ago
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning
We study the potential benefits to classification prediction that arise from having access to unlabeled samples. We compare learning in the semi-supervised model to the standard, ...
Shai Ben-David, Tyler Lu, Dávid Pál