arxiv
PublishedJuly 16, 2026 at 4:00 AM
—neutral
On the Sublinear Regret of Continuous K-Max Bandits
Publisher summary· verbatim
arXiv:2502.13467v2 Announce Type: replace Abstract: The $K$-Max combinatorial multi-armed bandit problem arises in applications such as recommendation and distributed decision making, where the reward is determined by the maximum outcome among $K$ selected arms. When outcomes are continuous and only
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivADS-C: Antidistillation Sampling for Classification19harxivBeyond a Joke: Multi-Angle Reasoning for Detecting and Explaining Harmful Humor in Memes19harxivFrom Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems19harxivA Formally Grounded ODRL Evaluator: Implementation and Comparison19hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗