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. 2002.07530
  4. Cited By
Improved Optimistic Algorithms for Logistic Bandits
v1v2 (latest)

Improved Optimistic Algorithms for Logistic Bandits

18 February 2020
Louis Faury
Marc Abeille
Clément Calauzènes
Olivier Fercoq
ArXiv (abs)PDFHTML

Papers citing "Improved Optimistic Algorithms for Logistic Bandits"

19 / 69 papers shown
Title
An Experimental Design Approach for Regret Minimization in Logistic
  Bandits
An Experimental Design Approach for Regret Minimization in Logistic Bandits
Blake Mason
Kwang-Sung Jun
Lalit P. Jain
69
10
0
04 Feb 2022
Learning Neural Contextual Bandits Through Perturbed Rewards
Learning Neural Contextual Bandits Through Perturbed Rewards
Yiling Jia
Weitong Zhang
Dongruo Zhou
Quanquan Gu
Hongning Wang
137
14
0
24 Jan 2022
Bregman Deviations of Generic Exponential Families
Bregman Deviations of Generic Exponential Families
Sayak Ray Chowdhury
Patrick Saux
Odalric-Ambrym Maillard
Aditya Gopalan
67
12
0
18 Jan 2022
Jointly Efficient and Optimal Algorithms for Logistic Bandits
Jointly Efficient and Optimal Algorithms for Logistic Bandits
Louis Faury
Marc Abeille
Kwang-Sung Jun
Clément Calauzènes
87
21
0
06 Jan 2022
Dueling RL: Reinforcement Learning with Trajectory Preferences
Dueling RL: Reinforcement Learning with Trajectory Preferences
Aldo Pacchiano
Aadirupa Saha
Jonathan Lee
104
90
0
08 Nov 2021
Dynamic pricing and assortment under a contextual MNL demand
Dynamic pricing and assortment under a contextual MNL demand
Vineet Goyal
Noémie Périvier
61
19
0
19 Oct 2021
Apple Tasting Revisited: Bayesian Approaches to Partially Monitored
  Online Binary Classification
Apple Tasting Revisited: Bayesian Approaches to Partially Monitored Online Binary Classification
James A. Grant
David S. Leslie
84
3
0
29 Sep 2021
On Learning to Rank Long Sequences with Contextual Bandits
On Learning to Rank Long Sequences with Contextual Bandits
Anirban Santara
Claudio Gentile
Gaurav Aggarwal
Shuai Li
35
0
0
07 Jun 2021
On the Theory of Reinforcement Learning with Once-per-Episode Feedback
On the Theory of Reinforcement Learning with Once-per-Episode Feedback
Niladri S. Chatterji
Aldo Pacchiano
Peter L. Bartlett
Michael I. Jordan
OffRL
83
26
0
29 May 2021
UCB-based Algorithms for Multinomial Logistic Regression Bandits
UCB-based Algorithms for Multinomial Logistic Regression Bandits
Sanae Amani
Christos Thrampoulidis
82
10
0
21 Mar 2021
Regret Bounds for Generalized Linear Bandits under Parameter Drift
Regret Bounds for Generalized Linear Bandits under Parameter Drift
Louis Faury
Yoan Russac
Marc Abeille
Clément Calauzènes
51
12
0
09 Mar 2021
Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve
  Optimism, Embrace Virtual Curvature
Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature
Kefan Dong
Jiaqi Yang
Tengyu Ma
97
33
0
08 Feb 2021
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear
  Mixture MDP
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP
Zihan Zhang
Jiaqi Yang
Xiangyang Ji
S. Du
108
41
0
29 Jan 2021
Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov
  Decision Processes
Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processes
Dongruo Zhou
Quanquan Gu
Csaba Szepesvári
108
209
0
15 Dec 2020
A Tractable Online Learning Algorithm for the Multinomial Logit
  Contextual Bandit
A Tractable Online Learning Algorithm for the Multinomial Logit Contextual Bandit
Priyank Agrawal
Theja Tulabandhula
Vashist Avadhanula
102
12
0
28 Nov 2020
Improved Confidence Bounds for the Linear Logistic Model and
  Applications to Linear Bandits
Improved Confidence Bounds for the Linear Logistic Model and Applications to Linear Bandits
Kwang-Sung Jun
Lalit P. Jain
Blake Mason
Houssam Nassif
87
20
0
23 Nov 2020
Self-Concordant Analysis of Generalized Linear Bandits with Forgetting
Self-Concordant Analysis of Generalized Linear Bandits with Forgetting
Yoan Russac
Louis Faury
Olivier Cappé
Aurélien Garivier
72
16
0
02 Nov 2020
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
Marc Abeille
Louis Faury
Clément Calauzènes
146
38
0
23 Oct 2020
Reward-Biased Maximum Likelihood Estimation for Linear Stochastic
  Bandits
Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits
Yu-Heng Hung
Ping-Chun Hsieh
Xi Liu
P. R. Kumar
80
15
0
08 Oct 2020
Previous
12