SearcharxivSearch

arXiv subjects

Matthias Georg Mayer

Publications and source records attributed to Matthias Georg Mayer.

4 recordsLinked to original sources

A Theory of Structural Independence

Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models. Formally, let $U = (U_i)_{i \in I}$ be an independent family of random elements on a probability space $(Ω, \mathcal{A}, \mathbb{P})$. Let $X$, $Y$, and $Z$ be arbitrary $σ(U)$-measurable random elements. We characterize all independences $X \perp Y \mid Z$ implied by the independence of $U$ and call these independences \textit{structural}. Formally, these are the independences which hold in all probability measures $P$ that render $U$ independent and are absolutely continuous with respect to $\mathbb{P}$; i.e., for all such $P$, it must hold that $X \perp_P Y \mid Z$. We introduce the history $\mathcal{H}(X \mid Z) : Ω\to \mathcal{P}(I)$, a combinatorial object that measures the dependence of $X$ on $U_i$ for each $i \in I$ given $Z$. The independence of $X$ and $Y$ given $Z$ is implied by the independence of $U$ if and only if $\mathcal{H}(X \mid Z) \cap \mathcal{H}(Y \mid Z) = \emptyset$ almost surely with respect to $\mathbb{P}$. Finally, we apply this $d$-separation-like criterion in structural causal models to discover a causal direction in a toy setting.

math.PR

Factored space models: Towards causality between levels of abstraction

Causality plays an important role in understanding intelligent behavior, and there is a wealth of literature on mathematical models for causality, most of which is focused on causal graphs. Causal graphs are a powerful tool for a wide range of applications, in particular when the relevant variables are known and at the same level of abstraction. However, the given variables can also be unstructured data, like pixels of an image. Meanwhile, the causal variables, such as the positions of objects in the image, can be arbitrary deterministic functions of the given variables. Moreover, the causal variables may form a hierarchy of abstractions, in which the macro-level variables are deterministic functions of the micro-level variables. Causal graphs are limited when it comes to modeling this kind of situation. In the presence of deterministic relationships there is generally no causal graph that satisfies both the Markov condition and the faithfulness condition. We introduce factored space models as an alternative to causal graphs which naturally represent both probabilistic and deterministic relationships at all levels of abstraction. Moreover, we introduce structural independence and establish that it is equivalent to statistical independence in every distribution that factorizes over the factored space. This theorem generalizes the classical soundness and completeness theorem for d-separation.

cs.AI

An algorithm for minimum cardinality generators of cones

This paper presents a novel proof that for any convex cone, the size of conically independent generators is at most twice that of minimum cardinality generators. While this result is known for linear spaces, we extend it to general cones through a decomposition into linear and pointed components. Our constructive approach leads to a polynomial-time algorithm for computing minimum cardinality generators of finitely generated cones, improving upon existing methods that only compute conically independent generators.

math.OC

A characterization of mutual absolute continuity of probability measures on a filtered space

We give a new characterization for mutual absolute continuity of probability measures on a filtered space. For this, we introduce a martingale limit $M$ that measures the similarity between the tails of the probability measures restricted to the filtration. The measures are mutually absolutely continuous if and only if $M = 1$ holds almost surely for both measures. In this case, the square roots of the Radon-Nikodym derivatives on the filtration converge in $L^2$. Finally, we apply the result to families of random variables and stochastic processes.

math.PR