Vector logic allows counterfactual virtualization by The Square Root of NOT

• URL: http://arxiv.org/abs/2003.11519v3
• Date: Tue, 1 Sep 2020 21:59:24 GMT
• Title: Vector logic allows counterfactual virtualization by The Square Root of NOT
• Authors: Eduardo Mizraji
• Abstract summary: We investigate the representation of counterfactual conditionals using the vector logic, a matrix-vectors formalism for logical functions and truth values. After this basic representation, the judgment of the plausibility of a given counterfactual allows us to shift the decision towards an acceptance or a refusal.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work we investigate the representation of counterfactual conditionals using the vector logic, a matrix-vectors formalism for logical functions and truth values. Inside this formalism, the counterfactuals can be transformed in complex matrices preprocessing an implication matrix with one of the square roots of NOT, a complex matrix. This mathematical approach puts in evidence the virtual character of the counterfactuals. This happens because this representation produces a valuation of a counterfactual that is the superposition of the two opposite truth values weighted, respectively, by two complex conjugated coefficients. This result shows that this procedure gives an uncertain evaluation projected on the complex domain. After this basic representation, the judgment of the plausibility of a given counterfactual allows us to shift the decision towards an acceptance or a refusal. This shift is the result of applying for a second time one of the two square roots of NOT.

Related papers

• Generalization or Hallucination? Understanding Out-of-Context Reasoning in Transformers [76.42159902257677]
  We argue that both behaviors stem from a single mechanism known as out-of-context reasoning (OCR)<n>OCR drives both generalization and hallucination, depending on whether the associated concepts are causally related.<n>Our work provides a theoretical foundation for understanding the OCR phenomenon, offering a new lens for analyzing and mitigating undesirable behaviors from knowledge injection.
  arXiv  Detail & Related papers  (2025-06-12T16:50:45Z)
• The Origins of Representation Manifolds in Large Language Models [52.68554895844062]
  We show that cosine similarity in representation space may encode the intrinsic geometry of a feature through shortest, on-manifold paths.<n>The critical assumptions and predictions of the theory are validated on text embeddings and token activations of large language models.
  arXiv  Detail & Related papers  (2025-05-23T13:31:22Z)
• Irreducible matrix representations for the walled Brauer algebra [0.9374652839580183]
  This paper investigates the representation theory of the algebra of partially transposed permutation operators, $mathcalAd_p,p$. It provides a matrix representation for the abstract walled Brauer algebra. This algebra has recently gained significant attention due to its relevance in quantum information theory.
  arXiv  Detail & Related papers  (2025-01-22T18:22:20Z)
• Symbolic Disentangled Representations for Images [83.88591755871734]
  We propose ArSyD (Architecture for Disentanglement), which represents each generative factor as a vector of the same dimension as the resulting representation. We study ArSyD on the dSprites and CLEVR datasets and provide a comprehensive analysis of the learned symbolic disentangled representations.
  arXiv  Detail & Related papers  (2024-12-25T09:20:13Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Unsupervised Representation Learning from Sparse Transformation Analysis [79.94858534887801]
  We propose to learn representations from sequence data by factorizing the transformations of the latent variables into sparse components. Input data are first encoded as distributions of latent activations and subsequently transformed using a probability flow model.
  arXiv  Detail & Related papers  (2024-10-07T23:53:25Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning [87.73401758641089]
  Chain-of-thought (CoT) reasoning has improved the performance of modern language models (LMs) We show that LMs can represent the same family of distributions over strings as probabilistic Turing machines.
  arXiv  Detail & Related papers  (2024-06-20T10:59:02Z)
• EulerFormer: Sequential User Behavior Modeling with Complex Vector Attention [88.45459681677369]
  We propose a novel transformer variant with complex vector attention, named EulerFormer. It provides a unified theoretical framework to formulate both semantic difference and positional difference. It is more robust to semantic variations and possesses moresuperior theoretical properties in principle.
  arXiv  Detail & Related papers  (2024-03-26T14:18:43Z)
• From port-based teleportation to Frobenius reciprocity theorem: partially reduced irreducible representations and their applications [1.024113475677323]
  We show that the spectrum of the port-based teleportation operator acting on $n$ systems is connected in a very simple way with the spectrum of the Jucys-Murphy operator for the symmetric group $S(n-1)subset S(n)$. This shows on the technical level relation between teleporation and one of the basic objects from the point of view of the representation theory of the symmetric group.
  arXiv  Detail & Related papers  (2023-10-25T07:22:54Z)
• Generalized "Square roots of Not" matrices, their application to the unveiling of hidden logical operators and to the definition of fully matrix circular Euler functions [0.0]
  The square root of Not is a logical operator of importance in quantum computing theory. In physics, it is a square complex matrix of dimension 2. We show how general expressions for the two square roots of the Not operator are obtained.
  arXiv  Detail & Related papers  (2021-06-22T03:43:53Z)
• Finite dimensional systems of free Fermions and diffusion processes on Spin groups [0.0]
  finite dimensional Fermions are vectors in a finite dimensional complex space embedded in the exterior algebra over itself. We associate invariant complex vector fields on the Lie group $mathrmSpin(2n+1)$ to the Fermionic creation and annihilation operators. A probabilistic interpretation is given in terms of a Feynman-Kac like formula with respect to the diffusion process associated with the second order operator.
  arXiv  Detail & Related papers  (2021-02-01T17:25:08Z)
• A Study of Continuous Vector Representationsfor Theorem Proving [2.0518509649405106]
  We develop an encoding that allows for logical properties to be preserved and is additionally reversible. This means that the tree shape of a formula including all symbols can be reconstructed from the dense vector representation. We propose datasets that can be used to train these syntactic and semantic properties.
  arXiv  Detail & Related papers  (2021-01-22T15:04:54Z)
• Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
  We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic. Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
  arXiv  Detail & Related papers  (2020-08-06T02:13:11Z)
• J-matrix method of scattering in one dimension: The relativistic theory [0.0]
  We make a relativistic extension of the one-dimensional J-matrix method of scattering. The relativistic potential matrix is a combination of vector, scalar, and pseudo-scalar components.
  arXiv  Detail & Related papers  (2020-01-14T19:02:15Z)

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.