IDEAS home Printed from https://ideas.repec.org/p/osf/osfxxx/wr2s6.html
   My bibliography  Save this paper

Monotonically Decreasing Sequence of Divergences

Author

Listed:
  • Nishiyama, Tomohiro

Abstract

Divergences are quantities that measure discrepancy between two probability distributions and play an important role in various fields such as statistics and machine learning. Divergences are non-negative and are equal to zero if and only if two distributions are the same. In addition, some important divergences such as the f-divergence have convexity, which we call ``convex divergence''. In this paper, we show new properties of the convex divergences by using integral and differential operators that we introduce. For the convex divergence, the result applied the integral or differential operator is also a divergence. In particular, the integral operator preserves convexity. Furthermore, the results applied the integral operator multiple times constitute a monotonically decreasing sequence of the convex divergences. We derive new sequences of the convex divergences that include the Kullback-Leibler divergence or the reverse Kullback-Leibler divergence from these properties.

Suggested Citation

  • Nishiyama, Tomohiro, 2019. "Monotonically Decreasing Sequence of Divergences," OSF Preprints wr2s6, Center for Open Science.
  • Handle: RePEc:osf:osfxxx:wr2s6
    DOI: 10.31219/osf.io/wr2s6
    as

    Download full text from publisher

    File URL: https://osf.io/download/5dab0ef7f1b0a9000c6472c0/
    Download Restriction: no

    File URL: https://libkey.io/10.31219/osf.io/wr2s6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Nishiyama, Tomohiro, 2018. "Divergence Network: Graphical calculation method of divergence functions," OSF Preprints am4pr, Center for Open Science.
    2. Nishiyama, Tomohiro, 2019. "A New Lower Bound for Kullback-Leibler Divergence Based on Hammersley-Chapman-Robbins Bound," OSF Preprints wa98j, Center for Open Science.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nishiyama, Tomohiro, 2020. "Minimization Problems on Strictly Convex Divergences," OSF Preprints wzayx, Center for Open Science.
    2. Nishiyama, Tomohiro, 2020. "Convex Optimization on Functionals of Probability Densities," OSF Preprints 8nzum, Center for Open Science.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      Statistics

      Access and download statistics

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:osf:osfxxx:wr2s6. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: OSF (email available below). General contact details of provider: https://osf.io/preprints/ .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.