Role-Aware Modeling for N-ary Relational Knowledge Bases

• URL: http://arxiv.org/abs/2104.09780v1
• Date: Tue, 20 Apr 2021 06:37:22 GMT
• Title: Role-Aware Modeling for N-ary Relational Knowledge Bases
• Abstract summary: We propose a Role-Aware Modeling, RAM, for facts in n-ary relational KBs. RAM explores a latent space that contains basis vectors, and represents roles by linear combinations of these vectors. To this end, it presents a multilinear scoring function to measure the plausibility of a fact composed by certain roles and entities.
• Score: 38.40941919126033
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: N-ary relational knowledge bases (KBs) represent knowledge with binary and beyond-binary relational facts. Especially, in an n-ary relational fact, the involved entities play different roles, e.g., the ternary relation PlayCharacterIn consists of three roles, ACTOR, CHARACTER and MOVIE. However, existing approaches are often directly extended from binary relational KBs, i.e., knowledge graphs, while missing the important semantic property of role. Therefore, we start from the role level, and propose a Role-Aware Modeling, RAM for short, for facts in n-ary relational KBs. RAM explores a latent space that contains basis vectors, and represents roles by linear combinations of these vectors. This way encourages semantically related roles to have close representations. RAM further introduces a pattern matrix that captures the compatibility between the role and all involved entities. To this end, it presents a multilinear scoring function to measure the plausibility of a fact composed by certain roles and entities. We show that RAM achieves both theoretical full expressiveness and computation efficiency, which also provides an elegant generalization for approaches in binary relational KBs. Experiments demonstrate that RAM outperforms representative baselines on both n-ary and binary relational datasets.

Related papers

• From Facts to Insights: A Persona-Driven Dual Memory Framework and Dataset for Role-Playing Agents [50.66268133366637]
  Current systems rely on persona-agnostic summarization, which records facts without persona-specific interpretation.<n>We introduce RoleMemo, a dataset featuring four reasoning tasks where the factual fragments must be interpreted through the persona to reach the correct answer.<n>We propose DualMem, which decouples memory into two streams: factual cognition and persona-conditioned insight.
  arXiv  Detail & Related papers  (2026-05-25T10:48:24Z)
• RelPrism: A Multi-Faceted Pre-training Framework with Self-Generated Tasks for Relational Databases [49.47033473074821]
  We propose RelPrism, a multi-faceted self-supervised learning framework for RDBs.<n>RDB tasks often require multi-faceted information across different perspectives and granularities.<n>Our experiments show that RelPrism improves ROC-AUC by 4.15% for classification and reduces MAE by 10.75% for regression over state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-05-22T05:19:58Z)
• Activation Functions, Statistics and Learning of Higher-Order Interactions in Restricted Boltzmann Machines [0.0]
  We study the statistics of the interactions induced by Restricted Boltzmann Machines with different hidden unit activation functions.<n>We characterize the space of representable models analytically in terms of moments of the distribution of induced interactions.<n>We find that rapidly increasing nonlinearities, such as the Exponential function, can facilitate the representation and learning of such data structures.
  arXiv  Detail & Related papers  (2026-05-18T23:04:24Z)
• Geometric Factual Recall in Transformers [57.48371649045765]
  A common view casts internal weight matrices as associative memories over pairs of embeddings, requiring memorization counts that scale linearly with the number of facts.<n>We develop a theoretical and empirical account of an alternative, emphgeometric form of memorization in which learned embeddings encode structure directly.<n>In a controlled setting where a single-layer transformer must memorize random vectors from subjects to a shared attribute set, we prove that a logarithmic embedding dimension suffices.<n>We extend these results to the multi-hop setting, providing constructions with and without chain-of-thought that exhibit a provable
  arXiv  Detail & Related papers  (2026-05-12T17:22:22Z)
• Cross-Modal Attention Network with Dual Graph Learning in Multimodal Recommendation [12.802844514133255]
  Cross-modal Recursive Attention Network with dual graph Embedding (CRANE)<n>We design a core Recursive Cross-Modal Attention (RCA) mechanism that iteratively refines modality features based on cross-correlations in a joint latent space.<n>For symmetric multimodal learning, we explicitly construct users' multimodal profiles by aggregating features of their interacted items.
  arXiv  Detail & Related papers  (2026-01-16T10:09:39Z)
• Character-R1: Enhancing Role-Aware Reasoning in Role-Playing Agents via RLVR [67.66592867046229]
  Character-R1 is a framework designed to provide verifiable reward signals for effective role-aware reasoning.<n>Our framework comprises three core designs: Cognitive Focus Reward, Reference-Guided Reward and Character-Conditioned Reward Normalization.
  arXiv  Detail & Related papers  (2026-01-08T05:33:37Z)
• Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering [75.12322966980003]
  Large Language Models (LLMs) have shown strong inductive reasoning ability across various domains.<n>Most existing RAG pipelines rely on unstructured text, limiting interpretability and structured reasoning.<n>Recent studies have explored integrating knowledge graphs with LLMs for knowledge graph question answering.<n>We propose RAPL, a novel framework for efficient and effective graph retrieval in KGQA.
  arXiv  Detail & Related papers  (2025-06-11T12:03:52Z)
• Information-Theoretic Measures on Lattices for High-Order Interactions [0.7373617024876725]
  We present a framework based on lattice theory to derive higher-order information-theoretic measures for multivariate data. We show that many commonly used measures can be derived within this framework, yet they fail to capture all interactions for $d>3$. To fully characterise all interactions among $d$ variables, we introduce the Streitberg Information, which is defined over the full partition lattice.
  arXiv  Detail & Related papers  (2024-08-14T13:04:34Z)
• Large Language Models are Superpositions of All Characters: Attaining Arbitrary Role-play via Self-Alignment [62.898963074989766]
  We introduce Ditto, a self-alignment method for role-play. This method creates a role-play training set comprising 4,000 characters, surpassing the scale of currently available datasets by tenfold. We present the first comprehensive cross-supervision alignment experiment in the role-play domain.
  arXiv  Detail & Related papers  (2024-01-23T03:56:22Z)
• Utilizing Contextual Clues and Role Correlations for Enhancing Document-level Event Argument Extraction [14.684710634595866]
  Document-level event argument extraction is a crucial yet challenging task within the field of information extraction. Here, we introduce a novel framework named CARLG, comprising two innovative components: the Contextual Clues Aggregation (CCA) and the Role-based Latent Information Guidance (RLIG) We then instantiate the CARLG framework into two variants based on two types of current mainstream EAE approaches. Notably, our CARLG framework introduces less than 1% new parameters yet significantly improving the performance.
  arXiv  Detail & Related papers  (2023-10-08T11:09:16Z)
• OTIEA:Ontology-enhanced Triple Intrinsic-Correlation for Cross-lingual Entity Alignment [12.054806502375575]
  Cross-lingual and cross-domain knowledge alignment without sufficient external resources is a fundamental and crucial task. This paper proposes a novel universal EA framework (OTIEA) based on ontology pair and role enhancement mechanism via triple-aware attention. The experimental results on three real-world datasets show that our framework achieves a competitive performance compared with baselines.
  arXiv  Detail & Related papers  (2023-05-02T16:03:54Z)
• On Neural Architecture Inductive Biases for Relational Tasks [76.18938462270503]
  We introduce a simple architecture based on similarity-distribution scores which we name Compositional Network generalization (CoRelNet) We find that simple architectural choices can outperform existing models in out-of-distribution generalizations.
  arXiv  Detail & Related papers  (2022-06-09T16:24:01Z)
• Relational Representation Learning in Visually-Rich Documents [14.942600317107082]
  We propose DocReL, a contextual Document Representation framework. The major challenge of DocReL roots in the variety of relations. We propose a novel contrastive task named Consistency Modeling (RCM), which harnesses the fact that existing relations should be consistent in augmented positive views. RCM provides relational representations which are more compatible to the urgent need of downstream tasks, even without any knowledge about the exact definition of relation.
  arXiv  Detail & Related papers  (2022-05-05T02:54:31Z)
• Disentangled Representation Learning for Text-Video Retrieval [51.861423831566626]
  Cross-modality interaction is a critical component in Text-Video Retrieval (TVR) We study the interaction paradigm in depth, where we find that its computation can be split into two terms. We propose a disentangled framework to capture a sequential and hierarchical representation.
  arXiv  Detail & Related papers  (2022-03-14T13:55:33Z)
• Link Prediction on N-ary Relational Data Based on Relatedness Evaluation [61.61555159755858]
  We propose a method called NaLP to conduct link prediction on n-ary relational data. We represent each n-ary relational fact as a set of its role and role-value pairs. Experimental results validate the effectiveness and merits of the proposed methods.
  arXiv  Detail & Related papers  (2021-04-21T09:06:54Z)
• Relation of the Relations: A New Paradigm of the Relation Extraction Problem [52.21210549224131]
  We propose a new paradigm of Relation Extraction (RE) that considers as a whole the predictions of all relations in the same context. We develop a data-driven approach that does not require hand-crafted rules but learns by itself the relation of relations (RoR) using Graph Neural Networks and a relation matrix transformer. Experiments show that our model outperforms the state-of-the-art approaches by +1.12% on the ACE05 dataset and +2.55% on SemEval 2018 Task 7.2.
  arXiv  Detail & Related papers  (2020-06-05T22:25:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.