method · first seen 5 Oct 2026
linear bandit
A sequential decision problem where expected rewards are linear in action features, solved with confidence-based exploration.
Mentions per week
PapersCodeDiscussion
Earliest sources
- Bellman-Centric Learning: Near-Optimal Regret for Linear Bandits with MemoryPapers · 5 Oct 2026 · Jingyuan Liu, Huiwen Jia
- Linear Bandits under Exact Sliding-Window ConstraintsPapers · 6 Oct 2026 · Seyed Mohammad Hadi Hosseini, Yasin Abbasi-Yadkori, Sattar Vakili
- Gaussian-Width Bounds for Offline-to-Online Linear BanditsPapers · 9 Oct 2026 · Kushagra Chandak, Volodymyr Tkachuk, Xiaoqi Tan, Csaba Szepesvári
- Accelerating Linear Bandits with Persistent Candidate SetsPapers · 9 Oct 2026 · Bingkui Tong, Daria Korovaitceva, Marina Sheshukova, Sergey Samsonov, Junpei Kom…
- A Computationally Efficient and Rate-Optimal Algorithm for Adversarial Linear MDPs with (Aggregate) Bandit FeedbackPapers · 22 Oct 2026 · Haolin Liu, Chen-Yu Wei, Hanbin Zhou
Latest sources
- A Computationally Efficient and Rate-Optimal Algorithm for Adversarial Linear MDPs with (Aggregate) Bandit FeedbackPapers · 22 Oct 2026 · Haolin Liu, Chen-Yu Wei, Hanbin Zhou
- Accelerating Linear Bandits with Persistent Candidate SetsPapers · 9 Oct 2026 · Bingkui Tong, Daria Korovaitceva, Marina Sheshukova, Sergey Samsonov, Junpei Kom…
- Gaussian-Width Bounds for Offline-to-Online Linear BanditsPapers · 9 Oct 2026 · Kushagra Chandak, Volodymyr Tkachuk, Xiaoqi Tan, Csaba Szepesvári
- Linear Bandits under Exact Sliding-Window ConstraintsPapers · 6 Oct 2026 · Seyed Mohammad Hadi Hosseini, Yasin Abbasi-Yadkori, Sattar Vakili
- Bellman-Centric Learning: Near-Optimal Regret for Linear Bandits with MemoryPapers · 5 Oct 2026 · Jingyuan Liu, Huiwen Jia