185 citations · 375 across the 16 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.LG2026
Dynamic Regret in Online Convex Optimization with Indicator Switching Costs
Naram Mhaisen, George Iosifidis
We study dynamic regret in online convex optimization with an \emph{indicator switching cost}: a fixed penalty incurred whenever two consecutive decisions differ. This captures sta…
cs.NI2026
SEArch: Optimistic Policy Selection Between Scene Noise and Drift for UAV Radar Search
Noor Khial, Naram Mhaisen, Loay Ismail +1
Unmanned Aerial Vehicles (UAVs) equipped with radar sensors are deployed for target search missions in diverse environments, where targets exhibit characteristic signatures (e.g.,…
cs.LG2026
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…