activity
20192021
most citedDepth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem

12 citations · 13 across the 3 of their papers we have counts for

collaborators

5 papers

cs.GT20211 cited

Stochastic Multiplicative Weights Updates in Zero-Sum Games

James P. Bailey, Sai Ganesh Nagarajan, Georgios Piliouras

We study agents competing against each other in a repeated network zero-sum game while applying the multiplicative weights update (MWU) algorithm with fixed learning rates. In our…

stat.ML2020

Efficient Statistics for Sparse Graphical Models from Truncated Samples

Arnab Bhattacharyya, Rathin Desai, Sai Ganesh Nagarajan +1

In this paper, we study high-dimensional estimation from truncated samples. We focus on two fundamental and classical problems: (i) inference of sparse Gaussian graphical models an…

cs.LG2020

Better Depth-Width Trade-offs for Neural Networks through the lens of Dynamical Systems

Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas

The expressivity of neural networks as a function of their depth, width and type of activation units has been an important question in deep learning theory. Recently, depth separat…

cs.LG201912 cited

Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem

Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas +1

Understanding the representational power of Deep Neural Networks (DNNs) and how their structural properties (e.g., depth, width, type of activation unit) affect the functions they…

cs.LG2019

On the Analysis of EM for truncated mixtures of two Gaussians

Sai Ganesh Nagarajan, Ioannis Panageas

Motivated by a recent result of Daskalakis et al. 2018, we analyze the population version of Expectation-Maximization (EM) algorithm for the case of \textit{truncated} mixtures of…