Self-Aware Vector Embeddings for Retrieval-Augmented Generation: A Neuroscience-Inspired Framework for Temporal, Confidence-Weighted, and Relational Knowledge

• URL: http://arxiv.org/abs/2604.20598v1
• Date: Wed, 22 Apr 2026 14:13:50 GMT
• Title: Self-Aware Vector Embeddings for Retrieval-Augmented Generation: A Neuroscience-Inspired Framework for Temporal, Confidence-Weighted, and Relational Knowledge
• Abstract summary: Modern retrieval-augmented generation (RAG) systems treat vector embeddings as static, context-free artifacts.<n>We propose Smart, a framework that augments dense embeddings with three explicit properties -- temporal awareness, confidence decay, and relational awareness.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Modern retrieval-augmented generation (RAG) systems treat vector embeddings as static, context-free artifacts: an embedding has no notion of when it was created, how trustworthy its source is, or which other embeddings depend on it. This flattening of knowledge has a measurable cost: recent work on VersionRAG reports that conventional RAG achieves only 58% accuracy on versioned technical queries, because retrieval returns semantically similar but temporally invalid content. We propose SmartVector, a framework that augments dense embeddings with three explicit properties -- temporal awareness, confidence decay, and relational awareness -- and a five-stage lifecycle modeled on hippocampal-neocortical memory consolidation. A retrieval pipeline replaces pure cosine similarity with a four-signal score that mixes semantic relevance, temporal validity, live confidence, and graph-relational importance. A background consolidation agent detects contradictions, builds dependency edges, and propagates updates along those edges as graph-neural-network-style messages. Confidence is governed by a closed-form function combining an Ebbinghaus-style exponential decay, user-feedback reconsolidation, and logarithmic access reinforcement. We formalize the model, relate it to temporal knowledge graph embedding, agentic memory architectures, and uncertainty-aware RAG, and present a reference implementation. On a reproducible synthetic versioned-policy benchmark of 258 vectors and 138 queries, SmartVector roughly doubles top-1 accuracy over plain cosine RAG (62.0% vs. 31.0% on a held-out split), drops stale-answer rate from 35.0% to 13.3%, cuts Expected Calibration Error by nearly 2x (0.244 vs. 0.470), reduces re-embedding cost per single-word edit by 77%, and is robust across contradiction-injection rates from 0% to 75%.

Related papers

• DG-FedReuse: Proxy-Gradient-Gated Cached-Update Reuse with Matched Sparse Uplink Accounting [0.0]
  DG-FedReuse is a simulator-level mechanism that allows selected clients to contribute cached updates.<n>Experiments cover six image-classification datasets, 50 virtual clients, Dirichlet label clients, and three seeds.<n> DG-FedReuse yields 83.36-85.42% modeled update-data-field uplink saving, compared with 76.88% for matched Top-K FedAvg.
  arXiv  Detail & Related papers  (2026-08-05T19:30:04Z)
• ContextShift: A Controlled Benchmark for Context Dependence in Object Detection [1.8320252176005443]
  We introduce ContextShift, a benchmark that manipulates object--context relationships while preserving object appearance.<n>We observe a consistent degradation pattern: false negatives increase by up to 227% and prediction volume decreases by up to 44%.<n>We show that context-aware augmentation improves robustness: every augmented variant outperforms the dataset-only baseline on both original and manipulated test images.
  arXiv  Detail & Related papers  (2026-06-08T13:48:16Z)
• Planning-aligned Token Compression for Long-Context Autonomous Driving [95.59023657139208]
  We propose a planning-aligned working memory framework built on conditional VQ-VA.<n>Compression is conditioned on both historical trajectory and a learned planning intent.<n>We evaluate on high-signal dynamic scenarios where historical context is most critical for behavior correctness.
  arXiv  Detail & Related papers  (2026-06-05T17:16:21Z)
• A Heterogeneous Temporal Memory Governance Framework for Long-Term LLM Persona Consistency [2.447989276487424]
  Large language models often suffer from fact loss, timeline confusion, persona drift, and reduced stability during long-range interaction.<n>We introduce ARPM, an external temporal memory governance framework for long-term dialogue.<n>We show that ARPM treats continuity as a traceable, auditable, and transferable governance problem.
  arXiv  Detail & Related papers  (2026-05-14T13:12:49Z)
• GAM: Hierarchical Graph-based Agentic Memory for LLM Agents [45.876418535406714]
  Large Language Model (LLM) agents must navigate the tension between acquiring new information and retaining prior knowledge.<n>Current unified stream-based memory systems facilitate context updates but remain vulnerable to interference from transient noise.<n>We propose GAM, a hierarchical Graph-based Agentic Memory framework that explicitly decouples memory encoding from consolidation.
  arXiv  Detail & Related papers  (2026-04-14T04:53:00Z)
• Synthetic Tabular Generators Fail to Preserve Behavioral Fraud Patterns: A Benchmark on Temporal, Velocity, and Multi-Account Signals [0.0]
  We formalize a taxonomy of four behavioral fraud patterns (P1-P4) covering inter-event timing, burst structure, multi-account graph motifs, and velocity-rule trigger rates.<n>We benchmark CTGAN, TVAE, GaussianCopula, and TabularARGN on IEEE-CIS Fraud Detection and the Amazon Fraud dataset.<n>The P1-P4 framework extends to any domain with entity-level sequential data, including healthcare and network security.
  arXiv  Detail & Related papers  (2026-04-13T19:36:00Z)
• Guaranteeing Knowledge Integration with Joint Decoding for Retrieval-Augmented Generation [45.13215113490545]
  GuarantRAG is a framework that explicitly decouples reasoning from evidence integration.<n> Experiments on five QA benchmarks demonstrate that GuarantRAG improves accuracy by up to 12.1%.
  arXiv  Detail & Related papers  (2026-04-09T09:52:21Z)
• Graph-Native Cognitive Memory for AI Agents: Formal Belief Revision Semantics for Versioned Memory Architectures [0.6091702876917279]
  Kumiho is a graph-native cognitive memory architecture grounded in formal belief revision semantics.<n>The architecture implements a dual-store model (Redis working memory, Neo4j long-term graph) with hybrid fulltext and vector retrieval.
  arXiv  Detail & Related papers  (2026-03-18T00:59:49Z)
• PRECEPT: Planning Resilience via Experience, Context Engineering & Probing Trajectories A Unified Framework for Test-Time Adaptation with Compositional Rule Learning and Pareto-Guided Prompt Evolution [2.28438857884398]
  LLM agents that store knowledge as natural language suffer steep retrieval degradation as condition count grows.<n>We introduce PRECEPT, a unified framework for test-time adaptation with three tightly coupled components.
  arXiv  Detail & Related papers  (2026-03-10T13:16:45Z)
• Multi-Axis Trust Modeling for Interpretable Account Hijacking Detection [1.0152838128195467]
  This paper proposes a Hadith-inspired multi-axis trust modeling framework.<n>We translate five trust axes - long-term integrity (adalah), behavioral precision (dabt), contextual continuity (isnad), cumulative reputation, and anomaly evidence - into a compact set of 26 semantically meaningful behavioral features for user accounts.<n>We evaluate the framework on the CLUE-LDS cloud activity dataset with injected account hijacking scenarios.
  arXiv  Detail & Related papers  (2026-02-20T19:36:30Z)
• Seeing through the Conflict: Transparent Knowledge Conflict Handling in Retrieval-Augmented Generation [12.469991196570106]
  TCR (Transparent Conflict Resolution) disentangles semantic match and factual consistency via dual contrastive encoders.<n>It raises knowledge-gap recovery by +21.4 pp and cuts misleading-context overrides by -29.3 pp, while adding only 0.3% parameters.<n>The signals align with human judgements and expose temporal decision patterns.
  arXiv  Detail & Related papers  (2026-01-11T10:08:49Z)
• TeaRAG: A Token-Efficient Agentic Retrieval-Augmented Generation Framework [62.66056331998838]
  TeaRAG is a token-efficient agentic RAG framework capable of compressing both retrieval content and reasoning steps.<n>Our reward function evaluates the knowledge sufficiency by a knowledge matching mechanism, while penalizing excessive reasoning steps.
  arXiv  Detail & Related papers  (2025-11-07T16:08:34Z)
• vCache: Verified Semantic Prompt Caching [95.16654660556975]
  This paper proposes vCache, the first verified semantic cache with user-defined error rate guarantees.<n>It employs an online learning algorithm to estimate an optimal threshold for each cached prompt, enabling reliable cache responses without additional training.<n>Our experiments show that vCache consistently meets the specified error bounds while outperforming state-of-the-art static-threshold and fine-tuned embedding baselines.
  arXiv  Detail & Related papers  (2025-02-06T04:16:20Z)
• Synchronous Faithfulness Monitoring for Trustworthy Retrieval-Augmented Generation [96.78845113346809]
  Retrieval-augmented language models (RALMs) have shown strong performance and wide applicability in knowledge-intensive tasks. This paper proposes SynCheck, a lightweight monitor that leverages fine-grained decoding dynamics to detect unfaithful sentences. We also introduce FOD, a faithfulness-oriented decoding algorithm guided by beam search for long-form retrieval-augmented generation.
  arXiv  Detail & Related papers  (2024-06-19T16:42:57Z)
• Enabling Uncertainty Estimation in Iterative Neural Networks [49.56171792062104]
  We develop an approach to uncertainty estimation that provides state-of-the-art estimates at a much lower computational cost than techniques like Ensembles.<n>We demonstrate its practical value by embedding it in two application domains: road detection in aerial images and the estimation of aerodynamic properties of 2D and 3D shapes.
  arXiv  Detail & Related papers  (2024-03-25T13:06:31Z)
• CONVERT:Contrastive Graph Clustering with Reliable Augmentation [110.46658439733106]
  We propose a novel CONtrastiVe Graph ClustEring network with Reliable AugmenTation (CONVERT) In our method, the data augmentations are processed by the proposed reversible perturb-recover network. To further guarantee the reliability of semantics, a novel semantic loss is presented to constrain the network.
  arXiv  Detail & Related papers  (2023-08-17T13:07:09Z)

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.