Sciweavers

1450 search results - page 74 / 290
» Complexity of Inference in Graphical Models
Sort
View
ICML
2010
IEEE
13 years 10 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
DCC
2011
IEEE
13 years 4 months ago
Deplump for Streaming Data
We present a general-purpose, lossless compressor for streaming data. This compressor is based on the deplump probabilistic compressor for batch data. Approximations to the infere...
Nicholas Bartlett, Frank Wood
ACCV
2006
Springer
14 years 22 days ago
Complex Activity Representation and Recognition by Extended Stochastic Grammar
Stochastic grammar has been used in many video analysis and event recognition applications as an efficient model to represent large-scale video activity. However, in previous works...
Zhang Zhang, Kaiqi Huang, Tieniu Tan
SAC
2008
ACM
13 years 8 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
NIPS
2003
13 years 10 months ago
Bias-Corrected Bootstrap and Model Uncertainty
The bootstrap has become a popular method for exploring model (structure) uncertainty. Our experiments with artificial and realworld data demonstrate that the graphs learned from...
Harald Steck, Tommi Jaakkola