50 citations · 383 across the 69 of their papers we have counts for
6 papers · 1 filter
Causal Bandits without Graph Learning
Mikhail Konobeev, Jalal Etesami, Negar Kiyavash
We study the causal bandit problem when the causal graph is unknown and develop an efficient algorithm for finding the parent node of the reward node using atomic interventions. We…
LazyIter: A Fast Algorithm for Counting Markov Equivalent DAGs and Designing Experiments
Ali AhmadiTeshnizi, Saber Salehkaleybar, Negar Kiyavash
The causal relationships among a set of random variables are commonly represented by a Directed Acyclic Graph (DAG), where there is a directed edge from variable to variable $Y…
Database Alignment with Gaussian Features
Osman Emre Dai, Daniel Cullina, Negar Kiyavash
We consider the problem of aligning a pair of databases with jointly Gaussian features. We consider two algorithms, complete database alignment via MAP estimation among all possibl…
Nonparametric Hawkes Processes: Online Estimation and Generalization Bounds
Yingxiang Yang, Jalal Etesami, Niao He +1
In this paper, we design a nonparametric online algorithm for estimating the triggering functions of multivariate Hawkes processes. Unlike parametric estimation, where evolutionary…
A New Measure of Conditional Dependence
Jalal Etesami, Kun Zhang, Negar Kiyavash
Measuring conditional dependencies among the variables of a network is of great interest to many disciplines. This paper studies some shortcomings of the existing dependency measur…
Efficient Neighborhood Selection for Gaussian Graphical Models
Yingxiang Yang, Jalal Etesami, Negar Kiyavash
This paper addresses the problem of neighborhood selection for Gaussian graphical models. We present two heuristic algorithms: a forward-backward greedy algorithm for general Gauss…