activity
20152026
most citedLearning Network of Multivariate Hawkes Processes: A Time Series Approach

50 citations · 123 across the 36 of their papers we have counts for

collaborators
Showing cs.LGShow all

18 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.LG2025

Online Mixture of Experts: No-Regret Learning for Optimal Collective Decision-Making

Larkin Liu, Jalal Etesami

We explore the use of expert-guided bandit learning, which we refer to as online mixture-of-experts (OMoE). In this setting, given a context, a candidate committee of experts must…

cs.LG2025

Graph Learning Is Suboptimal in Causal Bandits

Mohammad Shahverdikondori, Jalal Etesami, Negar Kiyavash

We study regret minimization in causal bandits under causal sufficiency where the underlying causal structure is not known to the agent. Previous work has focused on identifying th…

cs.LG2025

Recycling History: Efficient Recommendations from Contextual Dueling Bandits

Suryanarayana Sankagiri, Jalal Etesami, Pouria Fatemi +1

The contextual duelling bandit problem models adaptive recommender systems, where the algorithm presents a set of items to the user, and the user's choice reveals their preference.…

cs.LG2025

Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization

Suryanarayana Sankagiri, Jalal Etesami, Matthias Grossglauser

This paper provides a theoretical analysis of a new learning problem for recommender systems where users provide feedback by comparing pairs of items instead of rating them individ…

cs.LG2025

Riemannian Manifold Learning for Stackelberg Games with Neural Flow Representations

Larkin Liu, Kashif Rasul, Yutong Chao +1

We present a novel framework for online learning in Stackelberg general-sum games, where two agents, the leader and follower, engage in sequential turn-based interactions. At the c…

cs.LG2024

Fast Proxy Experiment Design for Causal Effect Identification

Sepehr Elahi, Sina Akbari, Jalal Etesami +2

Identifying causal effects is a key problem of interest across many disciplines. The two long-standing approaches to estimate causal effects are observational and experimental (ran…

cs.LG2024

Confounded Budgeted Causal Bandits

Fateme Jamshidi, Jalal Etesami, Negar Kiyavash

We study the problem of learning 'good' interventions in a stochastic environment modeled by its underlying causal graph. Good interventions refer to interventions that maximize re…

cs.LG2022★ 1 cited

Novel Ordering-based Approaches for Causal Structure Learning in the Presence of Unobserved Variables

Ehsan Mokhtarian, Mohammadsadegh Khorasani, Jalal Etesami +1

We propose ordering-based approaches for learning the maximal ancestral graph (MAG) of a structural equation model (SEM) up to its Markov equivalence class (MEC) in the presence of…

cs.LG2022★ 1 cited

Causal Effect Identification in Uncertain Causal Networks

Sina Akbari, Fateme Jamshidi, Ehsan Mokhtarian +3

Causal identification is at the core of the causal inference literature, where complete algorithms have been proposed to identify causal queries of interest. The validity of these…

cs.LG2022★ 4 cited

Revisiting the General Identifiability Problem

Yaroslav Kivva, Ehsan Mokhtarian, Jalal Etesami +1

We revisit the problem of general identifiability originally introduced in [Lee et al., 2019] for causal inference and note that it is necessary to add positivity assumption of obs…

cs.LG2022

Experimental Design for Causal Effect Identification

Sina Akbari, Jalal Etesami, Negar Kiyavash

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to p…

cs.LG2022

A Free Lunch with Influence Functions? Improving Neural Network Estimates with Concepts from Semiparametric Statistics

Matthew J. Vowels, Sina Akbari, Necati Cihan Camgoz +1

Parameter estimation in empirical fields is usually undertaken using parametric models, and such models readily facilitate statistical inference. Unfortunately, they are unlikely t…

cs.LG2021★ 2 cited

Learning Bayesian Networks in the Presence of Structural Side Information

Ehsan Mokhtarian, Sina Akbari, Fateme Jamshidi +2

We study the problem of learning a Bayesian network (BN) of a set of variables when structural side information about the system is available. It is well known that learning the st…

cs.LG2021★ 2 cited

Causal Effect Identification with Context-specific Independence Relations of Control Variables

Ehsan Mokhtarian, Fateme Jamshidi, Jalal Etesami +1

We study the problem of causal effect identification from observational distribution given the causal graph and some context-specific independence (CSI) relations. It was recently…

cs.LG2019★ 35 cited

Wasserstein Adversarial Imitation Learning

Huang Xiao, Michael Herman, Joerg Wagner +3

Imitation Learning describes the problem of recovering an expert policy from demonstrations. While inverse reinforcement learning approaches are known to be very sample-efficient i…

cs.LG2017★ 1 cited

Learning Vector Autoregressive Models with Latent Processes

Saber Salehkaleybar, Jalal Etesami, Negar Kiyavash +1

We study the problem of learning the support of transition matrix between random processes in a Vector Autoregressive (VAR) model from samples when a subset of the processes are la…

cs.LG2016★ 50 cited

Learning Network of Multivariate Hawkes Processes: A Time Series Approach

Jalal Etesami, Negar Kiyavash, Kun Zhang +1

Learning the influence structure of multiple time series data is of great interest to many disciplines. This paper studies the problem of recovering the causal structure in network…