Sciweavers

23 search results - page 1 / 5
» Relative Loss Bounds for Temporal-Difference Learning
Sort
View
ICML
2000
IEEE
14 years 5 months ago
Relative Loss Bounds for Temporal-Difference Learning
Jürgen Forster, Manfred K. Warmuth
COLT
2000
Springer
13 years 8 months ago
Relative Expected Instantaneous Loss Bounds
Jürgen Forster, Manfred K. Warmuth
ALT
2004
Springer
14 years 1 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
ALT
1999
Springer
13 years 8 months ago
Extended Stochastic Complexity and Minimax Relative Loss Analysis
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
Kenji Yamanishi
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
13 years 10 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