IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-4-431-56922-0_8.html

Outcome Weighted Learning in Dynamic Treatment Regimes

In: Minimum Divergence Methods in Statistical Machine Learning

Author

Listed:
  • Shinto Eguchi

    (Institute of Statistical Mathematic)

  • Osamu Komori

    (Seikei University)

Abstract

This chapter discusses applications of information geometry in a paradigm of reinforcement learningReinforcement learning with emphasis on dynamic treatment regimesDynamic treatment regimes which have progressed recently in the learning algorithm with outcome weighed learning. The probabilistic framework for a triple expressing state, action, and reward is formulated in multiple stages, in which a decision functionDecision function defined by a state and action is estimated to make an optimal policy for a given dataset. Decision consistency for a decision functionDecision function is introduced by the state-value function in the space of all the decision functionsDecision function. We introduce the $$\varPsi $$ Ψ -divergence on the decision functionDecision function space with a generator function $$\varPsi $$ Ψ , and investigate statistical properties for the $$\varPsi $$ Ψ -loss function $$\varPsi $$ Ψ -loss function conducted by $$\varPsi $$ Ψ -divergence. An outcome-weighed learning algorithm for the decision functionDecision function is considered in a boosting approach in association with the prediction in supervised learning.

Suggested Citation

  • Shinto Eguchi & Osamu Komori, 2022. "Outcome Weighted Learning in Dynamic Treatment Regimes," Springer Books, in: Minimum Divergence Methods in Statistical Machine Learning, chapter 0, pages 197-216, Springer.
  • Handle: RePEc:spr:sprchp:978-4-431-56922-0_8
    DOI: 10.1007/978-4-431-56922-0_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    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:spr:sprchp:978-4-431-56922-0_8. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.