29 search results - page 4 / 6 » Learning parities in the mistake-bound model |
CADE
2001
Springer
14 years 7 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
NEUROSCIENCE
2001
Springer
13 years 12 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...