Context-aware proactive content caching with service differentiation in wireless networks

S Müller, O Atan, M Van Der Schaar… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
Content caching in small base stations or wireless infostations is considered to be a suitable
approach to improve the efficiency in wireless content delivery. Placing the optimal content …

May AI? Design ideation with cooperative contextual bandits

J Koch, A Lucero, L Hegemann… - Proceedings of the 2019 …, 2019 - dl.acm.org
Design ideation is a prime creative activity in design. However, it is challenging to support
computationally due to its quickly evolving and exploratory nature. The paper presents …

Distributed clustering of linear bandits in peer to peer networks

N Korda, B Szorenyi, S Li - International conference on …, 2016 - proceedings.mlr.press
We provide two distributed confidence ball algorithms for solving linear bandit problems in
peer to peer networks with limited communication capabilities. For the first, we assume that …

Spatio–temporal edge service placement: A bandit learning approach

L Chen, J Xu, S Ren, P Zhou - IEEE Transactions on Wireless …, 2018 - ieeexplore.ieee.org
Shared edge computing platforms deployed at the radio access network are expected to
significantly improve the quality-of-service delivered by application service providers (ASPs) …

Imagesense: An intelligent collaborative ideation tool to support diverse human-computer partnerships

J Koch, N Taffin, M Beaudouin-Lafon, M Laine… - Proceedings of the …, 2020 - dl.acm.org
Professional designers create mood boards to explore, visualize, and communicate hard-to-
express ideas. We present ImageCascade, an intelligent, collaborative ideation tool that …

Delay and cooperation in nonstochastic bandits

N Cesa-Bianchi, C Gentile… - … on Learning Theory, 2016 - proceedings.mlr.press
We study networks of communicating learning agents that cooperate to solve a common
nonstochastic bandit problem. Agents use an underlying communication network to get …

Distributed gradient descent algorithm robust to an arbitrary number of byzantine attackers

X Cao, L Lai - IEEE Transactions on Signal Processing, 2019 - ieeexplore.ieee.org
Due to the growth of modern dataset size and the desire to harness computing power of
multiple machines, there is a recent surge of interest in the design of distributed machine …

Blockchain-enabled contextual online learning under local differential privacy for coronary heart disease diagnosis in mobile edge computing

X Liu, P Zhou, T Qiu, DO Wu - IEEE Journal of Biomedical and …, 2020 - ieeexplore.ieee.org
Due to the increasing medical data for coronary heart disease (CHD) diagnosis, how to
assist doctors to make proper clinical diagnosis has attracted considerable attention …

Safe linear thompson sampling with side information

A Moradipari, S Amani, M Alizadeh… - IEEE Transactions …, 2021 - ieeexplore.ieee.org
The design and performance analysis of bandit algorithms in the presence of stage-wise
safety or reliability constraints has recently garnered significant interest. In this work, we …

Budget-constrained edge service provisioning with demand estimation via bandit learning

L Chen, J Xu - IEEE Journal on Selected Areas in …, 2019 - ieeexplore.ieee.org
Shared edge computing platforms, which enable Application Service Providers (ASPs) to
deploy applications in close proximity to mobile users are providing ultra-low latency and …