BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization
The paper introduces BoxLitE, a knowledge base embedding model that utilizes convex optimization. This model aims to enhance the representation of knowledge by mapping concepts to convex regions in a vector space. The authors demonstrate that BoxLitE can create embeddings that maintain desirable properties of faithfulness for knowledge bases.
- ▪BoxLitE is designed for DL-Lite$^{\mathcal{H}}$ knowledge bases.
- ▪The model leverages convex optimization to improve knowledge representation.
- ▪The paper presents a proof of concept for formulating the embedding task as a convex optimization problem.
arXiv cs.AI files mainly under ai research. We currently carry 1,128 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | arXiv cs.AI |
| Canonical URL | https://arxiv.org/abs/2605.23937 |
| Publication time | Tue, 26 May 2026 00:00:00 -0400 |
| Retrieval time | 2026-05-26T04:07:43.013Z |
| Last seen | 2026-05-26T04:07:43.013Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | xc1_ryG9g8zZ |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Artificial Intelligence arXiv:2605.23937 (cs) [Submitted on 27 Apr 2026] Title:BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization Authors:Bruno F. Lourenço, Hesham Morgan, Ana Ozaki, Aleksandar Pavlović, Emanuel Sallinger View a PDF of the paper titled BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization, by Bruno F. Louren\c{c}o and 4 other authors View PDF HTML (experimental) 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.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.
Discussion
0 commentsMore from arXiv cs.AI
