1106 search results - page 98 / 222 » On regularization algorithms in learning theory |
130
click to vote
AAAI
2007
15 years 7 months ago
2007
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
163
Voted
CVPR
2011
IEEE
15 years 14 days ago
2011
IEEE
Conventional non-blind image deblurring algorithms involve natural image priors and maximum a-posteriori (MAP) estimation. As a consequence of MAP estimation, separate pre-process...
154
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
146
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Feature selection aims to reduce dimensionality for building comprehensible learning models with good generalization performance. Feature selection algorithms are largely studied ...
139
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...