ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 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
v1v2v3v4v5v6v7 (latest)

A Tractable Online Learning Algorithm for the Multinomial Logit Contextual Bandit

European Journal of Operational Research (EJOR), 2020
28 November 2020
Priyank Agrawal
Theja Tulabandhula
Vashist Avadhanula
ArXiv (abs)PDFHTML

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

11 / 11 papers shown
Preference-based Reinforcement Learning beyond Pairwise Comparisons: Benefits of Multiple Options
Preference-based Reinforcement Learning beyond Pairwise Comparisons: Benefits of Multiple Options
Joongkyu Lee
Seouh-won Yi
Min-hwan Oh
OffRL
228
0
0
21 Oct 2025
Generalized Low-Rank Matrix Contextual Bandits with Graph Information
Generalized Low-Rank Matrix Contextual Bandits with Graph Information
Yao Wang
Jiannan Li
Yue Kang
Shanxing Gao
Zhenxin Xiao
245
3
0
23 Jul 2025
Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm
Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm
Pierre Boudart
Pierre Gaillard
Alessandro Rudi
209
0
0
07 Jul 2025
A Unified Regularization Approach to High-Dimensional Generalized Tensor Bandits
A Unified Regularization Approach to High-Dimensional Generalized Tensor BanditsInternational Symposium on Information Theory (ISIT), 2025
Jiannan Li
Yiyang Yang
Shaojie Tang
Yao Wang
633
0
0
18 Jan 2025
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
Provably Efficient Reinforcement Learning with Multinomial Logit Function ApproximationNeural Information Processing Systems (NeurIPS), 2024
Long-Fei Li
Yu Zhang
Peng Zhao
Zhi Zhou
654
10
0
17 Jan 2025
Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
Nearly Minimax Optimal Regret for Multinomial Logistic BanditNeural Information Processing Systems (NeurIPS), 2024
Joongkyu Lee
Min-hwan Oh
435
13
0
16 May 2024
Contextual Multinomial Logit Bandits with General Value Functions
Contextual Multinomial Logit Bandits with General Value Functions
Mengxiao Zhang
Haipeng Luo
295
3
0
12 Feb 2024
Efficient Generalized Low-Rank Tensor Contextual Bandits
Efficient Generalized Low-Rank Tensor Contextual Bandits
Qianxin Yi
Yiyang Yang
Shaojie Tang
Jiapeng Liu
Yao Wang
320
0
0
03 Nov 2023
Improved Regret Bounds of (Multinomial) Logistic Bandits via
  Regret-to-Confidence-Set Conversion
Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set ConversionInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2023
Junghyun Lee
Se-Young Yun
Kwang-Sung Jun
465
22
0
28 Oct 2023
Towards Scalable and Robust Structured Bandits: A Meta-Learning
  Framework
Towards Scalable and Robust Structured Bandits: A Meta-Learning FrameworkInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2022
Runzhe Wan
Linjuan Ge
Rui Song
263
13
0
26 Feb 2022
UCB-based Algorithms for Multinomial Logistic Regression Bandits
UCB-based Algorithms for Multinomial Logistic Regression BanditsNeural Information Processing Systems (NeurIPS), 2021
Sanae Amani
Christos Thrampoulidis
242
12
0
21 Mar 2021
1
Page 1 of 1