pith. sign in

arxiv: 1508.05128 · v2 · pith:L6LV7AT4new · submitted 2015-08-20 · 💻 cs.AI · cs.LG· cs.NE

Lifted Relational Neural Networks

classification 💻 cs.AI cs.LGcs.NE
keywords relationallearningnetworksneuralconceptscorrespondingdifferentexamples
0
0 comments X
read the original abstract

We propose a method combining relational-logic representations with neural network learning. A general lifted architecture, possibly reflecting some background domain knowledge, is described through relational rules which may be handcrafted or learned. The relational rule-set serves as a template for unfolding possibly deep neural networks whose structures also reflect the structures of given training or testing relational examples. Different networks corresponding to different examples share their weights, which co-evolve during training by stochastic gradient descent algorithm. The framework allows for hierarchical relational modeling constructs and learning of latent relational concepts through shared hidden layers weights corresponding to the rules. Discovery of notable relational concepts and experiments on 78 relational learning benchmarks demonstrate favorable performance of the method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Diachronic Embedding for Temporal Knowledge Graph Completion

    cs.LG 2019-07 unverdicted novelty 6.0

    Proposes a model-agnostic diachronic entity embedding function to extend static KG embedding models for temporal knowledge graph completion, with a proof that the SimplE combination is fully expressive.