ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2311.05975
  4. Cited By
Sum-max Submodular Bandits

Sum-max Submodular Bandits

10 November 2023
Stephen Pasteris
Alberto Rumi
Fabio Vitale
Nicolò Cesa-Bianchi
ArXivPDFHTML

Papers citing "Sum-max Submodular Bandits"

1 / 1 papers shown
Title
No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic
  Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting
No-Regret M♮{}^{\natural}♮-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting
Taihei Oki
Shinsaku Sakaue
33
0
0
21 May 2024
1