Sciweavers

3050 search results - page 314 / 610
» On-line Algorithms in Machine Learning
Sort
View
COLT
2007
Springer
16 years 22 days ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
ECML
2007
Springer
16 years 22 days ago
Learning an Outlier-Robust Kalman Filter
We introduce a modified Kalman filter that performs robust, real-time outlier detection, without the need for manual parameter tuning by the user. Systems that rely on high quali...
Jo-Anne Ting, Evangelos Theodorou, Stefan Schaal
ECML
2006
Springer
15 years 10 months ago
Toward Robust Real-World Inference: A New Perspective on Explanation-Based Learning
Abstract. Over the last twenty years AI has undergone a sea change. The oncedominant paradigm of logical inference over symbolic knowledge representations has largely been supplant...
Gerald DeJong
ICML
2010
IEEE
15 years 6 months ago
FAB-MAP: Appearance-Based Place Recognition and Mapping using a Learned Visual Vocabulary Model
We present an overview of FAB-MAP, an algorithm for place recognition and mapping developed for infrastructure-free mobile robot navigation in large environments. The system allow...
Mark Joseph Cummins, Paul M. Newman
ML
2000
ACM
126views Machine Learning» more  ML 2000»
15 years 6 months ago
Learning to Play Chess Using Temporal Differences
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
Jonathan Baxter, Andrew Tridgell, Lex Weaver