Sciweavers

3718 search results - page 363 / 744
» On learning with dissimilarity functions
Sort
View
AAAI
2010
15 years 8 months ago
Reinforcement Learning Via Practice and Critique Advice
We consider the problem of incorporating end-user advice into reinforcement learning (RL). In our setting, the learner alternates between practicing, where learning is based on ac...
Kshitij Judah, Saikat Roy, Alan Fern, Thomas G. Di...
NIPS
2008
15 years 8 months ago
Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
Francis Bach
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 8 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
NIPS
1993
15 years 8 months ago
Temporal Difference Learning of Position Evaluation in the Game of Go
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sej...
DBWORKSHOPS
1992
15 years 8 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin