Motivated by the need for communication-efficient distributed learning, ...
The logistic regression model is one of the most popular data generation...
We propose a first-order method for convex optimization, where instead o...
Federated Learning (FL) has gained increasing interest in recent years a...
One-bit compressed sensing (1bCS) is an extremely quantized signal
acqui...
In this paper, we address the dichotomy between heterogeneous models and...
Compressed sensing has been a very successful high-dimensional signal
ac...
To capture inherent geometric features of many community detection probl...
Understanding complex dynamics of two-sided online matching markets, whe...
While mixture of linear regressions (MLR) is a well-studied topic, prior...
Mixture models are widely used to fit complex and multimodal datasets. I...
The planted densest subgraph detection problem refers to the task of tes...
Mixtures of high dimensional Gaussian distributions have been studied
ex...
One-bit compressed sensing (1bCS) is an extreme-quantized signal acquisi...
In probabilistic nonadaptive group testing (PGT), we aim to characterize...
Recovery of support of a sparse vector from simple measurements is a wid...
The fuzzy or soft k-means objective is a popular generalization of the
w...
We study the problem of optimizing a non-convex loss function (with sadd...
Query auto-completion is a fundamental feature in search engines where t...
In the problem of learning a mixture of linear classifiers, the aim is t...
Mixture of linear regressions is a popular learning theoretic model that...
In modern multilabel classification problems, each data instance belongs...
We develop a distributed second order optimization algorithm that is
com...
In this paper, we present distributed generalized clustering algorithms ...
We propose a new mechanism to accurately answer a user-provided set of l...
We present two different approaches for parameter learning in several mi...
We develop a communication-efficient distributed learning algorithm that...
In this work, we present a family of vector quantization schemes vqSGD
(...
In the problem of learning mixtures of linear regressions, the goal is t...
One-bit compressed sensing (1bCS) is a method of signal acquisition unde...
Overlapping clusters are common in models of many practical data-segment...
In the beautifully simple-to-state problem of trace reconstruction, the ...
Source coding is the canonical problem of data compression in informatio...
Motivated by applications in distributed storage, the notion of a locall...
Index coding, a source coding problem over broadcast channels, has been ...
Recently Ermon et al. (2013) pioneered an ingenuous way to practically
c...
This paper considers the problem of implementing large-scale gradient de...
Random geometric graphs are the simplest, and perhaps the earliest possi...
Rectified linear units, or ReLUs, have become the preferred activation
f...
In this work we prove non-trivial impossibility results for perhaps the
...
To capture the inherent geometric features of many community detection
p...
Suppose, we are given a set of n elements to be clustered into k
(unknow...
In this paper, we initiate a rigorous theoretical study of clustering wi...
Entity resolution (ER) is the task of identifying all records in a datab...
We propose a novel rank aggregation method based on converting permutati...