Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
May 16, 2024Open Access

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit

View Full Paper
Ask AI
Bookmark
Share

Authors

JLJoongkyu LeeSeoul National UniversityMOMin-hwan OhSeoul National University

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Lee et al. (2024) studied this question.

synapsesocial.com/papers/68e69d5db6db643587622b50https://doi.org/10.48550/arxiv.2405.09831
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Mixed-Effects Contextual Bandits2024 · 1 citations
  2. 2Contextual Multinomial Logit Bandits with General Value Functions2024
  3. 3Contextual Bandits for Unbounded Context Distributions2024
  4. 4Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits2025
  5. 5On the Optimal Regret of Locally Private Linear Contextual Bandit2024