acceptodds
Under review as a conference paper at ICLR 2027

ConcepTensor:A Probabilistic Relational Representation Architecture for DAGs Embedded in High-Dimensional Tensors

Abstract

Cognitive representation requires encoding entities and their hierarchical relations in a concept system into a queryable and reasoning-ready formal structure. Existing methods follow two paths. Symbolic hierarchical structures are explicit and traceable, but are constrained to a single parent, unable to express an entity belonging to multiple upper concepts. Distributed vector representations are flexible and generalizable, but are not white-box, and their internal representations are not traceable. White-box, general, and scalable properties are difficult to achieve simultaneously: Bayesian networks are the only model that is both white-box and general, but their exact inference complexity grows exponentially with graph size, and the inference process gradually becomes non-hand-verifiable. This paper proposes ConceptTensor, which embeds a multi-parent DAG into a high-dimensional tensor space and computes relations directly via tensor contraction. Entity coordinates are determined by Dirichlet posterior; hierarchy, parent, and child are carried by three tensor axes; relations such as parent, child, common parent, common child, sibling, and multi-hop are all directly given by tensor contraction. The architecture decouples representation from inference, involves no training, and every intermediate value is hand-verifiable. On six query tasks over multi-parent DAGs, it achieves an order-of-magnitude efficiency improvement over Bayesian networks.

Primary area:
interpretability and explainable AI
Keywords:
Cognitive representation, High-dimensional tensor, Tensor contraction, Multi-parent DAG, White-box reasoning

Reviews

Among:
Shape:
1234this paper, Bottom 1%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 1.00 over 3 reviews, above 0% of the others.
Reviewer_rmRHOpenReview ↗
Rating
1
Confidence
2
Informativeness
1
Presentation
1
Soundness
1
Read review
Paper summary

The paper introduces ConceptTensor, a method to represent a DAG as a tensor, weighting edges by it's parent's Dirichelt posterior over levels and a Gaussian span weight. It defines some querying operations, such as parent/child retrieval. The method is evaluated on 2 small (synthetic?) graphs.

Critical strengths

None.

Critical weaknesses

In my honest opinion, this paper is not at all close to being in a state where it is ready to be reviewed. Below, I have included some examples of this.

  • The motivation in the introduction is very vague, and does not state the problem that's being studied. It has some mention about embedding entities and relations, and says that “White-box, generality, and scalability are difficult to achieve simultaneously.” But what this has to do with each other is not mentioned.
  • The paper does not position its contributions adequately in relation to prior work. As an indication, the related work section only cites 4 papers.
  • The presentation of the paper is very problematic. Basic information, such as having captions for tables, is missing. Many sections (e.g. 4.5, 4.6, 4.7) only contain definitions and no actual explanation what is going on. Moreover, many of these defenitions seems trivial or unnecessary (such as Proposition 4 which says that the if c is a child of p, p is a parent of c).
  • The evaluation does not really explain its setup. I do not even know what the dataset is. Given that only 2 small graphs (with N = 25 and 50) are included, the experiments are also extremely limited in scope.
Questions for authors

I do not see anything that could materially affect my assessment, see weaknesses.

Reviewer_HynpOpenReview ↗
Rating
1
Confidence
4
Informativeness
1
Presentation
1
Soundness
1
Read review
Paper summary

This paper proposes ConceptTensor, a probabilistic tensor representation framework for modeling hierarchical relationships in Multi-parent DAGs. ConceptTensor employs a Dirichlet posterior to estimate entity-level probability distributions and constructs a three-dimensional tensor to encode hierarchical information and parent-child relationships. Next, ConceptTensor implements various relational query operations through tensor contractions, including parent and child retrieval, common-parent and common-child identification, sibling similarity computation, and multi-hop traversal.

Critical strengths

The paper explores an interpretable tensor-based representation for hierarchical relationships in multi-parent DAGs, which is a potentially interesting research.

Critical weaknesses
  1. This manuscript does not appear to meet the basic standards of a scientific research paper.

  2. Introduction should be substantially rewritten to better articulate the significance and motivation.

  3. Most of the operations supported by ConceptTensor can be implemented using conventional weighted graph representations, rather than showing any particularly novel breakthrough.

  4. Definition 11 introduces a partial inner product that fixes the parent index while comparing two child indices. However, Definition 15 applies this operator to two parent indices and one child index to compute common-child scores. This operation is not directly covered by the preceding definition.

Questions for authors

See Weaknesses

Reviewer_K4XwOpenReview ↗
Rating
1
Confidence
2
Informativeness
1
Presentation
1
Soundness
2
Read review
Paper summary

To address the difficulty of existing cognitive representations in simultaneously achieving white-box, generality, and scalability, the authors propose ConceptTensor, an architecture that embeds a multi-parent DAG into a high-dimensional tensor space and computes relations directly by tensor contraction. Compared with Bayesian networks, ConceptTensor achieves significant efficiency improvements on six query tasks.

Critical strengths
  1. The paper achieves a complete and self-consistent formalization through its definition–proposition–proof chain.
  2. The design of a static representation layer and a stateless inference layer achieves the decoupling of representation and inference.
  3. The paper has good reproducibility.
Critical weaknesses
  1. The method lacks novelty: it is a repackaging of graph linear algebra.
  2. The experiments are overly simple: ablation studies are missing, there is no downstream-task performance comparison, and there are no results on real concept systems such as WordNet or ConceptNet.
  3. Every table lacks a proper caption.
Questions for authors
  1. Compared with knowledge graphs, what is the advantage of ConceptTensor?
  2. All the key information described in Sec. 1.1 — the entity set, the level evidence, and the parent-child relations — comes from external sources; how do you ensure the quality of this information?

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.