A Unified Linear Algebraic Framework for Physical Models and Generalized Contextuality

• URL: http://arxiv.org/abs/2512.10000v1
• Date: Wed, 10 Dec 2025 19:00:09 GMT
• Title: A Unified Linear Algebraic Framework for Physical Models and Generalized Contextuality
• Authors: Farid Shahandeh, Theodoros Yianni, Mina Doosti,
• Abstract summary: We operationalize rank separation via two complementary methods provided by the linear-algebraic framework.<n>By reframing contextuality as a problem in matrix analysis, our work provides a unified structure for its systematic study.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We develop a bottom-up, statistics-first framework in which the full probabilistic content of an operational theory is encoded in its matrix of conditional outcome probabilities of events (COPE). Within this setting, five model classes (preGPTs, GPTs, quasiprobabilistic, ontological, and noncontextual ontological) are unified as constrained factorizations of the COPE matrix. We identify equirank factorizations as the structural core of GPTs and noncontextual ontological models and establish their relation to tomographic completeness. This yields a simple, model-agnostic criterion for noncontextuality: an operational theory admits a noncontextual ontological model if and only if its COPE matrix admits an equirank nonnegative matrix factorization (ENMF). Failure of the equirank condition in all ontological models therefore establishes contextuality. We operationalize rank separation via two complementary methods provided by the linear-algebraic framework. First, we use ENMF to interpret noncontextual ontological models as nested polytopes. This allows us to establish that the boxworld operational theory is ontologically contextual. Second, we apply techniques from discrete mathematics to derive a lower bound on the ontological dimensionality of COPE matrices exhibiting sparsity patterns, and use this bound to establish a new proof that a discrete version of qubit theory exhibits ontological contextuality. By reframing contextuality as a problem in matrix analysis, our work provides a unified structure for its systematic study and opens new avenues for exploring nonclassical resources.

Related papers

• Towards A Unified PAC-Bayesian Framework for Norm-based Generalization Bounds [63.47271262149291]
  We propose a unified framework for PAC-Bayesian norm-based generalization.<n>The key to our approach is a sensitivity matrix that quantifies the network outputs with respect to structured weight perturbations.<n>We derive a family of generalization bounds that recover several existing PAC-Bayesian results as special cases.
  arXiv  Detail & Related papers  (2026-01-13T00:42:22Z)
• SIGMA: Scalable Spectral Insights for LLM Collapse [51.863164847253366]
  We introduce SIGMA (Spectral Inequalities for Gram Matrix Analysis), a unified framework for model collapse.<n>By utilizing benchmarks that deriving and deterministic bounds on the matrix's spectrum, SIGMA provides a mathematically grounded metric to track the contraction of the representation space.<n>We demonstrate that SIGMA effectively captures the transition towards states, offering both theoretical insights into the mechanics of collapse.
  arXiv  Detail & Related papers  (2026-01-06T19:47:11Z)
• Mutual Information Free Topological Generalization Bounds via Stability [46.63069403118614]
  We introduce a novel learning theoretic framework that departs from the existing strategies.<n>We prove that the generalization error of trajectory-stable algorithms can be upper bounded in terms of TDA terms.
  arXiv  Detail & Related papers  (2025-07-09T12:03:25Z)
• Discrete Markov Bridge [93.64996843697278]
  We propose a novel framework specifically designed for discrete representation learning, called Discrete Markov Bridge.<n>Our approach is built upon two key components: Matrix Learning and Score Learning.
  arXiv  Detail & Related papers  (2025-05-26T09:32:12Z)
• The Theory of the Unique Latent Pattern: A Formal Epistemic Framework for Structural Singularity in Complex Systems [2.44755919161855]
  This paper introduces the Theory of the Unique Latent Pattern (ULP), a formal framework that redefines the origin of apparent complexity in dynamic systems.<n>Rather than attributing unpredictability to intrinsic randomness or emergent nonlinearity, ULP asserts that every analyzable system is governed by a structurally unique, deterministic generative mechanism.
  arXiv  Detail & Related papers  (2025-05-24T19:52:28Z)
• Information Science Principles of Machine Learning: A Causal Chain Meta-Framework Based on Formalized Information Mapping [7.299890614172539]
  This study addresses key challenges in machine learning, namely the absence of a unified formal theoretical framework and the lack of foundational theories for model interpretability and ethical safety.<n>We first construct a formal information model, explicitly defining the ontological states and carrier mappings of typical machine learning stages.<n>By introducing learnable and processable predicates, as well as learning and processing functions, we analyze the causal chain logic and constraint laws governing machine learning processes.
  arXiv  Detail & Related papers  (2025-05-19T14:39:41Z)
• Causal Representation Learning from Multimodal Biomedical Observations [57.00712157758845]
  We develop flexible identification conditions for multimodal data and principled methods to facilitate the understanding of biomedical datasets.<n>Key theoretical contribution is the structural sparsity of causal connections between modalities.<n>Results on a real-world human phenotype dataset are consistent with established biomedical research.
  arXiv  Detail & Related papers  (2024-11-10T16:40:27Z)
• Learning Discrete Concepts in Latent Hierarchical Models [73.01229236386148]
  Learning concepts from natural high-dimensional data holds potential in building human-aligned and interpretable machine learning models.<n>We formalize concepts as discrete latent causal variables that are related via a hierarchical causal model.<n>We substantiate our theoretical claims with synthetic data experiments.
  arXiv  Detail & Related papers  (2024-06-01T18:01:03Z)
• Learning Visual-Semantic Subspace Representations [49.17165360280794]
  We introduce a nuclear norm-based loss function, grounded in the same information theoretic principles that have proved effective in self-supervised learning.<n>We present a theoretical characterization of this loss, demonstrating that, in addition to promoting classity, it encodes the spectral geometry of the data within a subspace lattice.
  arXiv  Detail & Related papers  (2024-05-25T12:51:38Z)
• Causal Abstraction: A Theoretical Foundation for Mechanistic Interpretability [30.76910454663951]
  Causal abstraction provides a theoretical foundation for mechanistic interpretability.<n>Our contributions are generalizing the theory of causal abstraction from mechanism replacement to arbitrary mechanism transformation.
  arXiv  Detail & Related papers  (2023-01-11T20:42:41Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• A structure theorem for generalized-noncontextual ontological models [0.0]
  We use a process-theoretic framework to prove that every generalized-noncontextual ontological model of a tomographically local operational theory has a surprisingly rigid and simple mathematical structure. We extend known results concerning the equivalence of different notions of classicality from prepare-measure scenarios to arbitrary compositional scenarios.
  arXiv  Detail & Related papers  (2020-05-14T17:28:19Z)
• Solvable Criterion for the Contextuality of any Prepare-and-Measure Scenario [0.0]
  An operationally noncontextual ontological model of the quantum statistics associated with the prepare-and-measure scenario is constructed. A mathematical criterion, called unit separability, is formulated as the relevant classicality criterion. We reformulate our results in the framework of generalized probabilistic theories.
  arXiv  Detail & Related papers  (2020-03-13T18:00:05Z)

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.