3 citations · 11 across the 22 of their papers we have counts for
8 papers · 1 filter
Constrained Online Convex Optimization with Memory and Predictions
Mohammed Abdullah, George Iosifidis, Salah Eddine Elayoubi +1
We study Constrained Online Convex Optimization with Memory (COCO-M), where both the loss and the constraints depend on a finite window of past decisions made by the learner. This…
Equitable Multi-Task Learning for AI-RANs
Panayiotis Raptis, Fatih Aslan, George Iosifidis
AI-enabled Radio Access Networks (AI-RANs) are expected to serve heterogeneous users with time-varying learning tasks over shared edge resources. Ensuring equitable inference perfo…
Partially Lazy Gradient Descent for Smoothed Online Learning
Naram Mhaisen, George Iosifidis
We introduce \textsc{-lazyGD}, an online learning algorithm that bridges the gap between greedy Online Gradient Descent (OGD, for ) and lazy GD/dual-averaging (for $k{=}T…
CHOMET: Conditional Handovers via Meta-Learning
Michail Kalntis, Fernando A. Kuipers, George Iosifidis
Handovers (HOs) are the cornerstone of modern cellular networks for enabling seamless connectivity to a vast and diverse number of mobile users. However, as mobile networks become…
On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning
Naram Mhaisen, George Iosifidis
We revisit the Follow the Regularized Leader (FTRL) framework for Online Convex Optimization (OCO) over compact sets, focusing on achieving dynamic regret guarantees. Prior work ha…
Optimistic Online Non-stochastic Control via FTRL
Naram Mhaisen, George Iosifidis
This paper brings the concept of ``optimism" to the new and promising framework of online Non-stochastic Control (NSC). Namely, we study how NSC can benefit from a prediction oracl…