Sciweavers

530 search results - page 58 / 106
» Learning Bounds for Domain Adaptation
Sort
View
AAMAS
2005
Springer
15 years 14 days ago
Learning and Exploiting Relative Weaknesses of Opponent Agents
Agents in a competitive interaction can greatly benefit from adapting to a particular adversary, rather than using the same general strategy against all opponents. One method of s...
Shaul Markovitch, Ronit Reger
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
15 years 5 months ago
Reinforcement learning for games: failures and successes
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
Wolfgang Konen, Thomas Bartz-Beielstein
119
Voted
ML
2007
ACM
104views Machine Learning» more  ML 2007»
15 years 2 days ago
A general criterion and an algorithmic framework for learning in multi-agent systems
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...
Rob Powers, Yoav Shoham, Thuc Vu
94
Voted
GECCO
2004
Springer
115views Optimization» more  GECCO 2004»
15 years 6 months ago
Robotic Control Using Hierarchical Genetic Programming
In this paper, we compare the performance of hierarchical GP methods (Automatically Defined Functions, Module Acquisition, Adaptive Representation through Learning) with the canon...
Marcin L. Pilat, Franz Oppacher
100
Voted
IMR
2005
Springer
15 years 6 months ago
A fews snags in mesh adaptation loops
The first stage in an adaptive finite element scheme (cf. [CAS95, bor1]) consists in creating an initial mesh of a given domain Ω, which is used to perform an initial computati...
Frédéric Hecht