12194 search results - page 48 / 2439 » Numberings Optimal for Learning |
128
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider the problem of multi-task reinforcement learning, where the agent needs to solve a sequence of Markov Decision Processes (MDPs) chosen randomly from a fixed but unknow...
104
click to vote
CSREAESA
2006
15 years 1 months ago
2006
This paper proposes efficient and optimal 4:2 and 5:2 compressors. The compressors are highly optimized in terms of transistor count. These designs have the principle advantage th...
143
click to vote
COLT
1993
Springer
15 years 4 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
107
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we evaluate the performance of ten well-known evolutionary and non-evolutionary rule learning algorithms. The comparative study is performed on a real-world classiï...
118
Voted
ML
2007
ACM
15 years 7 hour ago
2007
ACM
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...