Sciweavers

701 search results - page 2 / 141
» Self Bounding Learning Algorithms
Sort
View
IWANN
2007
Springer
14 years 1 months ago
Speeding Up the Dissimilarity Self-Organizing Maps by Branch and Bound
Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can...
Brieuc Conan-Guez, Fabrice Rossi
COCO
2008
Springer
81views Algorithms» more  COCO 2008»
13 years 9 months ago
Amplifying Lower Bounds by Means of Self-Reducibility
Eric Allender, Michal Koucký
ICML
2003
IEEE
14 years 8 months ago
AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Oppon
A satisfactory multiagent learning algorithm should, at a minimum, learn to play optimally against stationary opponents and converge to a Nash equilibrium in self-play. The algori...
Vincent Conitzer, Tuomas Sandholm