Computer Science > Information Theory
[Submitted on 21 Oct 2014 (v1), last revised 10 Jun 2015 (this version, v2)]
Title:Minimization Problems Based on Relative $α$-Entropy II: Reverse Projection
View PDFAbstract:In part I of this two-part work, certain minimization problems based on a parametric family of relative entropies (denoted $\mathscr{I}_{\alpha}$) were studied. Such minimizers were called forward $\mathscr{I}_{\alpha}$-projections. Here, a complementary class of minimization problems leading to the so-called reverse $\mathscr{I}_{\alpha}$-projections are studied. Reverse $\mathscr{I}_{\alpha}$-projections, particularly on log-convex or power-law families, are of interest in robust estimation problems ($\alpha >1$) and in constrained compression settings ($\alpha <1$). Orthogonality of the power-law family with an associated linear family is first established and is then exploited to turn a reverse $\mathscr{I}_{\alpha}$-projection into a forward $\mathscr{I}_{\alpha}$-projection. The transformed problem is a simpler quasiconvex minimization subject to linear constraints.
Submission history
From: M. Ashok Kumar [view email][v1] Tue, 21 Oct 2014 06:40:28 UTC (109 KB)
[v2] Wed, 10 Jun 2015 10:25:54 UTC (84 KB)
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.