1106 search results - page 104 / 222 » On regularization algorithms in learning theory |
139
click to vote
NIPS
2001
15 years 6 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
131
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
As increasing amounts of sensitive personal information is aggregated into data repositories, it has become important to develop mechanisms for processing the data without revealin...
230
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
172
click to vote
AAMAS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The application of reinforcement learning algorithms to multiagent domains may cause complex non-convergent dynamics. The replicator dynamics, commonly used in evolutiona...
122
Voted
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...