Sciweavers

701 search results - page 59 / 141
» Self Bounding Learning Algorithms
Sort
View
SLSFS
2005
Springer
14 years 2 months ago
Generalization Bounds for Subspace Selection and Hyperbolic PCA
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...
Andreas Maurer
ALT
2004
Springer
14 years 6 months ago
Prediction with Expert Advice by Following the Perturbed Leader for General Weights
When applying aggregating strategies to Prediction with Expert Advice, the learning rate must be adaptively tuned. The natural choice of complexity/current loss renders the analys...
Marcus Hutter, Jan Poland
EUROCOLT
1995
Springer
14 years 16 days ago
A decision-theoretic generalization of on-line learning and an application to boosting
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
Yoav Freund, Robert E. Schapire
NIPS
2008
13 years 10 months ago
Human Active Learning
We investigate a topic at the interface of machine learning and cognitive science. Human active learning, where learners can actively query the world for information, is contraste...
Rui M. Castro, Charles Kalish, Robert Nowak, Ruich...
JMLR
2006
117views more  JMLR 2006»
13 years 9 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon