811 citations · 1.3k across the 5 of their papers we have counts for
5 papers
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…
PEGASUS: A Policy Search Method for Large MDPs and POMDPs
Andrew Y. Ng, Michael I. Jordan
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mod…
Zero-Shot Learning Through Cross-Modal Transfer
Richard Socher, Milind Ganjoo, Hamsa Sridhar +3
This work introduces a model that can recognize objects in images even if no training data is available for the objects. The only necessary knowledge about the unseen categories co…
Learning New Facts From Knowledge Bases With Neural Tensor Networks and Semantic Word Vectors
Danqi Chen, Richard Socher, Christopher D. Manning +1
Knowledge bases provide applications with the benefit of easily accessible, systematic relational knowledge but often suffer in practice from their incompleteness and lack of knowl…
Learning Factor Graphs in Polynomial Time & Sample Complexity
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
We study computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded factor size…