• DocumentCode
    778441
  • Title

    On minimizing distortion and relative entropy

  • Author

    Friedlander, Michael P. ; Gupta, Maya R.

  • Author_Institution
    Dept. of Comput. Sci., Univ. of British Columbia, Vancouver, BC, Canada
  • Volume
    52
  • Issue
    1
  • fYear
    2006
  • Firstpage
    238
  • Lastpage
    245
  • Abstract
    A common approach for estimating a probability mass function w when given a prior q and moment constraints given by Aw≤b is to minimize the relative entropy between w and q subject to the set of linear constraints. In such cases, the solution w is known to have exponential form. We consider the case in which the linear constraints are noisy, uncertain, infeasible, or otherwise "soft." A solution can then be obtained by minimizing both the relative entropy and violation of the constraints Aw≤b. A penalty parameter σ weights the relative importance of these two objectives. We show that this penalty formulation also yields a solution w with exponential form. If the distortion is based on an ℓp norm, then the exponential form of w is shown to have exponential decay parameters that are bounded as a function of σ. We also state conditions under which the solution w to the penalty formulation will result in zero distortion, so that the moment constraints hold exactly. These properties are useful in choosing penalty parameters, evaluating the impact of chosen penalty parameters, and proving properties about methods that use such penalty formulations.
  • Keywords
    convex programming; distortion; inverse problems; maximum entropy methods; minimum entropy methods; probability; Kullback-Leibler distance; convex optimization; distortion minimization; exponential decay parameter; inverse problem; linear constraint; moment constraint; penalty formulation; probability mass function estimation; relative entropy; Computer science; Constraint optimization; Councils; Entropy; Equations; Inverse problems; Nonlinear distortion; Power engineering and energy; Random variables; Scientific computing; Convex optimization; Kullback–Leibler distance; cross-entropy; exact penalty; function; inverse problem; maximum entropy; moment constraint; relative entropy;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2005.860448
  • Filename
    1564439