◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Mazumdar

71 papers hereh-index 252.6k citations138 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author6
  • first author17
  • middle author29
  • last author18

Across the 70 of 71 papers where every author was matched, so the position is known.

fields
  • cs.IT33
  • cs.LG12
  • stat.ML12
  • cs.DS4
  • cs.DB2
  • cs.DC2
same name
  • A. Mazumdar — 263 papers, h 60
  • A. Mazumdar — 33 papers, h 23
  • A. Mazumdar — 28 papers, h 8
  • A. Mazumdar — 19 papers, h 10
  • A. Mazumdar — 9 papers, h 7
  • A. Mazumdar — 2 papers, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20052023
most citedCodes in Permutations and Error Correction for Rank Modulation

184 citations · 779 across the 55 of their papers we have counts for

collaborators
Showing 2019 · cs.LGShow all

4 papers · 2 filters

cs.LG2019

Communication-Efficient and Byzantine-Robust Distributed Learning with Error Feedback

Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe +2

We develop a communication-efficient distributed learning algorithm that is robust against Byzantine worker machines. We propose and analyze a distributed gradient-descent algorith…

cs.LG2019

vqSGD: Vector Quantized Stochastic Gradient Descent

Venkata Gandikota, Daniel Kane, Raj Kumar Maity +1

In this work, we present a family of vector quantization schemes \emph{vqSGD} (Vector-Quantized Stochastic Gradient Descent) that provide an asymptotic reduction in the communicati…

cs.LG2019★ 5 cited

Sample Complexity of Learning Mixtures of Sparse Linear Regressions

Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor +1

In the problem of learning mixtures of linear regressions, the goal is to learn a collection of signal vectors from a sequence of (possibly noisy) linear measurements, where each m…

cs.LG2019★ 6 cited

Same-Cluster Querying for Overlapping Clusters

Wasim Huleihel, Arya Mazumdar, Muriel Médard +1

Overlapping clusters are common in models of many practical data-segmentation applications. Suppose we are given n elements to be clustered into k possibly overlapping clusters…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.