arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.08813cs.ITmath.IT
收藏

Maximizing the Bregman divergence from a Bregman family

Johannes Rauh, František Matúš

英文摘要:

The problem to maximize the information divergence from an exponential family is generalized to the setting of Bregman divergences and suitably defined Bregman families.

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

↑