Sciweavers

12194 search results - page 279 / 2439
» Numberings Optimal for Learning
Sort
View
ICML
2005
IEEE
16 years 7 months ago
A comparison of tight generalization error bounds
We investigate the empirical applicability of several bounds (a number of which are new) on the true error rate of learned classifiers which hold whenever the examples are chosen ...
John Langford, Matti Kääriäinen
ICML
2006
IEEE
16 years 7 months ago
Accelerated training of conditional random fields with stochastic gradient methods
We apply Stochastic Meta-Descent (SMD), a stochastic gradient optimization method with gain vector adaptation, to the training of Conditional Random Fields (CRFs). On several larg...
S. V. N. Vishwanathan, Nicol N. Schraudolph, Mark ...
CORR
1998
Springer
164views Education» more  CORR 1998»
15 years 6 months ago
Training Reinforcement Neurocontrollers Using the Polytope Algorithm
A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic model and employs the polytope optimization algorit...
Aristidis Likas, Isaac E. Lagaris
COLT
2010
Springer
15 years 4 months ago
Composite Objective Mirror Descent
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
John Duchi, Shai Shalev-Shwartz, Yoram Singer, Amb...
WEBNET
2001
15 years 8 months ago
Building Learning Architectures: Domain Instruction Server (DIS)
: Web based instruction is growing at an incredible rate. Teachers, instructors, trainers and several others are putting their instructional content online. The format, style and m...
Juan E. Gilbert, Dale-Marie Wilson