On the Complexity of the Compatibility Problem for Succinctly Encoded Conditional Distributions

Paper recorded by Signals 4 on 2026-08-31 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-08-31 on arXiv · recorded by Signals 4 on 2026-09-01

Category: cs.LG · 机器学习 · first seen 2026-09-01

Abstract

The motivation for this paper is the investigation of the trade-offs implicit in probabilistic models used in machine learning. Models are often used to make predictions in the form of conditional probabilities. However, a pair of conditional distributions p(x|y) and p(y|x) may not be compatible with any joint distribution p(x,y). Given two such conditionals, determining if there exists a compatib

Read on arXiv →