Sciweavers

495 search results - page 6 / 99
» Learning to generalize for complex selection tasks
Sort
View
TNN
2010
143views Management» more  TNN 2010»
13 years 1 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
ICML
2006
IEEE
14 years 7 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
ROBOCUP
2007
Springer
153views Robotics» more  ROBOCUP 2007»
14 years 24 days ago
Model-Based Reinforcement Learning in a Complex Domain
Reinforcement learning is a paradigm under which an agent seeks to improve its policy by making learning updates based on the experiences it gathers through interaction with the en...
Shivaram Kalyanakrishnan, Peter Stone, Yaxin Liu
SDM
2007
SIAM
162views Data Mining» more  SDM 2007»
13 years 8 months ago
Probabilistic Joint Feature Selection for Multi-task Learning
We study the joint feature selection problem when learning multiple related classification or regression tasks. By imposing an automatic relevance determination prior on the hypo...
Tao Xiong, Jinbo Bi, R. Bharat Rao, Vladimir Cherk...
ECCV
2010
Springer
13 years 9 months ago
Clustering Complex Data with Group-Dependent Feature Selection
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...