Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Weakly supervised causal representation learning
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 …
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
Artificial Intelligence (AI) systems such as autonomous vehicles, facial recognition, and
speech recognition systems are increasingly integrated into our daily lives. However …
speech recognition systems are increasingly integrated into our daily lives. However …
Category theory in machine learning
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 …
technology. At the same time, many researchers have begun using category theory as a …
The d-separation criterion in categorical probability
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 …
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 …
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 …
information theory. In this work we combine the categorical formalism with the traditional …
An introduction to string diagrams for computer scientists
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 …
perspective: rather than using category theory as a starting point, we build on intuitions from …
De Finetti's Theorem in Categorical Probability
We present a novel proof of de Finetti's Theorem characterizing permutation-invariant
probability measures of infinite sequences of variables, so-called exchangeable measures …
probability measures of infinite sequences of variables, so-called exchangeable measures …
Lilac: a modal separation logic for conditional probability
We present Lilac, a separation logic for reasoning about probabilistic programs where
separating conjunction captures probabilistic independence. Inspired by an analogy with …
separating conjunction captures probabilistic independence. Inspired by an analogy with …
Towards compositional interpretability for xai
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 …
which lack interpretability. The field of eXplainable AI (XAI) strives to address this major …