Sciweavers

2363 search results - page 167 / 473
» Learning Algorithms for Domain Adaptation
Sort
View
COLT
2008
Springer
15 years 5 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
KCAP
2011
ACM
14 years 6 months ago
Integrating knowledge capture and supervised learning through a human-computer interface
Some supervised-learning algorithms can make effective use of domain knowledge in addition to the input-output pairs commonly used in machine learning. However, formulating this a...
Trevor Walker, Gautam Kunapuli, Noah Larsen, David...
ECML
2005
Springer
15 years 8 months ago
Model-Based Online Learning of POMDPs
Abstract. Learning to act in an unknown partially observable domain is a difficult variant of the reinforcement learning paradigm. Research in the area has focused on model-free m...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
CORR
2010
Springer
125views Education» more  CORR 2010»
15 years 3 months ago
Near-Optimal Bayesian Active Learning with Noisy Observations
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypot...
Daniel Golovin, Andreas Krause, Debajyoti Ray
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 3 months ago
Learning acceptable windows of contingency
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
Kevin Gold, Brian Scassellati