Maximization of the information divergence from an exponential family and criticality
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F11%3A00363274" target="_blank" >RIV/67985556:_____/11:00363274 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Maximization of the information divergence from an exponential family and criticality
Original language description
The problem to maximize the information divergence from an exponential family is compared to the maximization of an entropy-like quantity over the boundary of a polytope. First-order conditions on directional derivatives define critical sets for the twoproblems. The bijection between the sets of global maximizers in the two problems found earlier is extended here to bijections between the sets of local maximizers and the critical sets. This is based on new inequalities relating the maximized quantitiesand a reformulation of the first order criticality conditions for the second problem.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP202%2F10%2F0618" target="_blank" >GAP202/10/0618: Bregman distances, divergences, and optimal algorithms for information retrieval, decisions and learning</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings ISIT 2011
ISBN
978-1-4577-0595-3
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
903-907
Publisher name
IEEE
Place of publication
Piscataway
Event location
St. Petersburg
Event date
Jul 31, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000297465101017