495 search results - page 64 / 99 » Approximation algorithms for budgeted learning problems |
100
click to vote
ICML
2010
IEEE
15 years 21 days ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
89
Voted
TSMC
2008
14 years 11 months ago
2008
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
102
click to vote
AAAI
1998
15 years 29 days ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
104
Voted
ATAL
2010
Springer
15 years 22 days ago
2010
Springer
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...