• DocumentCode
    111800
  • Title

    Minimization Problems Based on Relative \\alpha -Entropy II: Reverse Projection

  • Author

    Ashok Kumar, M. ; Sundaresan, Rajesh

  • Author_Institution
    Dept. of Electr. Eng., Technion - Israel Inst. of Technol., Haifa, Israel
  • Volume
    61
  • Issue
    9
  • fYear
    2015
  • fDate
    Sept. 2015
  • Firstpage
    5081
  • Lastpage
    5095
  • Abstract
    In part I of this two-part work, certain minimization problems based on a parametric family of relative entropies (denoted ℐα) were studied. Such minimizers were called forward ℐα-projections. Here, a complementary class of minimization problems leading to the so-called reverse ℐα-projections are studied. Reverse ℐα-projections, particularly on log-convex or power-law families, are of interest in robust estimation problems (α > 1) and in constrained compression settings (α <; 1). Orthogonality of the power-law family with an associated linear family is first established and is then exploited to turn a reverse ℐα-projection into a forward ℐα-projection. The transformed problem is a simpler quasi-convex minimization subject to linear constraints.
  • Keywords
    entropy; minimisation; associated linear family; best approximant; linear constraints; minimization problem; quasi-convex minimization; relative α-entropy; reverse projection; robust estimation problem; Entropy; Mathematical model; Maximum likelihood estimation; Minimization; Pollution measurement; Q measurement; Robustness; Best approximant; Kullback-Leibler divergence; Pythagorean property; R??nyi entropy; Renyi entropy; Tsallis entropy; exponential family; information geometry; linear family; power-law family; projection; relative entropy; robust estimation;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2015.2449312
  • Filename
    7132749