Sliding-Window Thompson Sampling for Non-Stationary Settings

DOI10.1613/JAIR.1.11407zbMATH Open1452.62171OpenAlexW3030314836MaRDI QIDQ5114784FDOQ5114784

Nicola Gatti, Francesco Trovò, Marcello Restelli

Publication date: 26 June 2020

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11407

zbMATH Keywords

sequential decision problemThompson sampling

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Sequential estimation (62L12)

Cited In (2)

• Thompson Sampling for Bayesian Bandits with Resets
• Multi-armed bandit problem with online clustering as side information

   Recommendations

• Title not available (Why is that?) 👍 👎
• Thompson Sampling for Bayesian Bandits with Resets 👍 👎
• Thompson Sampling for Stochastic Control: The Continuous Parameter Case 👍 👎
• Thompson Sampling for Stochastic Control: The Finite Parameter Case 👍 👎
• Linear Thompson sampling revisited 👍 👎
• Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis 👍 👎
• Near-Optimal Regret Bounds for Thompson Sampling 👍 👎
• A Tutorial on Thompson Sampling 👍 👎
• On the Prior Sensitivity of Thompson Sampling 👍 👎

This page was built for publication: Sliding-Window Thompson Sampling for Non-Stationary Settings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114784)