Login / Signup
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm.
Mark Herbster
Published in:
ALT (2004)
Keyphrases
</>
worst case
loss bounds
computational complexity
learning algorithm
optimal solution
special case
convergence rate
monte carlo
objective function
classification algorithm
expectation maximization
probabilistic model
dynamic programming
np hard
closed form
linear regression
aggregating algorithm