{
  "annotation_id": "ed38bc3f-1f96-4474-b0b0-6e41047ff06b",
  "date_created": "2026-02-17T05:53:16.247000Z",
  "date_modified": "2026-02-17T05:53:16.247000Z",
  "file_hash": "c8d7bff6b25f9ad4f6bfb2f1672e0a11264eb3e167a271b9cae16f1f7271969e",
  "private": false,
  "record": {
    "abstract": "We consider the problem of learning the optimal policy for Markov decision processes with safety constraints. We formulate the problem in a reach-avoid setup. Our goal is to design online reinforcement learning algorithms that ensure safety constraints with arbitrarily high probability during the learning phase. To this end, we first propose an algorithm based on the optimism in the face of uncertainty (OFU) principle. Based on the first algorithm, we propose our main algorithm, which utilizes entropy regularization. We investigate the finite-sample analysis of both algorithms and derive their regret bounds. We demonstrate that the inclusion of entropy regularization improves the regret and drastically controls the episode-to-episode variability that is inherent in OFU-based safe RL algorithms.",
    "arxiv_id": "2601.08646",
    "authors": [
      "Abhijit Mazumdar",
      "Rafal Wisniewski",
      "Manuela L. Bujorianu"
    ],
    "categories": [
      "cs.LG"
    ],
    "license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
    "title": "Provably Safe Reinforcement Learning for Stochastic Reach-Avoid Problems with Entropy Regularization",
    "url": "https://arxiv.org/abs/2601.08646",
    "version": "v2"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2b61c23e-af68-43bb-b84b-d8c57b5b2ec3",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}