A First Step Towards Even More Sparse Encodings of Probability Distributions

Florian Andreas Marwitz, Tanya Braun, Ralf Möller
3/31/2026
cs.AI

No confident code implementation found for this paper.

Abstract

Real world scenarios can be captured with lifted probability distributions. However, distributions are usually encoded in a table or list, requiring an exponential number of values. Hence, we propose a method for extracting first-order formulas from probability distributions that require significantly less values by reducing the number of values in a distribution and then extracting, for each value, a logical formula to be further minimized. This reduction and minimization allows for increasing the sparsity in the encoding while also generalizing a given distribution. Our evaluation shows that sparsity can increase immensely by extracting a small set of short formulas while preserving core information.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{marwitz2026first,
  title  = {A First Step Towards Even More Sparse Encodings of Probability Distributions},
  author = {Florian Andreas Marwitz and Tanya Braun and Ralf Möller},
  year   = {2026},
  eprint = {2603.29691},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.29691v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.29691.svg)](https://codeofpaper.com/paper/2603.29691)

Discussion