7 citations · 9 across the 4 of their papers we have counts for
4 papers
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
Arpit Agarwal, Sanjeev Khanna, Huan Li +4
We present a parallel algorithm for the -approximate maximum flow problem in capacitated, undirected graphs with vertices and edges, achieving $O(ε^{-3}\text{polylog…
Misalignment, Learning, and Ranking: Harnessing Users Limited Attention
Arpit Agarwal, Rad Niazadeh, Prathamesh Patil
In digital health and EdTech, recommendation systems face a significant challenge: users often choose impulsively, in ways that conflict with the platform's long-term payoffs. This…
Sublinear Algorithms for Hierarchical Clustering
Arpit Agarwal, Sanjeev Khanna, Huan Li +1
Hierarchical clustering over graphs is a fundamental task in data mining and machine learning with applications in domains such as phylogenetics, social network analysis, and infor…
A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits
Arpit Agarwal, Sanjeev Khanna, Prathamesh Patil
The stochastic -armed bandit problem has been studied extensively due to its applications in various domains ranging from online advertising to clinical trials. In practice howe…