3050 search results - page 92 / 610 » On-line Algorithms in Machine Learning |
171
Voted
EMNLP
2011
14 years 3 months ago
2011
We propose a general method to watermark and probabilistically identify the structured outputs of machine learning algorithms. Our method is robust to local editing operations and...
97
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
130
Voted
SEAL
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. This paper extends the N-person IPD game into a more interesting game in economics, namely, the oligopoly game. Due to its market share dynamics, the oligopoly game is mo...
139
Voted
JCST
2006
15 years 3 months ago
2006
Abstract In multi-instance learning, the training set comprises labeled bags that are composed of unlabeled instances, and the task is to predict the labels of unseen bags. This pa...
132
Voted
ML
2002
ACM
15 years 3 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...