arXiv (All)
open access
Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution
Motivated by the concept of satisficing in decision-making, we consider the problem of satisficing regret minimization in bandit optimization. In this setting, the learner aims at selecting satisficing arms (arms with mean reward exceeding a certain threshold value) as frequently as possible. The pe
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
- On the Generality of Preference for Contingent Reinforcement#448407
- Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation#370350
- Précis zu: Weakness of Will and Delay Discounting#108050
- Constant regret in general games via higher-order optimism#926951
- Assortment Optimization under Logit-Based Multi-Purchase Choice Models#1063875
Record · ID 1000459
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