Proximity Operators of Discrete Information Divergences
Mireille El Gheche, Giovanni Chierchia, Jean-Christophe Pesquet

TL;DR
This paper introduces new proximity operators for discrete information divergences, enabling more efficient convex optimization involving these measures, with applications demonstrated in database query optimization.
Contribution
The paper derives closed-form proximity operators for two-variable convex divergences, facilitating their use in standard proximal algorithms and broadening their practical applicability.
Findings
Proximity operators enable efficient optimization with divergence measures.
Validated methods improve query selectivity estimation in databases.
Experiments show scalability from small to large datasets.
Abstract
Information divergences allow one to assess how close two distributions are from each other. Among the large panel of available measures, a special attention has been paid to convex -divergences, such as Kullback-Leibler, Jeffreys-Kullback, Hellinger, Chi-Square, Renyi, and I divergences. While -divergences have been extensively studied in convex analysis, their use in optimization problems often remains challenging. In this regard, one of the main shortcomings of existing methods is that the minimization of -divergences is usually performed with respect to one of their arguments, possibly within alternating optimization techniques. In this paper, we overcome this limitation by deriving new closed-form expressions for the proximity operator of such two-variable functions. This makes it possible to employ standard proximal methods for efficiently…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
