Ontology-constrained multi-LLM scoring of hypothesis support in the predictive processing literature

• URL: http://arxiv.org/abs/2606.05206v1
• Date: Sat, 23 May 2026 19:19:32 GMT
• Title: Ontology-constrained multi-LLM scoring of hypothesis support in the predictive processing literature
• Abstract summary: Local multi-LLM pipeline reads papers, extracts evidence, incorporates figure descriptions, assembles constrained prompts, and validates outputs.<n>Council of ten local language models scored 31 studies according to their agreement or disagreement with each glossary factor.<n>Temperature was lower for local oddball contexts and higher for global oddball contexts, indicating greater dispersion in the latter.
• Score: 39.21200612994709
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fragmentation is common in interdisciplinary fields with diverse methods and theoretical commitments. Predictive coding neuroscience is a clear example: its literature spans computational theory, electrophysiology, imaging, behavior, and modeling, creating a synthesis problem that conventional meta-analysis cannot easily resolve. Here, we describe a local multi-LLM pipeline for ontology-constrained literature synthesis. The pipeline reads papers, extracts evidence, incorporates figure descriptions, assembles constrained prompts, and validates outputs against an expert glossary. We manually defined a predictive-coding glossary of thirty-six concepts grouped into three hypotheses: predictive suppression, feedforward error propagation, and ubiquity. A council of ten local language models scored 31 studies according to their agreement or disagreement with each glossary factor across local and global oddball contexts. This enabled pairwise study-agreement analysis, cross-model comparison, and three-dimensional hypothesis-space mapping. Agreement was high for some hypotheses but weaker for others, revealing structured disagreement, particularly across local versus global oddball paradigms. We further define hypothesis-space temperature, a geometric dispersion metric measuring how compactly studies occupy the hypothesis space. Temperature was lower for local oddball contexts and higher for global oddball contexts, indicating greater dispersion in the latter. The scoring geometry also allowed us to estimate vectors of change between experimental contexts. These results demonstrate that local multi-LLM councils can produce auditable disagreement measurements that map heterogeneous literatures into quantitative evidence spaces. This framework may generalize to cross-study hypothesis mapping where conventional meta-analysis lacks a common comparison space.

Related papers

• Learning the Geometry of Admissible Hypotheses through Inductive Bias in Training Distributions [3.8824066002669855]
  We present a framework for learning continuous latent representations of admissible partial differential equations (PDEs) by embedding a scientific inductive bias directly into the training distribution.<n> Experimental results show that the resulting 11-dimensional representation accurately reconstructs a broad collection of representative PDEs.
  arXiv  Detail & Related papers  (2026-08-31T16:09:41Z)
• Bucketing the Good Apples: A Method for Diagnosing and Improving Causal Abstraction [12.945075768474618]
  We present a method for diagnosing interpretation in neural networks by identifying an input subspace where a proposed interpretation is highly faithful.<n>We refine this framework by partitioning the input space into well-interpreted and under-interpreted regions according to pairwise interchange-intervention behavior.
  arXiv  Detail & Related papers  (2026-05-04T05:09:21Z)
• Hybrid topic modelling for computational close reading: Mapping narrative themes in Pushkin's Evgenij Onegin [0.0]
  This study presents a hybrid topic modelling framework for computational literary analysis.<n>It integrates Latent Dirichlet Allocation (LDA) with sparse Partial Least Squares Discriminant Analysis (sPLS-DA) to model thematic structure and longitudinal dynamics in narrative poetry.
  arXiv  Detail & Related papers  (2026-03-20T13:37:08Z)
• WavePhaseNet: A DFT-Based Method for Constructing Semantic Conceptual Hierarchy Structures (SCHS) [0.0]
  This paper reformulates Transformer/Attention mechanisms in Large Language Models.<n> Dimensionality Reduction GPT-4's 24,576-dimensional embedding space exhibits a 1/f spectral structure based on language self-similarity and Zipf's law.<n>Cohomological Consistency Control The reduced embedding space, constructed via cohomological regularization over overlapping local windows, allows defining a graph structure and cochain complex.
  arXiv  Detail & Related papers  (2026-02-16T03:07:41Z)
• HypoSpace: Evaluating LLM Creativity as Set-Valued Hypothesis Generators under Underdetermination [46.896452542901805]
  We introduce HypoSpace, a diagnostic suite that treats LLMs as samplers of finite hypothesis sets.<n>We instantiate HypoSpace in three structured domains with deterministic validators and exactly enumerated hypothesis spaces.<n>Across instruction-tuned and reasoning-focused models, Validity often remains high while Uniqueness and Recovery degrade as the admissible space grows.
  arXiv  Detail & Related papers  (2025-10-17T13:00:32Z)
• Can Diffusion Models Disentangle? A Theoretical Perspective [37.21661224725838]
  This paper presents a novel theoretical framework for understanding how diffusion models can learn disentangled representations.<n>We establish identifiability conditions for general disentangled latent variable models, analyze training dynamics, and derive sample complexity bounds for disentangled latent subspace models.
  arXiv  Detail & Related papers  (2025-03-31T20:46:18Z)
• Graph Stochastic Neural Process for Inductive Few-shot Knowledge Graph Completion [63.68647582680998]
  We focus on a task called inductive few-shot knowledge graph completion (I-FKGC) Inspired by the idea of inductive reasoning, we cast I-FKGC as an inductive reasoning problem. We present a neural process-based hypothesis extractor that models the joint distribution of hypothesis, from which we can sample a hypothesis for predictions. In the second module, based on the hypothesis, we propose a graph attention-based predictor to test if the triple in the query set aligns with the extracted hypothesis.
  arXiv  Detail & Related papers  (2024-08-03T13:37:40Z)
• Distributional Associations vs In-Context Reasoning: A Study of Feed-forward and Attention Layers [49.80959223722325]
  We study the distinction between feed-forward and attention layers in large language models.<n>We find that feed-forward layers tend to learn simple distributional associations such as bigrams, while attention layers focus on in-context reasoning.
  arXiv  Detail & Related papers  (2024-06-05T08:51:08Z)
• Seeing Unseen: Discover Novel Biomedical Concepts via Geometry-Constrained Probabilistic Modeling [53.7117640028211]
  We present a geometry-constrained probabilistic modeling treatment to resolve the identified issues. We incorporate a suite of critical geometric properties to impose proper constraints on the layout of constructed embedding space. A spectral graph-theoretic method is devised to estimate the number of potential novel classes.
  arXiv  Detail & Related papers  (2024-03-02T00:56:05Z)
• Prototype-based Aleatoric Uncertainty Quantification for Cross-modal Retrieval [139.21955930418815]
  Cross-modal Retrieval methods build similarity relations between vision and language modalities by jointly learning a common representation space. However, the predictions are often unreliable due to the Aleatoric uncertainty, which is induced by low-quality data, e.g., corrupt images, fast-paced videos, and non-detailed texts. We propose a novel Prototype-based Aleatoric Uncertainty Quantification (PAU) framework to provide trustworthy predictions by quantifying the uncertainty arisen from the inherent data ambiguity.
  arXiv  Detail & Related papers  (2023-09-29T09:41:19Z)
• Simplicial quantum contextuality [0.0]
  We introduce a new framework for contextuality based on simplicial sets, models of topological spaces that play a prominent role in homotopy theory. Our approach extends measurement scenarios to consist of spaces (rather than sets) of measurements and outcomes. We present a topologically inspired new proof of Fine's theorem for characterizing noncontextuality in Bell scenarios.
  arXiv  Detail & Related papers  (2022-04-13T22:03:28Z)

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.