Sciweavers

2712 search results - page 394 / 543
» On learning algorithm selection for classification
Sort
View
COLT
2000
Springer
15 years 5 months ago
Computable Shell Decomposition Bounds
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
John Langford, David A. McAllester
116
Voted
ICPR
2010
IEEE
15 years 4 months ago
Localized Multiple Kernel Regression
Multiple kernel learning (MKL) uses a weighted combination of kernels where the weight of each kernel is optimized during training. However, MKL assigns the same weight to a kerne...
Mehmet Gönen, Ethem Alpaydin
NIPS
2008
15 years 2 months ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas
59
Voted
ICML
2010
IEEE
15 years 1 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
107
Voted
CVPR
2005
IEEE
16 years 2 months ago
Local Discriminant Embedding and Its Variants
We present a new approach, called local discriminant embedding (LDE), to manifold learning and pattern classification. In our framework, the neighbor and class relations of data a...
Hwann-Tzong Chen, Huang-Wei Chang, Tyng-Luh Liu