Efficient Implementation of LinearUCB through Algorithmic Improvements and Vector Computing Acceleration for Embedded Learning Systems
Not on the map. Why?
Abstract (arXiv)
As the Internet of Things expands, embedding Artificial Intelligence algorithms in resource-constrained devices has become increasingly important to enable real-time, autonomous decision-making without relying on centralized cloud servers. However, implementing and executing complex algorithms in embedded devices poses significant challenges due to limited computational power, memory, and energy resources. This paper presents algorithmic and hardware techniques to efficiently implement two LinearUCB Contextual Bandits algorithms on resource-constrained embedded devices. Algorithmic modifications based on the Sherman-Morrison-Woodbury formula streamline model complexity, while vector acceleration is harnessed to speed up matrix operations. We analyze the impact of each optimization individually and then combine them in a two-pronged strategy. The results show notable improvements in execution time and energy consumption, demonstrating the effectiveness of combining algorithmic and hardware optimizations to enhance learning models for edge computing environments with low-power and real-time requirements.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 7 of its 39 references that are in the map. First posted on arXiv 22 Jan 2025.
Builds on
7 of 39 references.
References · 7
- 2019Machine Learning at the Network Edge: A Surveycited by 84
- 2020Contextual User Browsing Bandits for Large-Scale Online Mobile Recommendationcited by 8
- 2016Adaptive Lambda Least-Squares Temporal Difference Learningcited by 5
- 2023Ensemble Active Learning by Contextual Bandits for AI Incubation in Manufacturingcited by 5
- 2018Spatio-temporal Edge Service Placement: A Bandit Learning Approachcited by 4
- 2019Edge Computing in the Dark: Leveraging Contextual-Combinatorial Bandit and Coded Computingcited by 4
- 2020Klessydra-T: Designing Vector Coprocessors for Multi-Threaded Edge-Computing Corescited by 3
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025HD-CB: The First Exploration of Hyperdimensional Computing for Contextual Bandits Problemscited by 2
- 2025Scalable LinUCB: Low-Rank Design Matrix Updates for Recommenders with Large Action Spacescited by 2
- 2025Learning Over Dirty Data with Minimal Repairscited by 0
- 2026Contextual Bandits for Resource-Constrained Devices using Probabilistic Learningcited by 0
- 2026Contextual Bandits for Resource-Constrained Devices using Probabilistic Learning13 May 2026
- 2025Scalable LinUCB: Low-Rank Design Matrix Updates for Recommenders with Large Action Spaces22 Oct 2025
- 2025Learning Over Dirty Data with Minimal Repairs18 Mar 2025
- 2025HD-CB: The First Exploration of Hyperdimensional Computing for Contextual Bandits Problems28 Jan 2025