Sciweavers

1047 search results - page 40 / 210
» Learning the required number of agents for complex tasks
Sort
View
JMLR
2010
136views more  JMLR 2010»
13 years 2 months ago
Reducing Label Complexity by Learning From Bags
We consider a supervised learning setting in which the main cost of learning is the number of training labels and one can obtain a single label for a bag of examples, indicating o...
Sivan Sabato, Nathan Srebro, Naftali Tishby
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 7 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik
ICRA
1998
IEEE
154views Robotics» more  ICRA 1998»
13 years 12 months ago
Environmental Complexity Control for Vision-Based Learning Mobile Robot
This paper discusses how a robot can develop its state vector according to the complexity of the interactions with its environment. A method for controlling the complexity is prop...
Eiji Uchibe, Minoru Asada, Koh Hosoda
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 9 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
ATAL
2008
Springer
13 years 9 months ago
WADE: a software platform to develop mission critical applications exploiting agents and workflows
In this paper, we describe two mission critical applications currently deployed by Telecom Italia in the Operations Support System domains. The first one called "Network Neut...
Giovanni Caire, Danilo Gotta, Massimo Banzi