Sciweavers

224 search results - page 18 / 45
» Bounding Learning Time in XCS
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Learning Geometric Concepts via Gaussian Surface Area
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio
ICML
2010
IEEE
13 years 6 months ago
Online Prediction with Privacy
In this paper, we consider online prediction from expert advice in a situation where each expert observes its own loss at each time while the loss cannot be disclosed to others fo...
Jun Sakuma, Hiromi Arai
NAACL
2010
13 years 6 months ago
Distributed Training Strategies for the Structured Perceptron
Perceptron training is widely applied in the natural language processing community for learning complex structured models. Like all structured prediction learning frameworks, the ...
Ryan T. McDonald, Keith Hall, Gideon Mann
AAAI
1992
13 years 9 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...
JMLR
2006
117views more  JMLR 2006»
13 years 8 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon