Sciweavers

5785 search results - page 124 / 1157
» Approximability of Probability Distributions
Sort
View
COLT
2003
Springer
15 years 11 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
ICML
2004
IEEE
16 years 7 months ago
Learning random walk models for inducing word dependency distributions
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
Kristina Toutanova, Christopher D. Manning, Andrew...
MICCAI
2007
Springer
16 years 7 months ago
MCMC Curve Sampling for Image Segmentation
Abstract. We present an algorithm to generate samples from probability distributions on the space of curves. We view a traditional curve evolution energy functional as a negative l...
Ayres C. Fan, John W. Fisher III, William M. Wells...
JMLR
2011
145views more  JMLR 2011»
15 years 1 months ago
Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Func
We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks...
Jim C. Huang, Brendan J. Frey