Sciweavers

16188 search results - page 1 / 3238
» The Optimal PAC Algorithm
Sort
View
COLT
2004
Springer
13 years 10 months ago
The Optimal PAC Algorithm
Manfred K. Warmuth
ICML
2006
IEEE
14 years 5 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
13 years 6 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
COLT
2004
Springer
13 years 8 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
FLAIRS
2004
13 years 6 months ago
Multimodal Function Optimization Using Local Ruggedness Information
In multimodal function optimization, niching techniques create diversification within the population, thus encouraging heterogeneous convergence. The key to the effective diversif...
Jian Zhang 0007, Xiaohui Yuan, Bill P. Buckles