Sciweavers

766 search results - page 35 / 154
» Variations on U-Shaped Learning
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 8 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
99
Voted
ICML
2008
IEEE
16 years 1 months ago
Metric embedding for kernel classification rules
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
Bharath K. Sriperumbudur, Omer A. Lang, Gert R. G....
85
Voted
UAI
2004
15 years 2 months ago
Variational Chernoff Bounds for Graphical Models
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual paramete...
Pradeep D. Ravikumar, John D. Lafferty
100
Voted
FTML
2008
185views more  FTML 2008»
15 years 25 days ago
Graphical Models, Exponential Families, and Variational Inference
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Martin J. Wainwright, Michael I. Jordan
CVPR
2007
IEEE
16 years 2 months ago
Learning Dynamic Event Descriptions in Image Sequences
Automatic detection of dynamic events in video sequences has a variety of applications including visual surveillance and monitoring, video highlight extraction, intelligent transp...
Harini Veeraraghavan, Nikolaos Papanikolopoulos, P...