This map shows the geographic impact of Naman Agarwal's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Naman Agarwal with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Naman Agarwal more than expected).
This network shows the impact of papers produced by Naman Agarwal. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Naman Agarwal. The network helps show where Naman Agarwal may publish in the future.
Co-authorship network of co-authors of Naman Agarwal
This figure shows the co-authorship network connecting the top 25 collaborators of Naman Agarwal.
A scholar is included among the top collaborators of Naman Agarwal based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Naman Agarwal. Naman Agarwal is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Agarwal, Naman, Nicolas Boumal, Brian Bullins, & Coralia Cartis. (2018). Adaptive regularization with cubics on manifolds with a first-order analysis. arXiv (Cornell University).2 indexed citations
11.
Agarwal, Naman, Ananda Theertha Suresh, Felix Yu, Sanjiv Kumar, & H. Brendan McMahan. (2018). cpSGD: communication-efficient and differentially-private distributed SGD. Neural Information Processing Systems. 31. 7575–7586.49 indexed citations
12.
Agarwal, Naman, Brian Bullins, Xinyi Chen, et al.. (2018). The Case for Full-Matrix Adaptive Regularization. arXiv (Cornell University).
Agarwal, Naman & Karan Singh. (2017). The Price of Differential Privacy for Online Learning.. International Conference on Machine Learning. 32–40.16 indexed citations
Agarwal, Naman, Zeyuan Allen Zhu, Brian Bullins, Elad Hazan, & Tengyu Ma. (2016). Finding Approximate Local Minima for Nonconvex Optimization in Linear Time.. arXiv (Cornell University).12 indexed citations
17.
Agarwal, Naman, Zeyuan Allen-Zhu, Brian Bullins, Elad Hazan, & Tengyu Ma. (2016). Finding Local Minima for Nonconvex Optimization in Linear Time. arXiv (Cornell University).3 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.