most citedSatisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing stat.MLShow all

2 papers · 1 filter

stat.ML2026

Satisficing Regret Minimization in Bandits with Knapsacks

Qing Feng, Tianyi Ma, Ruihao Zhu

We study satisficing regret minimization in bandits with knapsacks (BwK), where a learner sequentially selects randomized policies, i.e., distributions over arms, to obtain mean re…

stat.ML2024★ 1 cited

Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution

Qing Feng, Tianyi Ma, Ruihao Zhu

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…