Maximizing the Bregman divergence from a Bregman family
Kybernetika, Tome 56 (2020) no. 5, pp. 875-885
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
The problem to maximize the information divergence from an exponential family is generalized to the setting of Bregman divergences and suitably defined Bregman families.
DOI :
10.14736/kyb-2020-5-0875
Classification :
52A41, 62B05, 62E15, 62E17, 94A17
Keywords: Bregman divergence; relative entropy; exponential family; optimization
Keywords: Bregman divergence; relative entropy; exponential family; optimization
@article{10_14736_kyb_2020_5_0875,
author = {Rauh, Johannes and Mat\'u\v{s}, Franti\v{s}ek},
title = {Maximizing the {Bregman} divergence from a {Bregman} family},
journal = {Kybernetika},
pages = {875--885},
publisher = {mathdoc},
volume = {56},
number = {5},
year = {2020},
doi = {10.14736/kyb-2020-5-0875},
mrnumber = {4187777},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2020-5-0875/}
}
TY - JOUR AU - Rauh, Johannes AU - Matúš, František TI - Maximizing the Bregman divergence from a Bregman family JO - Kybernetika PY - 2020 SP - 875 EP - 885 VL - 56 IS - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2020-5-0875/ DO - 10.14736/kyb-2020-5-0875 LA - en ID - 10_14736_kyb_2020_5_0875 ER -
Rauh, Johannes; Matúš, František. Maximizing the Bregman divergence from a Bregman family. Kybernetika, Tome 56 (2020) no. 5, pp. 875-885. doi: 10.14736/kyb-2020-5-0875
Cité par Sources :