Sciweavers

966 search results - page 67 / 194
» A Two-Level Learning Method for Generalized Multi-instance P...
Sort
View
ICML
1995
IEEE
16 years 3 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
128
Voted
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
16 years 2 months ago
Practical learning from one-sided feedback
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
D. Sculley
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 6 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ITICSE
1997
ACM
15 years 6 months ago
A genetic algorithms tutorial tool for numerical function optimisation
The field of Genetic Algorithms has grown into a huge area over the last few years. Genetic Algorithms are adaptive methods, which can be used to solve search and optimisation pro...
Edmund K. Burke, D. B. Varley
NIPS
2008
15 years 3 months ago
Optimization on a Budget: A Reinforcement Learning Approach
Many popular optimization algorithms, like the Levenberg-Marquardt algorithm (LMA), use heuristic-based "controllers" that modulate the behavior of the optimizer during ...
Paul Ruvolo, Ian R. Fasel, Javier R. Movellan