1 citations · 1 across the 12 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LG2026
Active Context Selection Improves Simple Regret in Contextual Bandits
Mohammad Shahverdikondori, Jalal Etesami, Negar Kiyavash
We study the contextual multi-armed bandit problem with a finite context space (a.k.a. subpopulations), where the learner recommends a best action for each context and is evaluated…
cs.DS2026
Neighborhood-Aware Graph Labeling Problem
Mohammad Shahverdikondori, Sepehr Elahi, Patrick Thiran +1
Motivated by optimization oracles in bandits with network interference, we study the Neighborhood-Aware Graph Labeling (NAGL) problem. Given a graph , a label set of siz…