BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization

• URL: http://arxiv.org/abs/2605.23937v1
• Date: Mon, 27 Apr 2026 11:45:23 GMT
• Title: BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization
• Abstract summary: We introduce BoxLitE, a KB embedding model for DL-Lite$mathcalH$ that allows for convex optimization.<n>We show that for any satisfiable DL-Lite$mathcalH$ KB, there is a BoxLitE embedding that is a weakly faithful model.
• Score: 42.93601682502099
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge base (KB) embeddings aim at combining the capability of classical knowledge graph embeddings to generalize the information present in facts, the ABox, with conceptual knowledge represented in an ontology language, the TBox. Several authors have recently explored the idea of mapping concepts to convex regions in a vector space. This is useful to represent hierarchies, typically present in TBoxes, since more general concepts can be mapped to larger regions, containing those regions associated with more specific concepts. However, the power of convexity is rarely leveraged during the actual learning tasks. Here, we introduce BoxLitE, a KB embedding model for DL-Lite$^{\mathcal{H}}$ that allows for convex optimization. We show that for any satisfiable DL-Lite$^{\mathcal{H}}$ KB, there is a BoxLitE embedding that is a weakly faithful model. As a proof of concept, we show how to formulate the KB embedding task as a convex optimization problem and how to obtain embeddings with such desirable faithfulness properties.

Related papers

• Attribute-formed Class-specific Concept Space: Endowing Language Bottleneck Model with Better Interpretability and Scalability [54.420663939897686]
  We propose the Attribute-formed Language Bottleneck Model (ALBM) to achieve interpretable image recognition.<n>ALBM organizes concepts in the attribute-formed class-specific space, where concepts are descriptions of specific attributes for specific classes.<n>To further improve interpretability, we propose Visual Attribute Prompt Learning (VAPL) to extract visual features on fine-grained attributes.
  arXiv  Detail & Related papers  (2025-03-26T07:59:04Z)
• Conceptual Learning via Embedding Approximations for Reinforcing Interpretability and Transparency [2.7719338074999547]
  Concept bottleneck models (CBMs) have emerged as critical tools in domains where interpretability is paramount. This study proposes underlinetextbfConceptual underlinetextbfLbedding via underlinetextbfEmbedding underlinetextbfApproximations for underlinetextbfReinforcing Interpretability and Transparency.
  arXiv  Detail & Related papers  (2024-06-13T06:04:34Z)
• Sparse Concept Bottleneck Models: Gumbel Tricks in Contrastive Learning [86.15009879251386]
  We propose a novel architecture and method of explainable classification with Concept Bottleneck Models (CBM) CBMs require an additional set of concepts to leverage. We show a significant increase in accuracy using sparse hidden layers in CLIP-based bottleneck models.
  arXiv  Detail & Related papers  (2024-04-04T09:43:43Z)
• CLIP-QDA: An Explainable Concept Bottleneck Model [3.570403495760109]
  We introduce an explainable algorithm designed from a multi-modal foundation model, that performs fast and explainable image classification. Our explanations compete with existing XAI methods while being faster to compute.
  arXiv  Detail & Related papers  (2023-11-30T18:19:47Z)
• Concept2Box: Joint Geometric Embeddings for Learning Two-View Knowledge Graphs [77.10299848546717]
  Concept2Box is a novel approach that jointly embeds the two views of a KG. Box embeddings learn the hierarchy structure and complex relations such as overlap and disjoint among them. We propose a novel vector-to-box distance metric and learn both embeddings jointly.
  arXiv  Detail & Related papers  (2023-07-04T21:37:39Z)
• CAR: Conceptualization-Augmented Reasoner for Zero-Shot Commonsense Question Answering [56.592385613002584]
  We propose Conceptualization-Augmented Reasoner (CAR) to tackle the task of zero-shot commonsense question answering. CAR abstracts a commonsense knowledge triple to many higher-level instances, which increases the coverage of CommonSense Knowledge Bases. CAR more robustly generalizes to answering questions about zero-shot commonsense scenarios than existing methods.
  arXiv  Detail & Related papers  (2023-05-24T08:21:31Z)
• Box Embeddings for the Description Logic EL++ [21.89072991669119]
  We present BoxEL, a geometric KB embedding approach that allows for better capturing logical structure. We show theoretical guarantees (soundness) of BoxEL for preserving logical structure. Experimental results on subsumption reasoning and a real-world application-protein-protein prediction show that BoxEL outperforms traditional knowledge graph embedding methods.
  arXiv  Detail & Related papers  (2022-01-24T19:24:22Z)
• BoxE: A Box Embedding Model for Knowledge Base Completion [53.57588201197374]
  Knowledge base completion (KBC) aims to automatically infer missing facts by exploiting information already present in a knowledge base (KB) Existing embedding models are subject to at least one of the following limitations. BoxE embeds entities as points, and relations as a set of hyper-rectangles (or boxes)
  arXiv  Detail & Related papers  (2020-07-13T09:40:49Z)

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.