36 search results - page 3 / 8 » Likelihood Functions and Confidence Bounds for Total-Least-S... |
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
NAACL
2010
13 years 3 months ago
2010
Recently, relaxation approaches have been successfully used for MAP inference on NLP problems. In this work we show how to extend the relaxation approach to marginal inference use...
NN
2002
Springer
13 years 5 months ago
2002
Springer
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...