51 citations · 160 across the 8 of their papers we have counts for
4 papers · 1 filter
An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering
Michael Kearns, Yishay Mansour, Andrew Y. Ng
Assignment methods are at the heart of many algorithms for unsupervised learning and clustering - in particular, the well-known K-means and Expectation-Maximization (EM) algorithms…
Large Deviation Methods for Approximate Probabilistic Inference
Michael Kearns, Lawrence Saul
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In larg…
Exact Inference of Hidden Structure from Sample Data in Noisy-OR Networks
Michael Kearns, Yishay Mansour
In the literature on graphical models, there has been increased attention paid to the problems of learning hidden structure (see Heckerman [H96] for survey) and causal mechanisms f…
Fast Planning in Stochastic Games
Michael Kearns, Yishay Mansour, Satinder Singh
Stochastic games generalize Markov decision processes (MDPs) to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards d…