Papers › Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set...

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion

28 Oct 2023arXiv:2310.18554archive 2025-07-28

Junghyun Lee, Se-Young Yun, Kwang-Sung Jun

Logistic bandit is a ubiquitous framework of modeling users' choices, e.g., click vs. no click for advertisement recommender system. We observe that the prior works overlook or neglect dependencies in S ≥‖θ_⋆ ‖₂, where θ_⋆ ∈ℝᵈ is the unknown parameter vector, which is particularly problematic when S is large, e.g., S ≥d. In this work, we improve the dependency on S via a novel approach called regret-to-confidence set conversion (R2CS), which allows us to construct a convex confidence set based on only the existence of an online learning algorithm with a regret guarantee. Using R2CS, we obtain a strict improvement in the regret bound w.r.t. S in logistic bandits while retaining computational feasibility and the dependence on other factors such as d and T. We apply our new confidence set to the regret analyses of logistic bandits with a new martingale concentration step that circumvents an additional factor of S. We then extend this analysis to multinomial logistic bandits and obtain similar improvements in the regret, showing the efficacy of R2CS. While we applied R2CS to the (multinomial) logistic model, R2CS is a generic approach for developing confidence sets that can be used for various models, which can be of independent interest.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

nick-jhlee/logistic_bandit officialmentioned in papermentioned on GitHubSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Generalized Linear Bandits with Limited Adaptivity (arXiv:2404.06831; that paper's own run record: 10 ran (of which 2 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 6 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified) and A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits (arXiv:2407.13977; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
nirjhar-das/glbandit_limited_adaptivity mentioned on GitHubSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Generalized Linear Bandits with Limited Adaptivity (arXiv:2404.06831; that paper's own run record: 10 ran (of which 2 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 6 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Recommendation Systems

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SET

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections