Online (Multinomial) Logistic Bandit: Improved Regret and Constant Computation Cost

Yu-Jie Zhang, Masashi Sugiyama
2/12/2026

No confident code implementation found for this paper.

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{zhang2026online,
  title  = {Online (Multinomial) Logistic Bandit: Improved Regret and Constant Computation Cost},
  author = {Yu-Jie Zhang and Masashi Sugiyama},
  year   = {2026},
  doi    = {10.52202/075280-1295},
  url    = {https://doi.org/10.52202/075280-1295},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/27f9d59e4d6b003136bc44b7191fc213ed3d78b9.svg)](https://codeofpaper.com/paper/27f9d59e4d6b003136bc44b7191fc213ed3d78b9)

Discussion