Weakly supervised causal representation learning

J Brehmer, P De Haan, P Lippe… - Advances in Neural …, 2022 - proceedings.neurips.cc
Learning high-level causal representations together with a causal model from unstructured
low-level data such as pixels is impossible from observational data alone. We prove under …

Beyond boundaries: A comprehensive survey of transferable attacks on ai systems

G Wang, C Zhou, Y Wang, B Chen, H Guo… - arxiv preprint arxiv …, 2023 - arxiv.org
Artificial Intelligence (AI) systems such as autonomous vehicles, facial recognition, and
speech recognition systems are increasingly integrated into our daily lives. However …

Category theory in machine learning

D Shiebler, B Gavranović, P Wilson - arxiv preprint arxiv:2106.07032, 2021 - arxiv.org
Over the past two decades machine learning has permeated almost every realm of
technology. At the same time, many researchers have begun using category theory as a …

The d-separation criterion in categorical probability

T Fritz, A Klingler - Journal of Machine Learning Research, 2023 - jmlr.org
The d-separation criterion detects the compatibility of a joint probability distribution with a
directed acyclic graph through certain conditional independences. In this work, we study this …

Axioms for retrodiction: achieving time-reversal symmetry with a prior

AJ Parzygnat, F Buscemi - Quantum, 2023 - quantum-journal.org
We propose a category-theoretic definition of retrodiction and use it to exhibit a time-reversal
symmetry for all quantum channels. We do this by introducing retrodiction families and …

Markov categories and entropy

P Perrone - IEEE Transactions on Information Theory, 2023 - ieeexplore.ieee.org
Markov categories are a novel framework to describe and treat problems in probability and
information theory. In this work we combine the categorical formalism with the traditional …

An introduction to string diagrams for computer scientists

R Piedeleu, F Zanasi - arxiv preprint arxiv:2305.08768, 2023 - arxiv.org
This document is an elementary introduction to string diagrams. It takes a computer science
perspective: rather than using category theory as a starting point, we build on intuitions from …

De Finetti's Theorem in Categorical Probability

T Fritz, T Gonda, P Perrone - arxiv preprint arxiv:2105.02639, 2021 - arxiv.org
We present a novel proof of de Finetti's Theorem characterizing permutation-invariant
probability measures of infinite sequences of variables, so-called exchangeable measures …

Lilac: a modal separation logic for conditional probability

JM Li, A Ahmed, S Holtzen - Proceedings of the ACM on Programming …, 2023 - dl.acm.org
We present Lilac, a separation logic for reasoning about probabilistic programs where
separating conjunction captures probabilistic independence. Inspired by an analogy with …

Towards compositional interpretability for xai

S Tull, R Lorenz, S Clark, I Khan, B Coecke - arxiv preprint arxiv …, 2024 - arxiv.org
Artificial intelligence (AI) is currently based largely on black-box machine learning models
which lack interpretability. The field of eXplainable AI (XAI) strives to address this major …