2295 search results - page 136 / 459 » Learning Overcomplete Representations |
101
Voted
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
The use of Mercer kernel methods in statistical learning theory provides for strong learning capabilities, as seen in kernel principal component analysis and support vector machin...
99
Voted
AI
1999
Springer
15 years 12 days ago
1999
Springer
A central problem in multistrategy learning systems is the selection and sequencing of machine learning algorithms for particular situations. This is typically done by the system ...
87
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the margin-based bounds due to Bartlett et al. (2006). The...
105
click to vote
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
We present an algorithm for on-line, incremental discovery of temporal-difference (TD) networks. The key contribution is the establishment of three criteria to expand a node in TD...
99
Voted
MLCW
2005
Springer
15 years 6 months ago
2005
Springer
Semantic entailment is the problem of determining if the meaning of a given sentence entails that of another. This is a fundamental problem in natural language understanding that ...