Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1509.07728
Cited By
Online Stochastic Linear Optimization under One-bit Feedback
25 September 2015
Lijun Zhang
Tianbao Yang
Rong Jin
Zhi Zhou
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Online Stochastic Linear Optimization under One-bit Feedback"
12 / 12 papers shown
Title
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
Long-Fei Li
Yu Zhang
Peng Zhao
Zhi Zhou
108
4
0
17 Jan 2025
Revisiting Weighted Strategy for Non-stationary Parametric Bandits
Jing Wang
Peng Zhao
Zhihong Zhou
40
5
0
05 Mar 2023
Communication Efficient Federated Learning for Generalized Linear Bandits
Chuanhao Li
Hongning Wang
FedML
45
13
0
02 Feb 2022
Jointly Efficient and Optimal Algorithms for Logistic Bandits
Louis Faury
Marc Abeille
Kwang-Sung Jun
Clément Calauzènes
35
19
0
06 Jan 2022
Maillard Sampling: Boltzmann Exploration Done Optimally
Jieming Bian
Kwang-Sung Jun
32
12
0
05 Nov 2021
A Simple Approach for Non-stationary Linear Bandits
Peng Zhao
Lijun Zhang
Yuan Jiang
Zhi Zhou
41
81
0
09 Mar 2021
A One-bit, Comparison-Based Gradient Estimator
HanQin Cai
Daniel McKenzie
W. Yin
Zhenliang Zhang
45
17
0
06 Oct 2020
Learning Adaptive Embedding Considering Incremental Class
Yang Yang
Zhensheng Sun
HengShu Zhu
Yanjie Fu
Hui Xiong
Jian Yang
CLL
29
40
0
31 Aug 2020
Bilinear Bandits with Low-rank Structure
Kwang-Sung Jun
Rebecca Willett
S. Wright
Robert D. Nowak
27
60
0
08 Jan 2019
Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits
Branislav Kveton
Csaba Szepesvári
Sharan Vaswani
Zheng Wen
Mohammad Ghavamzadeh
Tor Lattimore
15
70
0
13 Nov 2018
Online Learning: A Comprehensive Survey
Guosheng Lin
Doyen Sahoo
Jing Lu
P. Zhao
OffRL
36
636
0
08 Feb 2018
Regret Analysis for Continuous Dueling Bandit
Wataru Kumagai
39
27
0
21 Nov 2017
1