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"

15 / 15 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
105
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 Zhang
Peng Zhao
Zhi Zhou
142
5
0
17 Jan 2025
Multinomial Logit Contextual Bandits: Provable Optimality and
  Practicality
Multinomial Logit Contextual Bandits: Provable Optimality and Practicality
Min Hwan Oh
G. Iyengar
19
22
0
25 Mar 2021
UCB-based Algorithms for Multinomial Logistic Regression Bandits
UCB-based Algorithms for Multinomial Logistic Regression Bandits
Sanae Amani
Christos Thrampoulidis
46
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
103
37
0
23 Oct 2020
Filtered Poisson Process Bandit on a Continuum
Filtered Poisson Process Bandit on a Continuum
James A. Grant
R. Szechtman
17
7
0
20 Jul 2020
Improved Optimistic Algorithms for Logistic Bandits
Improved Optimistic Algorithms for Logistic Bandits
Louis Faury
Marc Abeille
Clément Calauzènes
Olivier Fercoq
50
92
0
18 Feb 2020
Dynamic Assortment Optimization with Changing Contextual Information
Dynamic Assortment Optimization with Changing Contextual Information
Xi Chen
Yining Wang
Yuanshuo Zhou
23
50
0
31 Oct 2018
Multinomial Logit Bandit with Linear Utility Functions
Multinomial Logit Bandit with Linear Utility Functions
Mingdong Ou
Nan Li
Shenghuo Zhu
Rong Jin
11
17
0
08 May 2018
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
Shipra Agrawal
Vashist Avadhanula
Vineet Goyal
A. Zeevi
85
155
0
13 Jun 2017
Thompson Sampling for the MNL-Bandit
Thompson Sampling for the MNL-Bandit
Shipra Agrawal
Vashist Avadhanula
Vineet Goyal
A. Zeevi
114
97
0
03 Jun 2017
On the Properties of the Softmax Function with Application in Game
  Theory and Reinforcement Learning
On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learning
Bolin Gao
Lacra Pavel
FAtt
31
304
0
03 Apr 2017
Provably Optimal Algorithms for Generalized Linear Contextual Bandits
Provably Optimal Algorithms for Generalized Linear Contextual Bandits
Lihong Li
Yu Lu
Dengyong Zhou
66
94
0
28 Feb 2017
Self-concordant analysis for logistic regression
Self-concordant analysis for logistic regression
Francis R. Bach
139
208
0
24 Oct 2009
Linearly Parameterized Bandits
Linearly Parameterized Bandits
Paat Rusmevichientong
J. Tsitsiklis
169
558
0
18 Dec 2008
1