Minimum cross-entropy distributions on Wasserstein balls and their applications

Abstract

Given a prior probability density p on a compact set K we characterize the probability distribution qδ* on K contained in a Wasserstein ball Bδ(μ) centered in a given discrete measure μ for which the relative-entropy H(q,p) achieves its minimum. This characterization gives us an algorithm for computing such distributions efficiently

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…