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. 2011.14033
  4. Cited By
A Tractable Online Learning Algorithm for the Multinomial Logit
  Contextual Bandit

A Tractable Online Learning Algorithm for the Multinomial Logit Contextual Bandit

28 November 2020
Priyank Agrawal
Theja Tulabandhula
Vashist Avadhanula
ArXivPDFHTML

Papers citing "A Tractable Online Learning Algorithm for the Multinomial Logit Contextual Bandit"

5 / 5 papers shown
Title
A Unified Regularization Approach to High-Dimensional Generalized Tensor Bandits
A Unified Regularization Approach to High-Dimensional Generalized Tensor Bandits
Jiannan Li
Yiyang Yang
Shaojie Tang
Yao Wang
38
0
0
18 Jan 2025
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
Long-Fei Li
Yu-Jie Zhang
Peng Zhao
Zhi-Hua Zhou
101
4
0
17 Jan 2025
Towards Scalable and Robust Structured Bandits: A Meta-Learning
  Framework
Towards Scalable and Robust Structured Bandits: A Meta-Learning Framework
Runzhe Wan
Linjuan Ge
Rui Song
18
13
0
26 Feb 2022
UCB-based Algorithms for Multinomial Logistic Regression Bandits
UCB-based Algorithms for Multinomial Logistic Regression Bandits
Sanae Amani
Christos Thrampoulidis
31
10
0
21 Mar 2021
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
Marc Abeille
Louis Faury
Clément Calauzènes
96
37
0
23 Oct 2020
1