SOURCE-LINKED INTELLIGENCE

Tensor network representations of discrete maximum entropy distributions via mean polytopes

arXiv · AI, language, vision and robotics · article · Sep 7, 2026 · UTC

We present tensor network representations for discrete maximum entropy distributions under expectation constraints. To this end, we introduce Computation-Activation Networks (CompActNets), a tensor network architecture that subsumes exponential families. By leveraging the geometry of the convex polytope of realizable expectation vectors, we represent any maximum entropy distribution in the same architecture. We exploit the fact that proper faces of this polytope correspond to the boundary closure of exponential families, which restricts the distribution's support. We then derive explicit repre

Read original source ↗ Open in workspace

recordType

paper

region

Global