activity
20062025
most citedGossip Algorithms for Distributed Signal Processing

740 citations · 3.4k across the 125 of their papers we have counts for

collaborators
Showing 2018Show all

8 papers · 1 filter

cs.LG2018★ 18 cited

Discrete Adversarial Attacks and Submodular Optimization with Applications to Text Classification

Qi Lei, Lingfei Wu, Pin-Yu Chen +3

Adversarial examples are carefully constructed modifications to an input that completely change the output of a classifier but are imperceptible to humans. Despite these successful…

eess.IV2018★ 6 cited

Adversarial Video Compression Guided by Soft Edge Detection

Sungsoo Kim, Jin Soo Park, Christos G. Bampis +4

We propose a video compression framework using conditional Generative Adversarial Networks (GANs). We rely on two encoders: one that deploys a standard video codec and another whic…

cs.LG2018★ 5 cited

Experimental Design for Cost-Aware Learning of Causal Graphs

Erik M. Lindgren, Murat Kocaoglu, Alexandros G. Dimakis +1

We consider the minimum cost intervention design problem: Given the essential graph of a causal graph and a cost to intervene on a variable, identify the set of interventions with…

cs.LG2018★ 30 cited

Sparse Logistic Regression Learns All Discrete Pairwise Graphical Models

Shanshan Wu, Sujay Sanghavi, Alexandros G. Dimakis

We characterize the effectiveness of a classical algorithm for recovering the Markov graph of a general discrete pairwise graphical model from i.i.d. samples. The algorithm is (app…

stat.ML2018★ 9 cited

Applications of Common Entropy for Causal Inference

Murat Kocaoglu, Sanjay Shakkottai, Alexandros G. Dimakis +2

We study the problem of discovering the simplest latent variable that can make two observed discrete variables conditionally independent. The minimum entropy required for such a la…

stat.ML2018★ 40 cited

Learning a Compressed Sensing Measurement Matrix via Gradient Unrolling

Shanshan Wu, Alexandros G. Dimakis, Sujay Sanghavi +5

Linear encoding of sparse vectors is widely popular, but is commonly data-independent -- missing any possible extra (but a priori unknown) structure beyond sparsity. In this paper…