Sign inGet started
Paper · arXiv

Statistical Convergence of Transformer Encoder-Accelerated Robust Reinforcement Learning

Obtaining the optimal action-value function in Markov decision processes is computationally intensive in large state--action spaces. In this study, we present statistically rigorous convergence results for a robust reinforcement learning algorithm warm-started by a transformer-based action-value function prediction, where natural language prompts encode task specifications. Our framework adopts the R-contamination model to characterize uncertainty in the state transition kernel, and employs conformal prediction to certify convergence via trajectory-level nonconformity scores constructed from the contracting Bellman residual. The resulting conformal quantile bounds the gap between the runn...

AuthorsSuman Banerjee, Hiroyasu Tsukamoto
Primary categorycs.LG
Published20 September 2026
Last updated at source20 September 2026
cs.LGeess.SY
Embed this entry
<iframe src="https://silytics.si/embed/item/8a1fb3b6-7152-47e1-bd9d-e4a1901943df" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.