Sciweavers

329 search results - page 1 / 66
» Probably Approximately Correct Learning
Sort
View
SODA
2001
ACM
147views Algorithms» more  SODA 2001»
13 years 5 months ago
Sublinear time approximate clustering
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
Nina Mishra, Daniel Oblinger, Leonard Pitt
GECCO
2003
Springer
118views Optimization» more  GECCO 2003»
13 years 9 months ago
Population Sizing Based on Landscape Feature
Abstract. Population size for EvolutionaryAlgorithms is usually an empirical parameter. We study the population size from aspects of fitness landscapes’ ruggedness and Probably ...
Jian Zhang, Xiaohui Yuan, Bill P. Buckles
JMLR
2006
107views more  JMLR 2006»
13 years 4 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski
COLT
2003
Springer
13 years 9 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis