Sciweavers

3837 search results - page 92 / 768
» Learning Approximate Consistencies
Sort
View
NIPS
2000
15 years 5 months ago
A New Approximate Maximal Margin Classification Algorithm
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...
Claudio Gentile
NIPS
2003
15 years 5 months ago
Approximate Expectation Maximization
We discuss the integration of the expectation-maximization (EM) algorithm for maximum likelihood learning of Bayesian networks with belief propagation algorithms for approximate i...
Tom Heskes, Onno Zoeter, Wim Wiegerinck
ICML
2003
IEEE
16 years 5 months ago
Optimizing Classifier Performance via an Approximation to the Wilcoxon-Mann-Whitney Statistic
When the goal is to achieve the best correct classification rate, cross entropy and mean squared error are typical cost functions used to optimize classifier performance. However,...
Lian Yan, Robert H. Dodier, Michael Mozer, Richard...
ICML
2002
IEEE
16 years 5 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
149
Voted
ICML
2010
IEEE
15 years 5 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio