Variance-sensitive Thompson sampling for generalised linear bandits, revisited
Fuente:
arXiv
Saved in:
| Main Authors: | Perneczky, Tom, Abeille, Marc, Janz, David |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
When and why randomised exploration works (in linear bandits)
by: Abeille, Marc, et al.
Published: (2025)
by: Abeille, Marc, et al.
Published: (2025)
Ensemble sampling for linear bandits: small ensembles suffice
by: Janz, David, et al.
Published: (2023)
by: Janz, David, et al.
Published: (2023)
VITS : Variational Inference Thompson Sampling for contextual bandits
by: Clavier, Pierre, et al.
Published: (2023)
by: Clavier, Pierre, et al.
Published: (2023)
Sharp analysis of linear ensemble sampling
by: Akhavan, Arya, et al.
Published: (2026)
by: Akhavan, Arya, et al.
Published: (2026)
On the optimal regret of collaborative personalized linear bandits
by: Huang, Bruce, et al.
Published: (2025)
by: Huang, Bruce, et al.
Published: (2025)
Adversarial bandit optimization for approximately linear functions
by: Cheng, Zhuoyu, et al.
Published: (2025)
by: Cheng, Zhuoyu, et al.
Published: (2025)
On the Hardness of Reinforcement Learning with Transition Look-Ahead
by: Pla, Corentin, et al.
Published: (2025)
by: Pla, Corentin, et al.
Published: (2025)
Best-of-Both Worlds for linear contextual bandits with paid observations
by: Boyer, Nathan, et al.
Published: (2025)
by: Boyer, Nathan, et al.
Published: (2025)
Stable Thompson Sampling: Valid Inference via Variance Inflation
by: Halder, Budhaditya, et al.
Published: (2025)
by: Halder, Budhaditya, et al.
Published: (2025)
Exploration via linearly perturbed loss minimisation
by: Janz, David, et al.
Published: (2023)
by: Janz, David, et al.
Published: (2023)
Extreme bandits
by: Carpentier, Alexandra, et al.
Published: (2026)
by: Carpentier, Alexandra, et al.
Published: (2026)
Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
by: Yahmed, Ahmed Ben, et al.
Published: (2025)
by: Yahmed, Ahmed Ben, et al.
Published: (2025)
Truthful mechanisms for linear bandit games with private contexts
by: Hu, Yiting, et al.
Published: (2025)
by: Hu, Yiting, et al.
Published: (2025)
Precision autotuning for linear solvers via contextual bandit-based RL
by: Carson, Erin, et al.
Published: (2026)
by: Carson, Erin, et al.
Published: (2026)
Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits
by: Li, Xuheng, et al.
Published: (2025)
by: Li, Xuheng, et al.
Published: (2025)
Spectral bandits
by: Kocák, Tomáš, et al.
Published: (2026)
by: Kocák, Tomáš, et al.
Published: (2026)
Active clustering with bandit feedback
by: Thuot, Victor, et al.
Published: (2024)
by: Thuot, Victor, et al.
Published: (2024)
Information-directed sampling for bandits: a primer
by: Hirling, Annika, et al.
Published: (2025)
by: Hirling, Annika, et al.
Published: (2025)
Instance-dependent Stochastic Lipschitz bandit
by: Potfer, Marius, et al.
Published: (2026)
by: Potfer, Marius, et al.
Published: (2026)
Spectral bandits for smooth graph functions
by: Valko, Michal, et al.
Published: (2026)
by: Valko, Michal, et al.
Published: (2026)
Approximate information maximization for bandit games
by: Barbier-Chebbah, Alex, et al.
Published: (2023)
by: Barbier-Chebbah, Alex, et al.
Published: (2023)
Online learning in bandits with predicted context
by: Guo, Yongyi, et al.
Published: (2023)
by: Guo, Yongyi, et al.
Published: (2023)
Spectral Thompson sampling
by: Kocak, Tomas, et al.
Published: (2026)
by: Kocak, Tomas, et al.
Published: (2026)
Risk and optimal policies in bandit experiments
by: Adusumilli, Karun
Published: (2021)
by: Adusumilli, Karun
Published: (2021)
Revealing graph bandits for maximizing local influence
by: Carpentier, Alexandra, et al.
Published: (2026)
by: Carpentier, Alexandra, et al.
Published: (2026)
Offline-to-online hyperparameter transfer for stochastic bandits
by: Sharma, Dravyansh, et al.
Published: (2025)
by: Sharma, Dravyansh, et al.
Published: (2025)
Linear bandits with polylogarithmic minimax regret
by: Lumbreras, Josep, et al.
Published: (2024)
by: Lumbreras, Josep, et al.
Published: (2024)
Lookahead identification in adversarial bandits: accuracy and memory bounds
by: Brukhim, Nataly, et al.
Published: (2026)
by: Brukhim, Nataly, et al.
Published: (2026)
Trading off rewards and errors in multi-armed bandits
by: Erraqabi, Akram, et al.
Published: (2026)
by: Erraqabi, Akram, et al.
Published: (2026)
Efficient kernelized bandit algorithms via exploration distributions
by: Hu, Bingshan, et al.
Published: (2025)
by: Hu, Bingshan, et al.
Published: (2025)
Leveraging priors on distribution functions for multi-arm bandits
by: Vashishtha, Sumit, et al.
Published: (2025)
by: Vashishtha, Sumit, et al.
Published: (2025)
Minimum mean-squared error estimation with bandit feedback
by: Ghosh, Ayon, et al.
Published: (2022)
by: Ghosh, Ayon, et al.
Published: (2022)
Spectral bandits for smooth graph functions with applications in recommender systems
by: Kocák, Tomáš, et al.
Published: (2026)
by: Kocák, Tomáš, et al.
Published: (2026)
A single algorithm for both restless and rested rotting bandits
by: Seznec, Julien, et al.
Published: (2026)
by: Seznec, Julien, et al.
Published: (2026)
Efficient learning by implicit exploration in bandit problems with side observations
by: Kocak, Tomas, et al.
Published: (2026)
by: Kocak, Tomas, et al.
Published: (2026)
Covariance-adapting algorithm for semi-bandits with application to sparse rewards
by: Perrault, Pierre, et al.
Published: (2026)
by: Perrault, Pierre, et al.
Published: (2026)
Optimal cross-learning for contextual bandits with unknown context distributions
by: Schneider, Jon, et al.
Published: (2024)
by: Schneider, Jon, et al.
Published: (2024)
Model selection for behavioral learning data and applications to contextual bandits
by: Aubert, Julien, et al.
Published: (2025)
by: Aubert, Julien, et al.
Published: (2025)
Adversarial Combinatorial Semi-bandits with Graph Feedback
by: Wen, Yuxiao
Published: (2025)
by: Wen, Yuxiao
Published: (2025)
Fast, Precise Thompson Sampling for Bayesian Optimization
by: Sweet, David
Published: (2024)
by: Sweet, David
Published: (2024)
Similar Items
-
When and why randomised exploration works (in linear bandits)
by: Abeille, Marc, et al.
Published: (2025) -
Ensemble sampling for linear bandits: small ensembles suffice
by: Janz, David, et al.
Published: (2023) -
VITS : Variational Inference Thompson Sampling for contextual bandits
by: Clavier, Pierre, et al.
Published: (2023) -
Sharp analysis of linear ensemble sampling
by: Akhavan, Arya, et al.
Published: (2026) -
On the optimal regret of collaborative personalized linear bandits
by: Huang, Bruce, et al.
Published: (2025)