Trustworthy Domain-Specific AI for Structured Knowledge Retrieval and Reasoning
cs.IR, cs.AI
Submitted: 2026-10-06
Updated: 2026-10-06
Code: https://github.com/lanl/pyDNMFk
Project page: https://senderle.github.io/topic-modeling-tool/documentation/2017/01/06/quickstart.html
License: http://creativecommons.org/licenses/by/4.0/
The gist: This dissertation presents a scalable architecture for transforming unstructured, domain-specific text into structured knowledge for retrieval and reasoning.
Abstract
This dissertation presents a scalable architecture for transforming unstructured, domain-specific text into structured knowledge for retrieval and reasoning. It integrates semi-automatic corpus curation, semantic structuring, retrieval, and inference into an interpretable pipeline. The research introduces Binary Bleed, an adapted binary search method that reduces low-rank search complexity for Non-negative Matrix Factorization (NMF), and Hierarchical NMF with automatic latent feature selection (HNMFk), a depth-adaptive topic modeling method that produces interpretable taxonomies guided by subject matter experts. These representations populate a typed Knowledge Graph and a semantically aligned Vector Store containing extracted latent features, synchronized through an event-driven substrate. Tensor-Structured Retrieval-Augmented Generation (T-SRAG) dynamically routes queries across retrieval paths. Contrastive alignment maps document and query embeddings to hierarchical topic structures to improve semantic fidelity and reduce hallucinations. Beyond retrieval, tensor-based link prediction identifies and completes missing links in the Knowledge Graph, supporting inference grounded in citation structure. Applications across cybersecurity, law, materials science, and healthcare demonstrate improvements in retrieval precision, early trend detection, hypothesis generation, and hallucination mitigation. The dissertation provides a deployable, modular foundation for trustworthy, domain-specific AI systems that retrieve and reason over structured knowledge.
Sources
- HybridRAG: Integrating Knowledge Graphs and Vector Retrieval Augmented Generation for Efficient Information Extraction
- Confidence from Invariance to Image Transformations
- Analysis of Legal Documents via Non-negative Matrix Factorization Methods
- Modified Binary Search Algorithm
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
- FedSPLIT: One-Shot Federated Recommendation System Based on Non-negative Joint Matrix Factorization and Knowledge Distillation
- BERTopic: Neural topic modeling with a class-based TF-IDF procedure
- The Semantic Scholar Open Data Platform
- When to Retrieve: Teaching LLMs to Utilize Information Retrieval Effectively
- PaperQA: Retrieval-Augmented Generative Agent for Scientific Research
- HybGRAG: Hybrid Retrieval-Augmented Generation on Textual and Relational Knowledge Bases
- Guided Semi-Supervised Non-negative Matrix Factorization on Legal Documents
- Encouraging Divergent Thinking in Large Language Models through Multi-Agent Debate
- UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction
- Recent Developments in Boolean Matrix Factorization
- An FCA-based Boolean Matrix Factorisation for Collaborative Filtering
- Biomedical knowledge graph-optimized prompt generation for large language models
- Minimum description length as an objective function for non-negative matrix factorization
- CaseLink: Inductive Graph Learning for Legal Case Retrieval
- Chain-of-Thought Prompting Elicits Reasoning in Large Language Models
Related papers
- The Price of Isolation: Estimating the Ecosystem Cost of Symmetric Two-Sided A/B Testing
- SCAR: Semantic Continuity-Aware Retrieval for Efficient Context Expansion in RAG
- MixLoRA-DSI: Dynamically Expandable Mixture-of-LoRA Experts for Rehearsal-Free Generative Retrieval over Dynamic Corpora
- How Do LLM-Generated Texts Impact Term-Based Retrieval Models?
- MemSyco-Bench: Benchmarking Sycophancy in Agent Memory
- Training with Missed Targets in Generative Recommendation: Separating Supervision from Probability Competition