◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Naman Agarwal

Google Research

39 papers hereh-index 212.7k citations54 works total

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

author position
  • first author27
  • middle author11

Across the 38 of 39 papers where every author was matched, so the position is known.

fields
  • cs.LG27
  • math.OC3
  • stat.ML3
  • cs.CC1
  • cs.CR1
  • cs.CV1
affiliations
  • Google Research
Homepage
same name
  • Naman Agarwal — 6 papers, h 3
  • Naman Agarwal — 5 papers, h 8
  • Naman Agarwal — 2 papers, h 1
  • Naman Agarwal — 2 papers, h 1
  • Naman Agarwal — 1 paper
  • Naman Agarwal — 1 paper, h 0

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
20132024
most citedcpSGD: Communication-efficient and differentially-private distributed SGD

184 citations · 526 across the 38 of their papers we have counts for

collaborators
Showing 2018Show all

4 papers · 1 filter

cs.LG2018★ 10 cited

Efficient Full-Matrix Adaptive Regularization

Naman Agarwal, Brian Bullins, Xinyi Chen +4

Adaptive regularization methods pre-multiply a descent direction by a preconditioning matrix. Due to the large number of parameters of machine learning problems, full-matrix precon…

math.OC2018★ 30 cited

Adaptive regularization with cubics on manifolds

Naman Agarwal, Nicolas Boumal, Brian Bullins +1

Adaptive regularization with cubics (ARC) is an algorithm for unconstrained, non-convex optimization. Akin to the popular trust-region method, its iterations can be thought of as a…

stat.ML2018★ 184 cited

cpSGD: Communication-efficient and differentially-private distributed SGD

Naman Agarwal, Ananda Theertha Suresh, Felix Yu +2

Distributed stochastic gradient descent is an important subroutine in distributed learning. A setting of particular interest is when the clients are mobile devices, where two impor…

cs.LG2018

Optimal Sketching Bounds for Exp-concave Stochastic Minimization

Naman Agarwal, Alon Gonen

We derive optimal statistical and computational complexity bounds for exp-concave stochastic minimization in terms of the effective dimension. For common eigendecay patterns of the…

◍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.