CONTENT
Robustness of the p-norm algorithms -- Minimax regret under log loss for general classes of experts -- On theory revision with queries -- Apprentice learning model -- On learning in the presence of unspecified attribute values -- Approximation algorithms for clustering problems -- Drifting games -- Multiclass learning, boosting, and error-correcting codes -- Theoretical analysis of a randomized regularization methods
SUBJECT
-
Computational learning theory -- Congresses
LOCATION | CALL# | STATUS |
---|
Central Library (5th Floor) | 371.334 C748P |
CHECK SHELVES
|