activity
20182020
most citedCoding Theorems for Noisy Permutation Channels

37 citations · 73 across the 4 of their papers we have counts for

collaborators

7 papers

cs.LG20204 cited

Gradient-Based Empirical Risk Minimization using Local Polynomial Regression

Ali Jadbabaie, Anuran Makur, Devavrat Shah

In this paper, we consider the problem of empirical risk minimization (ERM) of smooth, strongly convex loss functions using iterative gradient-based methods. A major goal of this l…

cs.IT202037 cited

Coding Theorems for Noisy Permutation Channels

Anuran Makur

In this paper, we formally define and analyze the class of noisy permutation channels. The noisy permutation channel model constitutes a standard discrete memoryless channel (DMC)…

stat.ML20201 cited

Estimation of Skill Distributions

Ali Jadbabaie, Anuran Makur, Devavrat Shah

In this paper, we study the problem of learning the skill distribution of a population of agents from observations of pairwise games in a tournament. These games are played among r…

cs.LG201931 cited

On Universal Features for High-Dimensional Learning and Inference

Shao-Lun Huang, Anuran Makur, Gregory W. Wornell +1

We consider the problem of identifying universal low-dimensional features from high-dimensional data for inference tasks in settings involving learning. For such problems, we intro…

cs.IT2018

Broadcasting on Random Directed Acyclic Graphs

Anuran Makur, Elchanan Mossel, Yury Polyanskiy

We study a generalization of the well-known model of broadcasting on trees. Consider a directed acyclic graph (DAG) with a unique source vertex , and suppose all other vertices…

cs.LG2018

Probabilistic Clustering Using Maximal Matrix Norm Couplings

David Qiu, Anuran Makur, Lizhong Zheng

In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximiz…