conftrace_

multinomial logit

20 papers

Explore in graph

Co-occurring keywords

regret bound (1926) contextual bandit (381) assortment optimization (12) online learning (1777) multi-armed bandit (1098) mixture model (262) choice model (14) upper confidence bound (197) pairwise comparison (187) dynamic pricing (40)

Papers

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit NIPS 2024
Online Learning of Delayed Choices NIPS 2024
Contextual Multinomial Logit Bandits with General Value Functions NIPS 2024
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation NIPS 2024
Learning to Rank under Multinomial Logit Choice JMLR 2023
Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit AAAI 2022
Learning Mixed Multinomial Logits with Provable Guarantees NIPS 2022
Dynamic pricing and assortment under a contextual MNL demand NIPS 2022
Multinomial Logit Contextual Bandits: Provable Optimality and Practicality AAAI 2021
Light RUMs ICML 2021
Combinatorial Bandits with Relative Feedback NIPS 2019
Discovering Context Effects from Raw Choice Data ICML 2019
Thompson Sampling for Multinomial Logit Contextual Bandits NIPS 2019
Accelerated Spectral Ranking ICML 2018
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models NIPS 2018
Learning a Mixture of Two Multinomial Logits ICML 2018
Thompson Sampling for the MNL-Bandit COLT 2017
Collaboratively Learning Preferences from Ordinal Data NIPS 2015
Learning Mixed Multinomial Logit Model from Ordinal Data NIPS 2014
Bayesian Nonparametric Modeling of Suicide Attempts NIPS 2012