Optimistic No-regret Algorithms for Discrete Caching

Dec 1, 2022·
Naram Mhaisen
Naram Mhaisen
,
Abhishek Sinha
,
Georgios Paschos
,
George Iosifidis
Abstract
We develop optimistic no-regret algorithms for the discrete caching problem, integrating untrusted predictions into the online learning framework with tight regret bounds.
Type
Publication
In Proc. ACM Meas. Anal. Comput. Syst. (POMACS), 6(3), Article 48 / ACM SIGMETRICS 2023
publications
Online Learning Caching Optimistic Learning
Naram Mhaisen
Authors
Naram Mhaisen
Postdoctoral Researcher

Naram is a Postdoctoral Researcher with the Networked Systems Group at the Faculty of Electrical Engineering, Mathematics, and Computer Science, TU Delft, The Netherlands. His research focuses on online learning techniques with applications in resource management across communication systems.

He received the B.Sc. degree in Computer Engineering from Qatar University in 2017 with the Order of Excellence award, and the M.Sc. degree with Distinction in Computing from Qatar University in 2020, supervised by Prof. Mohsen Guizani. He completed his Ph.D. at TU Delft in 2025, supervised by Dr. George Iosifidis, with a thesis on Optimistic Learning with Applications to Caching Networks.

His work has been recognized by the Microsoft Imagine Cup award (2017) and a NEC Europe Research Fellowship (2022).