1106 search results - page 105 / 222 » On regularization algorithms in learning theory |
145
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Exploration/Exploitation equilibrium is one of the most challenging issues in reinforcement learning area as well as learning classifier systems such as XCS. In this paper1 , an i...
128
click to vote
NIPS
2007
15 years 6 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
122
Voted
COLT
2008
Springer
15 years 6 months ago
2008
Springer
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
150
click to vote
FOCI
2007
IEEE
15 years 11 months ago
2007
IEEE
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
131
click to vote
ALT
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...