Sciweavers

566 search results - page 54 / 114
» Approximation Spaces in Machine Learning and Pattern Recogni...
Sort
View
ML
2008
ACM
152views Machine Learning» more  ML 2008»
15 years 3 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
COLT
1994
Springer
15 years 7 months ago
Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes
We examine the relationship between the VCdimension and the number of parameters of a smoothly parametrized function class. We show that the VC-dimension of such a function class ...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...
165
Voted
ICML
2010
IEEE
15 years 1 months ago
The Margin Perceptron with Unlearning
We introduce into the classical Perceptron algorithm with margin a mechanism of unlearning which in the course of the regular update allows for a reduction of possible contributio...
Constantinos Panagiotakopoulos, Petroula Tsampouka
MCS
2010
Springer
15 years 10 months ago
Estimation of the Number of Clusters Using Multiple Clustering Validity Indices
One of the challenges in unsupervised machine learning is finding the number of clusters in a dataset. Clustering Validity Indices (CVI) are popular tools used to address this pro...
Krzysztof Kryszczuk, Paul Hurley
AAAI
2010
15 years 4 months ago
SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
Andrey Kolobov, Mausam, Daniel S. Weld