• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Using matrices to model symbolic relationships

Cached

  • Download as a PDF

Download Links

  • [books.nips.cc]
  • [www.cs.utoronto.ca]
  • [learning.cs.toronto.edu]
  • [www.cs.utoronto.ca]
  • [www.cs.toronto.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Ilya Sutskever , Geoffrey Hinton
Citations:1 - 1 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Sutskever_usingmatrices,
    author = {Ilya Sutskever and Geoffrey Hinton},
    title = {Using matrices to model symbolic relationships},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We describe a way of learning matrix representations of objects and relationships. The goal of learning is to allow multiplication of matrices to represent symbolic relationships between objects and symbolic relationships between relationships, which is the main novelty of the method. We demonstrate that this leads to excellent generalization in two different domains: modular arithmetic and family relationships. We show that the same system can learn first-order propositions such as (2,5) ∈ +3 or (Christopher, Penelope) ∈ has wife, and higher-order propositions such as (3,+3) ∈ plus and (+3, −3) ∈ inverse or (has husband, has wife) ∈ higher oppsex. We further demonstrate that the system understands how higher-order propositions are related to first-order ones by showing that it can correctly answer questions about first-order propositions involving the relations +3 or has wife even though it has not been trained on any first-order examples involving these relations. 1

Citations

408 Raedt. Inductive logic programming: Theory and methods - Muggleton, de - 1994
167 The Need for Biases in Learning Generalizations - Mitchell - 1990
154 Learning distributed representations of concepts - Hinton - 1986
119 Separating style and content with bilinear models - Tenenbaum, Freeman - 2000
114 A general framework for parallel distributed processing - Rumelhart, Hinton - 1986
81 A neural probabilistic language model - Bengio, Ducharme, et al.
35 A symbolicconnectionist theory of relational inference and generalization - Hummel, Holyoak - 2003
25 The LEABRA model of neural interactions and learning in the neocortex - O’Reilly
20 G.: Unsupervised learning of image transformations - Memisevic, Hinton - 2007
13 A theory of the discovery and predication of relational concepts - Doumas, Hummel, et al. - 2008
11 Development of localized oriented receptive fields by learning a translation-invariant code for natural images - Rao - 1998
6 Learning distributed representations of concepts using linear relational embedding - Paccanaro, Hinton
2 Learning Distributed Representations of Relational Data using Linear Relational Embedding - Paccanaro - 2002
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University