Proximity is measured over citations between two papers we both hold, weighted by how heavily one leans on the other, and is symmetric — it does not distinguish citing from being cited. Authors without a profile here are skipped, and a genuinely close colleague can be missing simply because their work is not in our arXiv corpus. Method: docs/06-citations-pipeline.md.
Papers
(1 of 10)
Near-optimal Offline and Streaming Algorithms for Learning Non-Linear Dynamical Systems
published2021 · Neural Information Processing Systems · 1 citations
with Suhas S Kowshik, Prateek Jain, Praneeth Netrapalli
no link
Explicit Regularization of Stochastic Gradient Methods through Duality.
published2021 · International Conference on Artificial Intelligence and Statistics · 3 citations · first circulated 2020
Open Problem: Do Good Algorithms Necessarily Query Bad Points?
published2019 · Conference on Learning Theory
with Rong Ge, Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli
no link
SGD without Replacement: Sharper Rates for General Smooth Convex Functions
published2019 · International Conference on Machine Learning · 27 citations
with Prateek Jain, Praneeth Netrapalli
no link
Optimal Single Sample Tests for Structured versus Unstructured Network Data.
published2018 · Conference on Learning Theory · 10 citations
with Guy Bresler
no link
Assembled from arXiv and OpenAlex. Duplicate records for the same paper are merged, and the published version is shown where we could identify one. Corrections welcome.