Sciweavers

1419 search results - page 213 / 284
» Approximation Methods for Supervised Learning
Sort
View
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
14 years 4 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
ATAL
2003
Springer
14 years 3 months ago
Coordination in multiagent reinforcement learning: a Bayesian approach
Much emphasis in multiagent reinforcement learning (MARL) research is placed on ensuring that MARL algorithms (eventually) converge to desirable equilibria. As in standard reinfor...
Georgios Chalkiadakis, Craig Boutilier
NIPS
2004
13 years 11 months ago
Schema Learning: Experience-Based Construction of Predictive Action Models
Schema learning is a way to discover probabilistic, constructivist, predictive action models (schemas) from experience. It includes methods for finding and using hidden state to m...
Michael P. Holmes, Charles Lee Isbell Jr.
ECML
2004
Springer
14 years 3 months ago
Batch Reinforcement Learning with State Importance
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
Lihong Li, Vadim Bulitko, Russell Greiner
ICML
2009
IEEE
14 years 10 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas