Sciweavers

3449 search results - page 364 / 690
» A Framework for Multiple-Instance Learning
Sort
View
KDD
2008
ACM
182views Data Mining» more  KDD 2008»
16 years 5 months ago
Classification with partial labels
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
Nam Nguyen, Rich Caruana
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 11 months ago
Genetic programming for cross-task knowledge sharing
We consider multitask learning of visual concepts within genetic programming (GP) framework. The proposed method evolves a population of GP individuals, with each of them composed...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 10 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
148
Voted
ATAL
2003
Springer
15 years 10 months ago
A selection-mutation model for q-learning in multi-agent systems
Although well understood in the single-agent framework, the use of traditional reinforcement learning (RL) algorithms in multi-agent systems (MAS) is not always justified. The fe...
Karl Tuyls, Katja Verbeeck, Tom Lenaerts
136
Voted
COLT
1999
Springer
15 years 9 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma