Sciweavers

459 search results - page 7 / 92
» Average Case Analysis of Conjunctive Learning Algorithms
Sort
View
85
Voted
ICML
1994
IEEE
15 years 3 months ago
On the Worst-Case Analysis of Temporal-Difference Learning Algorithms
Robert E. Schapire, Manfred K. Warmuth
JMLR
2006
99views more  JMLR 2006»
14 years 11 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
FCT
2001
Springer
15 years 4 months ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
94
Voted
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 3 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
COLT
2004
Springer
15 years 5 months ago
Reinforcement Learning for Average Reward Zero-Sum Games
Abstract. We consider Reinforcement Learning for average reward zerosum stochastic games. We present and analyze two algorithms. The first is based on relative Q-learning and the ...
Shie Mannor