Sciweavers

376 search results - page 9 / 76
» On the Advice Complexity of Online Problems
Sort
View
ATAL
2005
Springer
15 years 5 months ago
An online POMDP algorithm for complex multiagent environments
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
Sébastien Paquet, Ludovic Tobin, Brahim Cha...
IROS
2007
IEEE
149views Robotics» more  IROS 2007»
15 years 6 months ago
A decentralized planner that guarantees the safety of communicating vehicles with complex dynamics that replan online
— This paper considers the problem of coordinating multiple vehicles with kinodynamic constraints that operate in the same partially-known environment. The vehicles are able to c...
Kostas E. Bekris, Konstantinos I. Tsianos, Lydia E...
JMLR
2012
13 years 2 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
98
Voted
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
15 years 6 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
NIPS
2007
15 years 1 months ago
Hierarchical Apprenticeship Learning with Application to Quadruped Locomotion
We consider apprenticeship learning—learning from expert demonstrations—in the setting of large, complex domains. Past work in apprenticeship learning requires that the expert...
J. Zico Kolter, Pieter Abbeel, Andrew Y. Ng