2 papers
cs.LG2026
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…
cs.LG2025
Sample Complexity of Nonparametric Closeness Testing for Continuous Distributions and Its Application to Causal Discovery with Hidden Confounding
Fateme Jamshidi, Sina Akbari, Negar Kiyavash
We study the problem of closeness testing for continuous distributions and its implications for causal discovery. Specifically, we analyze the sample complexity of distinguishing w…