Sciweavers

3694 search results - page 263 / 739
» Stochastic complexity in learning
Sort
View
ICML
1994
IEEE
15 years 10 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
IJCV
2000
164views more  IJCV 2000»
15 years 6 months ago
Probabilistic Modeling and Recognition of 3-D Objects
This paper introduces a uniform statistical framework for both 3-D and 2-D object recognition using intensity images as input data. The theoretical part provides a mathematical too...
Joachim Hornegger, Heinrich Niemann
COLT
2010
Springer
15 years 4 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
COLT
2010
Springer
15 years 4 months ago
Best Arm Identification in Multi-Armed Bandits
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
Jean-Yves Audibert, Sébastien Bubeck, R&eac...
ICPR
2010
IEEE
15 years 4 months ago
Data Classification on Multiple Manifolds
Unlike most previous manifold-based data classification algorithms assume that all the data points are on a single manifold, we expect that data from different classes may reside ...
Rui Xiao, Qijun Zhao, David Zhang, Pengfei Shi