Mohammad Shahverdikondori

PhD student.

prof_pic.jpg

ODY room 4-16

École Polytechnique Fédérale de Lausanne

Lausanne, Switzerland

I am currently pursuing my PhD at the College of Management of Technology at EPFL, under the supervision of Prof. Negar Kiyavash. My research focuses on multi-armed bandit problems, particularly in settings with structured arms, with additional interests in causal inference. Prior to this, I completed my Bachelor’s degree in Computer Science at Sharif University of Technology (2018-2023).

You can see my full CV here(last update: October 2026).

selected publications

  1. active-context-selection.png
    Active Context Selection Improves Simple Regret in Contextual Bandits
    Mohammad Shahverdikondori ,  Jalal Etesami ,  and  Negar Kiyavash
    In NeurIPS , 2026
  2. graph-learning.jpg
    Pure Exploration Beyond Reward Feedback: The Role of Post-Action Context
    Mohammad Shahverdikondori* ,  Amir Mohammad Abouei* ,  Alireza Rezaeimoghadam ,  and  Negar Kiyavash
    In NeurIPS , 2026
  3. peer-influence.jpg
    Learning Peer Influence Probabilities with Linear Contextual Bandits
    Ahmed Sayeed Faruk ,  Mohammad Shahverdikondori ,  and  Elena Zheleva
    In SIGKDD , 2026
  4. trade-off.png
    Graph Learning is Suboptimal in Causal Bandits
    Mohammad Shahverdikondori ,  Jalal Etesami ,  and  Negar Kiyavash
    In AISTATS , 2026

news

Sep 2026 Excited to share that two of our papers have been accepted to NeurIPS 2026: “Active Context Selection Improves Simple Regret in Contextual Bandits” and “Pure Exploration Beyond Reward Feedback: The Role of Post-Action Context”. Thrilled to have both of them there!
Jun 2026 Our paper “Graph-dependent regret bounds in multi-armed bandits with interference” has been accepted to UAI 2026.
Jun 2026 I will be joining DRW in London as a Quantitative Research Intern this summer.
Jun 2026 I will attend RLSS 2026 in Milan from June 3 to June 12, 2026.
May 2026 Our paper “Learning Peer Influence Probabilities with Linear Contextual Bandits” has been accepted to SIGKDD 2026.
May 2026 Our new paper, “Active Context Selection Improves Simple Regret in Contextual Bandits”, is now available on arXiv.
Apr 2026 I had a wonderful two-week visit with Prof. Nicolò Cesa-Bianchi and his group at Università degli Studi di Milano in April.
Feb 2026 Our new work on the “Neighborhood-Aware Graph Labeling Problem” is now available on arXiv.
Jan 2026 Our paper “Graph Learning is Suboptimal in Causal Bandits” has been accepted to AISTATS 2026.
Oct 2025 We have also posted “Learning Peer Influence Probabilities with Linear Contextual Bandits” on arXiv.

All news →