Sciweavers

12943 search results - page 625 / 2589
» Predicting When Not to Predict
Sort
View
ICML
2005
IEEE
16 years 8 months ago
Predictive low-rank decomposition for kernel methods
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
Francis R. Bach, Michael I. Jordan
ICML
2005
IEEE
16 years 8 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
ICML
2005
IEEE
16 years 8 months ago
Learning structured prediction models: a large margin approach
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...
ICML
2001
IEEE
16 years 8 months ago
General Loss Bounds for Universal Sequence Prediction
The Bayesian framework is ideally suited for induction problems. The probability of observing xt at
Marcus Hutter
ICML
2001
IEEE
16 years 8 months ago
An Improved Predictive Accuracy Bound for Averaging Classifiers
We present an improved bound on the difference between training and test errors for voting classifiers. This improved averaging bound provides a theoretical justification for popu...
John Langford, Matthias Seeger, Nimrod Megiddo