701 search results - page 29 / 141 » Self Bounding Learning Algorithms |
117
click to vote
ML
2007
ACM
15 years 35 min ago
2007
ACM
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...
111
Voted
COLT
2005
Springer
15 years 6 months ago
2005
Springer
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 ...
93
Voted
AAAI
2004
15 years 1 months ago
2004
Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeably lacking. T...
87
Voted
AAMAS
2007
Springer
15 years 19 days ago
2007
Springer
Abstract – Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeab...
AROBOTS
1999
15 years 5 days ago
1999
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...