2223 search results - page 80 / 445 » Implicit Online Learning |
154
click to vote
COLT
2003
Springer
15 years 9 months ago
2003
Springer
We study on-line play of repeated matrix games in which the observations of past actions of the other player and the obtained reward are partial and stochastic. We define the Part...
133
click to vote
AAAI
2008
15 years 6 months ago
2008
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
128
click to vote
EACL
2006
ACL Anthology
15 years 5 months ago
2006
ACL Anthology
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
125
click to vote
ESANN
2006
15 years 5 months ago
2006
This paper is the first of a two paper series that deals with an important problem in on-line learning mechanisms for autonomous agents that must perform non trivial tasks and oper...
132
click to vote
IRMA
2000
15 years 5 months ago
2000
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...