6 papers
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…
LRW-Persian: Lip-reading in the Wild Dataset for Persian Language
Zahra Taghizadeh, Mohammad Shahverdikondori, Arian Noori +1
Lipreading has emerged as an increasingly important research area for developing robust speech recognition systems and assistive technologies for the hearing-impaired. However, non…
Best Group Identification in Multi-Objective Bandits
Mohammad Shahverdikondori, Mohammad Reza Badri, Negar Kiyavash
We introduce the Best Group Identification problem in a multi-objective multi-armed bandit setting, where an agent interacts with groups of arms with vector-valued rewards. The per…
Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
Fateme Jamshidi, Mohammad Shahverdikondori, Negar Kiyavash
We study multi-armed bandits under network interference, where each unit's reward depends on its own treatment and those of its neighbors in a given graph. This induces an exponent…
QWO: Speeding Up Permutation-Based Causal Discovery in LiGAMs
Mohammad Shahverdikondori, Ehsan Mokhtarian, Negar Kiyavash
Causal discovery is essential for understanding relationships among variables of interest in many scientific domains. In this paper, we focus on permutation-based methods for learn…
Computing mixed Schatten norm of completely positive maps
Mohammad ShahverdiKondori, Sio On Chan
Computing norm for matrices is a classical problem in computational mathematics and power iteration is a well-known method for computing norm f…