method · first seen 4 Oct 2026
linear upper confidence bound bandit
Also: LinUCB, linear upper confidence bound
A contextual bandit algorithm that selects actions using linear reward models plus an exploration bonus.
Mentions per week
PapersCodeDiscussion
Earliest sources
- MESH-Harness: Self-Improving Agent Harnesses via Bandit-Guided Compositional EvolutionPapers · 4 Oct 2026 · Zhiwei Shang, Yu Huo, Mingrong Gong, An Yan, Zikun Qu, Junhao Dong, Bryan Kian H…
- Sampling Allocation of LinUCB: Optimal Design Limits in the Small-Gap RegimePapers · 5 Oct 2026 · Yujie Liu, Vincent Y. F. Tan, Yunbei Xu
- Peer Memory Changes Who LLM Agents Consult Without a Detected Gain in Answer AccuracyPapers · 2 Nov 2026 · Jeffrey Chu, Anjali Joseph, Rivan Mandot, Feker Demere, Vincent Li
- Does LinUCB Need Valid Confidence Sets?Papers · 3 Nov 2026 · Ahmed Ben Yahmed, Marc Abeille, David Janz, Clément Calauzènes
- Multi-objective drift-aware MLOps agent for model retrainingPapers · 6 Nov 2026 · Kumuda Valli, Anli Ji
Latest sources
- Multi-objective drift-aware MLOps agent for model retrainingPapers · 6 Nov 2026 · Kumuda Valli, Anli Ji
- Does LinUCB Need Valid Confidence Sets?Papers · 3 Nov 2026 · Ahmed Ben Yahmed, Marc Abeille, David Janz, Clément Calauzènes
- Peer Memory Changes Who LLM Agents Consult Without a Detected Gain in Answer AccuracyPapers · 2 Nov 2026 · Jeffrey Chu, Anjali Joseph, Rivan Mandot, Feker Demere, Vincent Li
- Sampling Allocation of LinUCB: Optimal Design Limits in the Small-Gap RegimePapers · 5 Oct 2026 · Yujie Liu, Vincent Y. F. Tan, Yunbei Xu
- MESH-Harness: Self-Improving Agent Harnesses via Bandit-Guided Compositional EvolutionPapers · 4 Oct 2026 · Zhiwei Shang, Yu Huo, Mingrong Gong, An Yan, Zikun Qu, Junhao Dong, Bryan Kian H…