Sciweavers

3050 search results - page 182 / 610
» On-line Algorithms in Machine Learning
Sort
View
COLT
2006
Springer
15 years 7 months ago
Online Multitask Learning
We study the problem of online learning of multiple tasks in parallel. On each online round, the algorithm receives an instance and makes a prediction for each one of the parallel ...
Ofer Dekel, Philip M. Long, Yoram Singer
DAGSTUHL
2004
15 years 5 months ago
Learning with Local Models
Next to prediction accuracy, the interpretability of models is one of the fundamental criteria for machine learning algorithms. While high accuracy learners have intensively been e...
Stefan Rüping
ICML
2010
IEEE
15 years 5 months ago
Efficient Learning with Partially Observed Attributes
We describe and analyze efficient algorithms for learning a linear predictor from examples when the learner can only view a few attributes of each training example. This is the ca...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
ML
2002
ACM
168views Machine Learning» more  ML 2002»
15 years 3 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy
ICML
2002
IEEE
16 years 4 months ago
Hierarchically Optimal Average Reward Reinforcement Learning
Two notions of optimality have been explored in previous work on hierarchical reinforcement learning (HRL): hierarchical optimality, or the optimal policy in the space defined by ...
Mohammad Ghavamzadeh, Sridhar Mahadevan