1106 search results - page 127 / 222 » On regularization algorithms in learning theory |
141
click to vote
ACL
1994
15 years 6 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
137
click to vote
ICML
1996
IEEE
16 years 5 months ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
137
click to vote
EDUTAINMENT
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we present a novel method for dynamic terrain in battlefield and an efficient plan to simulate crater in the battle. We explore a few methods for dynamic terrain sur...
153
click to vote
ML
2007
ACM
15 years 4 months ago
2007
ACM
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...
154
click to vote
ISTCS
1997
Springer
15 years 8 months ago
1997
Springer
Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...