Newshot

Offline KL-Regularized Reinforcement Learning with Stochastic Transitions

Summary

arXiv:2611.17603v1 Announce Type: new Abstract: KL-regularized reinforcement learning is the objective behind RL fine-tuning of language models, and its data are often collected by the reference policy itself. However, beyond bandits and deterministic transitions, little is known about how much offline data it needs. In this work, we study finite discounted Markov decision processes with unknown stochastic transitions, $K$ state-action pairs and effective horizon $H$. For data that cover the regularized optimum with concentrability $C\geq 4$, every estimator needs $\Omega(KCH^3/(\epsilon\max\{\epsilon,\beta\}))$ samples on some instances when $\epsilon$ is small, where $\beta$ is the temperature. Under a fixed design, pessimistic soft value iteration with a variance-aware penalty attains this rate with high probability, up to logarithmic factors, when $\beta\geq 1.4H$. When the data come from the reference policy itself, we show that it covers the optimum up to a power law whose expone…

Original text(via arXiv cs.LG)

Computer Science > Machine Learning

Title:Offline KL-Regularized Reinforcement Learning with Stochastic Transitions

Abstract:KL-regularized reinforcement learning is the objective behind RL fine-tuning of language models, and its data are often collected by the reference policy itself. However, beyond bandits and deterministic transitions, little is known about how much offline data it needs. In this work, we study finite discounted Markov decision processes with unknown stochastic transitions, $K$ state-action pairs and effective horizon $H$. For data that cover the regularized optimum with concentrability $C\geq 4$, every estimator needs $\Omega(KCH^3/(\epsilon\max\{\epsilon,\beta\}))$ samples on some instances when $\epsilon$ is small, where $\beta$ is the temperature. Under a fixed design, pessimistic soft value iteration with a variance-aware penalty attains this rate with high probability, up to logarithmic factors, when $\beta\geq 1.4H$. When the data come from the reference policy itself, we show that it covers the optimum up to a power law whose exponent grows as $H/\beta$; in the same temperature range, this power law alone gives the estimator a sample complexity polynomial in $1/\epsilon$, with no coverage assumption. For $\beta\geq H$ the power can also increase the sample size needed by a factor polynomial in $1/\epsilon$. Finally, the plug-in estimator, which is minimax optimal with a generative model, can fail on reference data at small temperatures when many actions are rarely seen, while the pessimistic estimator does not.
Subjects:Machine Learning (cs.LG)
Cite as:arXiv:2611.17603 [cs.LG]
(or arXiv:2611.17603v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2611.17603 arXiv-issued DOI via DataCite (pending registration)

Submission history

Access Paper:

  • HTML (experimental)

Additional Features

  • Audio Summary

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv cs.LG
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗