Sciweavers

701 search results - page 29 / 141
» Self Bounding Learning Algorithms
Sort
View
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 9 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
COLT
2005
Springer
14 years 3 months ago
Localized Upper and Lower Bounds for Some Estimation Problems
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
Tong Zhang
AAAI
2004
13 years 11 months ago
Performance Bounded Reinforcement Learning in Strategic Interactions
Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeably lacking. T...
Bikramjit Banerjee, Jing Peng
AAMAS
2007
Springer
13 years 9 months ago
Generalized multiagent learning with performance bound
Abstract – Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeab...
Bikramjit Banerjee, Jing Peng
AROBOTS
1999
110views more  AROBOTS 1999»
13 years 9 months ago
Self-Localization of Autonomous Robots by Hidden Representations
We present a framework for constructing representations of space in an autonomous agent which does not obtain any direct information about its location. Instead the algorithm relie...
J. Michael Herrmann, Klaus Pawelzik, Theo Geisel