Sciweavers

1393 search results - page 59 / 279
» Machine Learning by Function Decomposition
Sort
View
ESANN
2008
15 years 3 months ago
Learning to play Tetris applying reinforcement learning methods
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
Alexander Groß, Jan Friedland, Friedhelm Sch...
ML
1998
ACM
15 years 1 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
NIPS
2007
15 years 3 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
ICML
2005
IEEE
16 years 2 months ago
An efficient method for simplifying support vector machines
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
DucDung Nguyen, Tu Bao Ho
JMLR
2010
121views more  JMLR 2010»
14 years 8 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor