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...
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 ...
Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeably lacking. T...
Abstract – Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeab...
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...