Multi-armed linear bandits with latent biases
From MaRDI portal
Publication:6198758
DOI10.1016/j.ins.2024.120103OpenAlexW4391028573WikidataQ129680883 ScholiaQ129680883MaRDI QIDQ6198758
Xiaoqian Liu, Qiyu Kang, Sijie Wang, Yuan-Rui Yang, Wee Peng Tay, Rui She
Publication date: 20 March 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2024.120103
Cites Work
- Unnamed Item
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges
- Multi-objective simultaneous optimistic optimization
- Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
- Asymptotically efficient adaptive allocation rules
- Reinforcement learning with immediate rewards and linear hypotheses
- Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma
- Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
- Strongly convex analysis
- Linearly Parameterized Bandits
- 10.1162/153244303321897663
- Some aspects of the sequential design of experiments
- Finite-time analysis of the multiarmed bandit problem
- Credit and quality intelligent learning based multi-armed bandit scheme for unknown worker selection in multimedia MCS
This page was built for publication: Multi-armed linear bandits with latent biases