$γ(3,4)$ `Attention' in Cognitive Agents: Ontology-Free Knowledge Representations With Promise Theoretic Semantics

• URL: http://arxiv.org/abs/2512.19084v1
• Date: Mon, 22 Dec 2025 06:48:53 GMT
• Title: $γ(3,4)$ `Attention' in Cognitive Agents: Ontology-Free Knowledge Representations With Promise Theoretic Semantics
• Abstract summary: Semantic and dynamics of attention' are closely related to promise theoretic notions developed for autonomous agents.<n>One may establish a bridge between vectorized Machine Learning and Knowledge Graph representations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The semantics and dynamics of `attention' are closely related to promise theoretic notions developed for autonomous agents and can thus easily be written down in promise framework. In this way one may establish a bridge between vectorized Machine Learning and Knowledge Graph representations without relying on language models implicitly. Our expectations for knowledge presume a degree of statistical stability, i.e. average invariance under repeated observation, or `trust' in the data. Both learning networks and knowledge graph representations can meaningfully coexist to preserve different aspects of data. While vectorized data are useful for probabilistic estimation, graphs preserve the intentionality of the source even under data fractionation. Using a Semantic Spacetime $γ(3,4)$ graph, one avoids complex ontologies in favour of classification of features by their roles in semantic processes. The latter favours an approach to reasoning under conditions of uncertainty. Appropriate attention to causal boundary conditions may lead to orders of magnitude compression of data required for such context determination, as required in the contexts of autonomous robotics, defence deployments, and ad hoc emergency services.

Related papers

• Quantitative Promise Theory: Intentionality and Inference in Autonomous Agents [0.0]
  I discuss some quantitative representations of Promise Theory for processes involving autonomous agents.<n>I describe how Bayesian probability and information theoretic optimization, including Active Inference, may be incorporated with promise semantics.
  arXiv  Detail & Related papers  (2026-06-07T10:12:44Z)
• Statistical Inference via Generative Models: Flow Matching and Causal Inference [0.0]
  Generative AI has achieved remarkable empirical success, but from the perspective of statistics it often remains opaque.<n>This book reinterprets generative AI in the language of statistics, using flow matching as a central example.
  arXiv  Detail & Related papers  (2026-03-09T22:56:02Z)
• Topology Identification and Inference over Graphs [61.06365536861156]
  Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks.<n>This chapter provides an overview of graph topology identification and statistical inference methods for multidimensional data.
  arXiv  Detail & Related papers  (2025-12-11T00:47:09Z)
• Two Birds with One Stone: Enhancing Uncertainty Quantification and Interpretability with Graph Functional Neural Process [27.760002432327962]
  Graph neural networks (GNNs) are powerful tools on graph data.<n>However, their predictions are mis-calibrated and lack interpretability.<n>We propose a new uncertainty-aware and interpretable graph classification model.
  arXiv  Detail & Related papers  (2025-08-23T17:48:05Z)
• Graph Counterfactual Explainable AI via Latent Space Traversal [4.337339380445765]
  Counterfactual explanations aim to explain predictions by finding the ''nearest'' in-distribution alternative input.<n>We propose a method to generate counterfactual explanations for any differentiable black-box graph classifier.<n>We empirically validate the approach on three graph datasets, showing that our model is consistently high-performing and more robust than the baselines.
  arXiv  Detail & Related papers  (2025-01-15T15:04:10Z)
• Topological Interpretability for Deep-Learning [0.30806551485143496]
  Deep learning (DL) models cannot quantify the certainty of their predictions. This work presents a method to infer prominent features in two DL classification models trained on clinical and non-clinical text.
  arXiv  Detail & Related papers  (2023-05-15T13:38:13Z)
• Interpretable Self-Aware Neural Networks for Robust Trajectory Prediction [50.79827516897913]
  We introduce an interpretable paradigm for trajectory prediction that distributes the uncertainty among semantic concepts. We validate our approach on real-world autonomous driving data, demonstrating superior performance over state-of-the-art baselines.
  arXiv  Detail & Related papers  (2022-11-16T06:28:20Z)
• Neuro-Symbolic Artificial Intelligence (AI) for Intent based Semantic Communication [85.06664206117088]
  6G networks must consider semantics and effectiveness (at end-user) of the data transmission. NeSy AI is proposed as a pillar for learning causal structure behind the observed data. GFlowNet is leveraged for the first time in a wireless system to learn the probabilistic structure which generates the data.
  arXiv  Detail & Related papers  (2022-05-22T07:11:57Z)
• Bayesian Graph Contrastive Learning [55.36652660268726]
  We propose a novel perspective of graph contrastive learning methods showing random augmentations leads to encoders. Our proposed method represents each node by a distribution in the latent space in contrast to existing techniques which embed each node to a deterministic vector. We show a considerable improvement in performance compared to existing state-of-the-art methods on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-12-15T01:45:32Z)
• Leveraging Unlabeled Data for Entity-Relation Extraction through Probabilistic Constraint Satisfaction [54.06292969184476]
  We study the problem of entity-relation extraction in the presence of symbolic domain knowledge. Our approach employs semantic loss which captures the precise meaning of a logical sentence. With a focus on low-data regimes, we show that semantic loss outperforms the baselines by a wide margin.
  arXiv  Detail & Related papers  (2021-03-20T00:16:29Z)
• Learning while Respecting Privacy and Robustness to Distributional Uncertainties and Adversarial Data [66.78671826743884]
  The distributionally robust optimization framework is considered for training a parametric model. The objective is to endow the trained model with robustness against adversarially manipulated input data. Proposed algorithms offer robustness with little overhead.
  arXiv  Detail & Related papers  (2020-07-07T18:25:25Z)
• Self-Supervised Relational Reasoning for Representation Learning [5.076419064097733]
  In self-supervised learning, a system is tasked with achieving a surrogate objective by defining alternative targets on unlabeled data. We propose a novel self-supervised formulation of relational reasoning that allows a learner to bootstrap a signal from information implicit in unlabeled data. We evaluate the proposed method following a rigorous experimental procedure, using standard datasets, protocols, and backbones.
  arXiv  Detail & Related papers  (2020-06-10T14:24:25Z)
• Scenario-Transferable Semantic Graph Reasoning for Interaction-Aware Probabilistic Prediction [29.623692599892365]
  Accurately predicting the possible behaviors of traffic participants is an essential capability for autonomous vehicles. We propose a novel generic representation for various driving environments by taking the advantage of semantics and domain knowledge.
  arXiv  Detail & Related papers  (2020-04-07T00:34:36Z)
• Symbolic Learning and Reasoning with Noisy Data for Probabilistic Anchoring [19.771392829416992]
  We propose a semantic world modeling approach based on bottom-up object anchoring. We extend the definitions of anchoring to handle multi-modal probability distributions. We use statistical relational learning to enable the anchoring framework to learn symbolic knowledge.
  arXiv  Detail & Related papers  (2020-02-24T16:58:00Z)

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.