Sciweavers

ALT
2007
Springer
14 years 8 months ago
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
As some cognitive research suggests, in the process of learning languages, in addition to overt explicit negative evidence, a child often receives covert explicit evidence in form...
Sanjay Jain, Efim B. Kinber
ALT
2007
Springer
14 years 8 months ago
Learning Rational Stochastic Tree Languages
Abstract. We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T(F), from a sample of trees independently drawn accordi...
François Denis, Amaury Habrard
ALT
2007
Springer
14 years 8 months ago
Tuning Bandit Algorithms in Stochastic Environments
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
Jean-Yves Audibert, Rémi Munos, Csaba Szepe...
ALT
2007
Springer
14 years 8 months ago
Prescribed Learning of R.E. Classes
Abstract. This work extends studies of Angluin, Lange and Zeugmann on the dependence of learning on the hypotheses space chosen for the class. In subsequent investigations, uniform...
Sanjay Jain, Frank Stephan, Nan Ye
ALT
2007
Springer
14 years 8 months ago
Pseudometrics for State Aggregation in Average Reward Markov Decision Processes
We consider how state similarity in average reward Markov decision processes (MDPs) may be described by pseudometrics. Introducing the notion of adequate pseudometrics which are we...
Ronald Ortner
ALT
2008
Springer
14 years 8 months ago
Query Learning and Certificates in Lattices
Marta Arias, José L. Balcázar
ALT
2008
Springer
14 years 8 months ago
Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
Andreas Maurer, Massimiliano Pontil
ALT
2008
Springer
14 years 8 months ago
Learning with Temporary Memory
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model con...
Steffen Lange, Samuel E. Moelius, Sandra Zilles
ALT
2008
Springer
14 years 8 months ago
Numberings Optimal for Learning
This paper extends previous studies on learnability in non-acceptable numberings by considering the question: for which criteria which numberings are optimal, that is, for which nu...
Sanjay Jain, Frank Stephan