arXiv (All)
open access
Softmax gradient policy for variance minimization and risk-averse multi armed bandits
Algorithms for the Multi-Armed Bandit (MAB) problem play a central role in sequential decision-making and have been extensively explored both theoretically and numerically. While most classical approaches aim to identify the arm with the highest expected reward, we focus on a risk-aware setting wher
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sharp Characterization of Bias in Post-Bandit Inference#1052257
- A Unified Optimism-Agnostic Framework for Linear Bandits over Spherical Action Sets#1116480
- Learning Chance-Constrained MDPs with Bellman Distributional Certificates#1105415
- Towards More Efficient, Robust, Instance-adaptive, and Generalizable Sequential Decision making#1143593
- Budget-Constrained Causal Bandits: Bridging Uplift Modeling and Sequential Decision-Making#684438
Record · ID 1063878
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive