Sciweavers

40 search results - page 4 / 8
» Learning Permutations with Exponential Weights
Sort
View
AAAI
1997
13 years 9 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander
COLT
2010
Springer
13 years 5 months ago
Hedging Structured Concepts
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivine...
PAMI
2010
205views more  PAMI 2010»
13 years 6 months ago
Learning a Hierarchical Deformable Template for Rapid Deformable Object Parsing
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
Long Zhu, Yuanhao Chen, Alan L. Yuille
ICML
2008
IEEE
14 years 8 months ago
Statistical models for partial membership
We present a principled Bayesian framework for modeling partial memberships of data points to clusters. Unlike a standard mixture model which assumes that each data point belongs ...
Katherine A. Heller, Sinead Williamson, Zoubin Gha...
PAMI
2006
114views more  PAMI 2006»
13 years 7 months ago
Nonparametric Supervised Learning by Linear Interpolation with Maximum Entropy
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...
Maya R. Gupta, Robert M. Gray, Richard A. Olshen