activity
20172024
most citedProgressive Learning for Systematic Design of Large Neural Networks

23 citations · 47 across the 15 of their papers we have counts for

collaborators
Showing 2018Show all

8 papers · 1 filter

cs.LG2018

Entropy-regularized Optimal Transport Generative Models

Dong Liu, Minh Thành Vu, Saikat Chatterjee +1

We investigate the use of entropy-regularized optimal transport (EOT) cost in developing generative models to learn implicit distributions. Two generative models are proposed. One…

stat.ML2018

Kernel Regression for Graph Signal Prediction in Presence of Sparse Noise

Arun Venkitaraman, Pascal Frossard, Saikat Chatterjee

In presence of sparse noise we propose kernel regression for predicting output vectors which are smooth over a given graph. Sparse noise models the training outputs being corrupted…

cs.IT2018

Supervised Linear Regression for Graph Learning from Graph Signals

Arun Venkitaraman, Hermina Petric Maretic, Saikat Chatterjee +1

We propose a supervised learning approach for predicting an underlying graph from a set of graph signals. Our approach is based on linear regression. In the linear regression model…

stat.ML2018

Locally Convex Sparse Learning over Networks

Ahmed Zaki, Saikat Chatterjee, Partha P. Mitra +1

We consider a distributed learning setup where a sparse signal is estimated over a network. Our main interest is to save communication resource for information exchange over the ne…

stat.ML2018

Gaussian Processes Over Graphs

Arun Venkitaraman, Saikat Chatterjee, Peter Händel

We propose Gaussian processes for signals over graphs (GPG) using the apriori knowledge that the target vectors lie over a graph. We incorporate this information using a graph- Lap…

stat.ML2018

Multi-kernel Regression For Graph Signal Processing

Arun Venkitaraman, Saikat Chatterjee, Peter Händel

We develop a multi-kernel based regression method for graph signal processing where the target signal is assumed to be smooth over a graph. In multi-kernel regression, an effective…