109 citations · 125 across the 5 of their papers we have counts for
5 papers
Depth Dependence of P Learning Rates in ReLU MLPs
Samy Jelassi, Boris Hanin, Ziwei Ji +3
In this short note we consider random fully connected ReLU networks of width and depth equipped with a mean-field weight initialization. Our purpose is to study the depende…
AIDE: Fast and Communication Efficient Distributed Optimization
Sashank J. Reddi, Jakub Konečný, Peter Richtárik +2
In this paper, we present two new communication-efficient methods for distributed minimization of an average of functions. The first algorithm is an inexact variant of the DANE alg…
On the High-dimensional Power of Linear-time Kernel Two-Sample Testing under Mean-difference Alternatives
Aaditya Ramdas, Sashank J. Reddi, Barnabas Poczos +2
Nonparametric two sample testing deals with the question of consistently deciding if two distributions are different, given samples from both, without making any parametric assumpt…
Large-scale randomized-coordinate descent methods with non-separable linear constraints
Sashank Reddi, Ahmed Hefny, Carlton Downey +2
We develop randomized (block) coordinate descent (CD) methods for linearly constrained convex optimization. Unlike most CD methods, we do not assume the constraints to be separable…
On the Decreasing Power of Kernel and Distance based Nonparametric Hypothesis Tests in High Dimensions
Sashank J. Reddi, Aaditya Ramdas, Barnabás Póczos +2
This paper is about two related decision theoretic problems, nonparametric two-sample testing and independence testing. There is a belief that two recently proposed solutions, base…