Sciweavers

360 search results - page 8 / 72
» Learning Evaluation Functions for Large Acyclic Domains
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Multi-agent reward analysis for learning in noisy domains
In many multi agent learning problems, it is difficult to determine, a priori, the agent reward structure that will lead to good performance. This problem is particularly pronoun...
Adrian K. Agogino, Kagan Tumer
CIDM
2007
IEEE
13 years 11 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
JCP
2008
139views more  JCP 2008»
13 years 7 months ago
Agent Learning in Relational Domains based on Logical MDPs with Negation
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for applying Reinforcement Learning algorithms on the ...
Song Zhiwei, Chen Xiaoping, Cong Shuang
ICML
2010
IEEE
13 years 5 months ago
Learning optimally diverse rankings over large document collections
Most learning to rank research has assumed that the utility of different documents is independent, which results in learned ranking functions that return redundant results. The fe...
Aleksandrs Slivkins, Filip Radlinski, Sreenivas Go...
EC
2008
116views ECommerce» more  EC 2008»
13 years 7 months ago
Efficient Evaluation Functions for Evolving Coordination
Abstract-- This paper presents a method for creating evaluation functions that efficiently promote coordination in a multiagent system, allowing single-agent evolutionary computati...
Adrian K. Agogino, Kagan Tumer