Negar Kiyavash

About
Privacy
Disclaimer

Graph Chatbot

Related publications (31)

Learning Linear Non-Gaussian Causal Models in the Presence of Latent Variables

Saber Salehkaleybar, Negar Kiyavash, Kun Zhang

We consider the problem of learning causal models from observational data generated by linear non-Gaussian acyclic causal models with latent variables. Without considering the effect of latent variables, the inferred causal relationships among the observed ...

Microtome Publishing2020

Model-Augmented Conditional Mutual Information Estimation for Feature Selection

Negar Kiyavash

Markov blanket feature selection, while theoretically optimal, is generally challenging to implement. This is due to the shortcomings of existing approaches to conditional independence (CI) testing, which tend to struggle either with the curse of dimension ...

2020

The Devil is in the Detail: A Framework for Macroscopic Prediction via Microscopic Models

Negar Kiyavash

Macroscopic data aggregated from microscopic events are pervasive in machine learning, such as country-level COVID-19 infection statistics based on city-level data. Yet, many existing approaches for predicting macroscopic behavior only use aggregated data, ...

2020

Graph Signal Processing: Foundations and Emerging Directions [From the Guest Editors]

Dimitri Nestor Alice Van De Ville, Negar Kiyavash

The articles in this special section focus on graph signal processing. Generically, the networks that sustain our societies can be understood as complex systems formed by multiple nodes, where global network behavior arises from local interactions between ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Achievability of nearly-exact alignment for correlated Gaussian databases

Negar Kiyavash

We study the conditions that allow for the alignment of correlated databases with multivariate Gaussian features. We present some analysis tools that allow us to go beyond the achievability result for exact alignment and derive the condition for nearly-exa ...

IEEE2020

Characterizing Distribution Equivalence and Structure Learning for Cyclic and Acyclic Directed Graphs

Negar Kiyavash

The main approach to defining equivalence among acyclic directed causal graphical models is based on the conditional independence relationships in the distributions that the causal models can generate, in terms of the Markov equivalence. However, it is kno ...

2020

A Catalyst Framework for Minimax Optimization

Negar Kiyavash

We introduce a generic two-loop scheme for smooth minimax optimization with strongly-convex-concave objectives. Our approach applies the accelerated proximal point framework (or Catalyst) to the associated dual problem and takes full advantage of existing ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2020

LazyIter: A Fast Algorithm for Counting Markov Equivalent DAGs and Designing Experiments

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 X to variable Y if X is a direct cause of Y. From the purely observational data, the true caus ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2020

Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs

Matthias Grossglauser, Osman Emre Dai, Negar Kiyavash

Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact information-theoretic threshold for graph alignment in correlated Erdös-Rény ...

Association for Computing Machinery (ACM)2019

Learning Hawkes Processes Under Synchronization Noise

Patrick Thiran, Matthias Grossglauser, Seyed Jalal Etesami, William Trouleau, Negar Kiyavash

Multivariate Hawkes processes (MHP) are widely used in a variety of fields to model the occurrence of discrete events. Prior work on learning MHPs has only focused on inference in the presence of perfect traces without noise. We address the problem of lear ...

PMLR2019

Learning Positive Functions with Pseudo Mirror Descent

Negar Kiyavash

The nonparametric learning of positive-valued functions appears widely in machine learning, especially in the context of estimating intensity functions of point processes. Yet, existing approaches either require computing expensive projections or semidefin ...

Curran Associates, Inc.2019

Page 2 of 2