Logistic Tensor Factorization for Multi-Relational Data
Maximilian Nickel, Volker Tresp
2013-06-10Relational Reasoning
Abstract
Tensor factorizations have become increasingly popular approaches for various learning tasks on structured data. In this work, we extend the RESCAL tensor factorization, which has shown state-of-the-art results for multi-relational learning, to account for the binary nature of adjacency tensors. We study the improvements that can be gained via this approach on various benchmark datasets and show that the logistic extension can improve the prediction results significantly.
Related Papers
FreeQ-Graph: Free-form Querying with Semantic Consistent Scene Graph for 3D Scene Understanding2025-06-16LogiPlan: A Structured Benchmark for Logical Planning and Relational Reasoning in LLMs2025-06-12Differentially Private Relational Learning with Entity-level Privacy Guarantees2025-06-10Relational reasoning and inductive bias in transformers trained on a transitive inference task2025-06-04ModuLM: Enabling Modular and Multimodal Molecular Relational Learning with Large Language Models2025-06-01Visual Abstract Thinking Empowers Multimodal Reasoning2025-05-26Bridging Generative and Discriminative Learning: Few-Shot Relation Extraction via Two-Stage Knowledge-Guided Pre-training2025-05-18MIRAGE: A Multi-modal Benchmark for Spatial Perception, Reasoning, and Intelligence2025-05-15