Sciweavers

443 search results - page 19 / 89
» Learning from a Population of Hypotheses
Sort
View
TIT
2008
76views more  TIT 2008»
13 years 9 months ago
Improved Risk Tail Bounds for On-Line Algorithms
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
Nicolò Cesa-Bianchi, Claudio Gentile
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
14 years 4 months ago
Knowledge reuse in genetic programming applied to visual learning
We propose a method of knowledge reuse for an ensemble of genetic programming-based learners solving a visual learning task. First, we introduce a visual learning method that uses...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
IPMI
2011
Springer
13 years 1 months ago
Learning an Atlas of a Cognitive Process in Its Functional Geometry
In this paper we construct an atlas that captures functional characteristics of a cognitive process from a population of individuals. The functional connectivity is encoded in a lo...
Georg Langs, Danial Lashkari, Andrew Sweet, Yanmei...
ATAL
2006
Springer
14 years 1 months ago
Learning a common language through an emergent interaction topology
We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and lea...
Samarth Swarup, Kiran Lakkaraju, Les Gasser
NIPS
2001
13 years 11 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...