Sciweavers

701 search results - page 17 / 141
» Self Bounding Learning Algorithms
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
PODS
1999
ACM
121views Database» more  PODS 1999»
13 years 12 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
14 years 23 days ago
New Usage of SOM for Genetic Algorithms
Abstract. Self-Organizing Map (SOM) is an unsupervised learning neural network and it is used for preserving the structural relationships in the data without prior knowledge. SOM h...
Jung Hwan Kim, Byung Ro Moon
COLT
2000
Springer
13 years 12 months ago
Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process (  ¢¡¤£¦¥§  ), and focus on gradient ascent approache...
Peter L. Bartlett, Jonathan Baxter
JMLR
2010
143views more  JMLR 2010»
13 years 2 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii