Arpit Agarwal

Affiliations:
  • Indian Institute of Technology Bombay, Mumbai, India
  • Columbia University, USA (former)


According to our database1, Arpit Agarwal authored at least 20 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Misalignment, Learning, and Ranking: Harnessing Users Limited Attention.
CoRR, 2024

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Learning-Augmented Dynamic Submodular Maximization.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Semi-Bandit Learning for Monotone Stochastic Optimization.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2022
Sublinear Algorithms for Hierarchical Clustering.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Batched Dueling Bandits.
Proceedings of the International Conference on Machine Learning, 2022

A Sharp Memory-Regret Trade-off for Multi-Pass Streaming Bandits.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

PAC Top-k Identification under SST in Limited Rounds.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
PySPH: A Python-based Framework for Smoothed Particle Hydrodynamics.
ACM Trans. Math. Softw., 2021

Stochastic Dueling Bandits with Adversarial Corruption.
Proceedings of the Algorithmic Learning Theory, 2021

2020
Choice Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Rank Aggregation from Pairwise Comparisons in the Presence of Adversarial Corruptions.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Stochastic Submodular Cover with Limited Adaptivity.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Accelerated Spectral Ranking.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Peer Prediction with Heterogeneous Users.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Informed Truthfulness in Multi-Task Peer Prediction.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
On Consistent Surrogate Risk Minimization and Property Elicitation.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
GEV-Canonical Regression for Accurate Binary Class Probability Estimation when One Class is Rare.
Proceedings of the 31th International Conference on Machine Learning, 2014


  Loading...