Sciweavers

2088 search results - page 154 / 418
» The Probabilistic Method
Sort
View
132
Voted
MM
2004
ACM
154views Multimedia» more  MM 2004»
15 years 8 months ago
PLSA-based image auto-annotation: constraining the latent space
We address the problem of unsupervised image auto-annotation with probabilistic latent space models. Unlike most previous works, which build latent space representations assuming ...
Florent Monay, Daniel Gatica-Perez
AAAI
2008
15 years 5 months ago
Maximum Entropy Inverse Reinforcement Learning
Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recoveri...
Brian Ziebart, Andrew L. Maas, J. Andrew Bagnell, ...
AIPS
2009
15 years 4 months ago
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
Ronald Bjarnason, Alan Fern, Prasad Tadepalli
EPEW
2010
Springer
15 years 4 months ago
Composing Systems While Preserving Probabilities
Abstract. Restricting the power of the schedulers that resolve the nondeterminism in probabilistic concurrent systems has recently drawn the attention of the research community. Th...
Sonja Georgievska, Suzana Andova
CSDA
2007
94views more  CSDA 2007»
15 years 3 months ago
Some extensions of score matching
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
Aapo Hyvärinen