Sciweavers

4930 search results - page 170 / 986
» Learning minimal abstractions
Sort
View
COLT
2000
Springer
15 years 5 months ago
Barrier Boosting
Boosting algorithms like AdaBoost and Arc-GV are iterative strategies to minimize a constrained objective function, equivalent to Barrier algorithms. Based on this new understandi...
Gunnar Rätsch, Manfred K. Warmuth, Sebastian ...
COLT
2004
Springer
15 years 4 months ago
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
Gilles Blanchard, Christin Schäfer, Yves Roze...
AGI
2008
15 years 2 months ago
Extending the Soar Cognitive Architecture
One approach in pursuit of general intelligent agents has been to concentrate on the underlying cognitive architecture, of which Soar is a prime example. In the past, Soar has reli...
John E. Laird
EACL
2006
ACL Anthology
15 years 2 months ago
Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing
An algorithm based on the Generalized Hebbian Algorithm is described that allows the singular value decomposition of a dataset to be learned based on single observation pairs pres...
Genevieve Gorrell
ICML
2010
IEEE
15 years 2 months ago
On Sparse Nonparametric Conditional Covariance Selection
We develop a penalized kernel smoothing method for the problem of selecting nonzero elements of the conditional precision matrix, known as conditional covariance selection. This p...
Mladen Kolar, Ankur P. Parikh, Eric P. Xing