Dissertation · 2025 · Open access

Thompson Sampling for Bandit Convex Optimization

Bakhtiari, SeyedAlireza

ERA: Education and Research Archive (University of Alberta) · Published 1 January 2025 · DOI 10.7939/83050

Open full textCite this paper

In brief

“Thompson Sampling for Bandit Convex Optimization” is a 2025 dissertation by Bakhtiari, SeyedAlireza, published in ERA: Education and Research Archive (University of Alberta). OpenAlex counts 1 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at ERA: Education and Research Archive (University of Alberta).

Citations
1
Most cited in
2026 (1)
Authors
1

Abstract

Thompson sampling (TS) is a popular and empirically successful algorithm for online decision-making problems. This thesis advances our understanding of TS when applied to bandit convex optimization (BCO) problems, by providing new theoretical guarantees and characterizing its limitations. First, we analyze $1$-dimensional BCO and show that TS achieves a near-optimal Bayesian regret of at most $\tilde O(\sqrt{n})$, where $n$ is the time horizon. This result holds without strong assumptions on the loss functions, requiring only convexity, boundedness, and a mild Lipschitz condition. In sharp contrast, we demonstrate that for general high-dimensional problems, TS can fail catastrophically. More positively, we establish a Bayesian regret bound of $\tilde O(d^{2.5} \sqrt{n})$ for TS in generalized linear bandits, even when the convex monotone link function is unknown. Finally, we prove a fundamental limitation of current analysis techniques: we show that the standard information-theoretic machinery can never yield a regret bound better than the existing $\tilde O(d^{1.5} \sqrt{n})$ in the general case.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

SeyedAlireza, B. (2025). Thompson Sampling for Bandit Convex Optimization. ERA: Education and Research Archive (University of Alberta). https://doi.org/10.7939/83050

MLA 9

SeyedAlireza, Bakhtiari,. “Thompson Sampling for Bandit Convex Optimization.” ERA: Education and Research Archive (University of Alberta), 2025. https://doi.org/10.7939/83050.

Chicago

SeyedAlireza, Bakhtiari,. 2025. “Thompson Sampling for Bandit Convex Optimization.” ERA: Education and Research Archive (University of Alberta). https://doi.org/10.7939/83050.

Harvard

SeyedAlireza, B. (2025) ‘Thompson Sampling for Bandit Convex Optimization’, ERA: Education and Research Archive (University of Alberta). doi:10.7939/83050.

IEEE

B. SeyedAlireza, “Thompson Sampling for Bandit Convex Optimization,” ERA: Education and Research Archive (University of Alberta), 2025, doi: 10.7939/83050.

BibTeX

@phdthesis{seyedalireza2025thompson,
  title     = {{Thompson Sampling for Bandit Convex Optimization}},
  author    = {SeyedAlireza, Bakhtiari,},
  year      = {2025},
  doi       = {10.7939/83050},
  url       = {https://doi.org/10.7939/83050}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research

  • Thompson sampling
  • Bayesian regret
  • regret bounds
  • information-theoretic limits
  • online decision making
  • regret minimization

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

SeyedAlireza, B. (2025). Thompson Sampling for Bandit Convex Optimization. ERA: Education and Research Archive (University of Alberta). https://doi.org/10.7939/83050

How many times has this paper been cited?

1 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at ERA: Education and Research Archive (University of Alberta): sign in and open the full text from this page.

Who wrote this paper?

Bakhtiari, SeyedAlireza.

What is the DOI of this paper?

10.7939/83050, permanently at https://doi.org/10.7939/83050. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.