Proximity operators of discrete information divergences - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2018

Proximity operators of discrete information 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 solving a wide range of convex optimization problems involving ϕ-divergences. In addition, we show that these proximity operators are useful to compute the epigraphical projection of several functions. The proposed proximal tools are numerically validated in the context of optimal query execution within database management systems, where the problem of selectivity estimation plays a central role. Experiments are carried out on small to large scale scenarios.
Fichier principal
Vignette du fichier
ArticleIT.pdf (400.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01672646 , version 1 (26-12-2017)



Mireille El Gheche, Giovanni Chierchia, Jean-Christophe Pesquet. Proximity operators of discrete information divergences. IEEE Transactions on Information Theory, 2018, 64 (2), pp.1092-1104. ⟨10.1109/TIT.2017.2782789⟩. ⟨hal-01672646⟩
248 View
296 Download



Gmail Facebook Twitter LinkedIn More