IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v73y2025i4p2281-2295.html
   My bibliography  Save this article

Off-line Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity

Author

Listed:
  • Imon Banerjee

    (Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208)

  • Harsha Honnappa

    (Edwardson School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907)

  • Vinayak Rao

    (Department of Statistics, Purdue University, West Lafayette, Indiana 47907)

Abstract

In this work, we study a natural nonparametric estimator of the transition probability matrices of a finite controlled Markov chain. We consider an off-line setting with a fixed data set of size m , collected using a so-called logging policy. We develop sample complexity bounds for the estimator and establish conditions for minimaxity. Our statistical bounds depend on the logging policy through its mixing properties. We show that achieving a particular statistical risk bound involves a subtle and interesting trade-off between the strength of the mixing properties and the number of samples. We demonstrate the validity of our results under various examples, such as ergodic Markov chains; weakly ergodic inhomogeneous Markov chains; and controlled Markov chains with nonstationary Markov, episodic, and greedy controls. Lastly, we use these sample complexity bounds to establish concomitant ones for off-line evaluation of stationary Markov control policies.

Suggested Citation

  • Imon Banerjee & Harsha Honnappa & Vinayak Rao, 2025. "Off-line Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity," Operations Research, INFORMS, vol. 73(4), pages 2281-2295, July.
    • Handle: RePEc:inm:oropre:v:73:y:2025:i:4:p:2281-2295
    DOI: 10.1287/opre.2023.0046
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2023.0046
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2023.0046?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
    ---><---

    More about this item

    Keywords

    ;

    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:inm:oropre:v:73:y:2025:i:4:p:2281-2295. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.