1106 search results - page 33 / 222 » On regularization algorithms in learning theory |
145
click to vote
ENGL
2007
15 years 4 months ago
2007
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
111
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents an information theoretic perspective on design and analysis of evolutionary algorithms. Indicators of solution quality are developed and applied not only to in...
159
click to vote
ACCV
2006
Springer
15 years 8 months ago
2006
Springer
Blind blur identification in video sequences becomes more important. This paper presents a new method for identifying parameters of different blur kernels and image restoration in ...
134
click to vote
MCS
2009
Springer
15 years 11 months ago
2009
Springer
An ensemble is generated by training multiple component learners for a same task and then combining them for predictions. It is known that when lots of trained learners are availab...
198
Voted
PAMI
2012
13 years 7 months ago
2012
Abstract—We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We sh...