arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2601.09347cs.ITmath.ITmath.STstat.TH
收藏

一种在边际约束下最大化熵的构造方法

Maximizing R{é}nyi Entropy over the Transportation Polytope: Structure and Algorithm

Aix Marseille Univ, CNRS, AMSE(艾克斯-马赛大学,法国国家科学研究中心,经济与社会研究所)

Pierre Jean-Claude Robert Bertrand

AI总结:

本文提出了一种在边际约束下最大化熵的构造方法,通过显式耦合构造和迭代算法实现精确解。

摘要:

我们研究了在给定边际分布下最大化Rényi熵(顺序为2)(等价于最小化巧合指数)的问题。已知在边际满足可行性条件时存在闭式优化器;我们证明该条件对边际非常限制。然后,我们为任意边际提供了显式的最优耦合构造。我们的方法刻画了优化器的结构,并产生了一个终止于有限时间的迭代算法,在最多p-1次更新后返回精确解,其中p是行数。

英文摘要:

We study the problem of finding the minimum $\mathbb{L}\_2$-norm element in a transportation polytope. It corresponds to minimizing the index of coincidence or maximizing R{é}nyi entropy over joint probability distributions with prescribed marginals. The solution is straightforward under a feasibility condition on the marginals. We make three contributions. First, we decompose the basic solution into a mixture of three interpretable couplings and derive a closed-form sampling procedure, revealing its role as the $\mathbb{L}\_2$-projection of the uniform distribution onto the transportation polytope. Second, we show that the feasibility condition becomes exponentially rare as the number of modalities grows, which highlights the practical necessity of a more general construction. Third, we provide a KKT-based iterative construction of the optimal coupling for arbitrary marginals with explicit Lagrange multipliers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑