Sciweavers

3378 search results - page 84 / 676
» Learning in Friedberg Numberings
Sort
View
COLT
2000
Springer
15 years 5 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann
BIS
2008
132views Business» more  BIS 2008»
15 years 2 months ago
Evaluate - An Innovative Service for Learning Performance Monitoring in Businesses
In this paper we present Evaluate, a platform for learning performance monitoring. Evaluate manages a number of artefacts that can be used to monitor learning performance, like met...
Bernd Simon, Kasra Seirafi, Asmund Realfsen, Mark ...
UAI
2001
15 years 2 months ago
The Optimal Reward Baseline for Gradient-Based Reinforcement Learning
There exist a number of reinforcement learning algorithms which learn by climbing the gradient of expected reward. Their long-run convergence has been proved, even in partially ob...
Lex Weaver, Nigel Tao
ICML
2010
IEEE
15 years 1 months ago
Efficient Learning with Partially Observed Attributes
We describe and analyze efficient algorithms for learning a linear predictor from examples when the learner can only view a few attributes of each training example. This is the ca...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
CVPR
2008
IEEE
15 years 22 days ago
Robust learning of discriminative projection for multicategory classification on the Stiefel manifold
Learning a robust projection with a small number of training samples is still a challenging problem in face recognition, especially when the unseen faces have extreme variation in...
Duc-Son Pham, Svetha Venkatesh