Arpit Agarwal
19 papers · 2014–2026 · 8 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (42) π Academic Marathon Β· Half π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π
Keyword Champion
(7)
ποΈ
Keyword Collector
(90)
π
Conference Pioneer
π₯
Unstoppable Β· Bronze
β
The Questioner
β‘
Prolific Year Β· Productive
π
Century Club Β· Bronze
π
Renaissance Researcher
(7)
Top co-authors
Research topics
Machine Learning
(17)
Optimization & Theory
(12)
Learning Types
(10)
Mathematics & Optimization
(8)
Optimization
(8)
Core Methods
(5)
Artificial Intelligence
(4)
Computer Science
(3)
Data Science & Analytics
(3)
Applications Β· Data Science & Analytics
(3)
Core AI
(3)
Reinforcement Learning
(2)
Application Areas
(2)
Applications Β· Computer Science
(2)
Foundations
(2)
Keywords
pairwise comparison
(7)
dueling bandit
(5)
regret bound
(4)
preference learning
(3)
recommendation system
(3)
multi-armed bandit
(3)
online learning
(3)
online algorithm
(3)
condorcet winner
(2)
streaming algorithm
(2)
bandit algorithm
(2)
bradley-terry-luce model
(2)
query complexity
(2)
reinforcement learning
(2)
rank aggregation
(2)
information theoretic
(1)
regret minimization
(1)
robotic manipulation
(1)
class imbalance
(1)
dynamic regret
(1)
Papers
Finding the Signal in the Spam: Jointly Learning Rewards and Worker Reliability from Pairwise Comparisons
UAI 2026
Learning-Augmented Dynamic Submodular Maximization
NeurIPS 2024
Online Recommendations for Agents with Discounted Adaptive Preferences
ALT 2024
When Can We Track Significant Preference Shifts in Dueling Bandits?
NeurIPS 2023
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
NeurIPS 2022
A Sharp Memory-Regret Trade-off for Multi-Pass Streaming Bandits
COLT 2022
Batched Dueling Bandits
ICML 2022
Diversified Recommendations for Agents with Adaptive Preferences
NeurIPS 2022
PAC Top-k Identification under SST in Limited Rounds
AISTATS 2022
Sublinear Algorithms for Hierarchical Clustering
NeurIPS 2022
Stochastic Dueling Bandits with Adversarial Corruption
ALT 2021
Choice Bandits
NeurIPS 2020
Rank Aggregation from Pairwise Comparisons in the Presence of Adversarial Corruptions
ICML 2020
Model Learning for Look-Ahead Exploration in Continuous Control
AAAI 2019
Accelerated Spectral Ranking
ICML 2018
Reinforcement Learning of Active Vision for Manipulating Objects under Occlusions
CoRL 2018
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons
COLT 2017
On Consistent Surrogate Risk Minimization and Property Elicitation
COLT 2015
GEV-Canonical Regression for Accurate Binary Class Probability Estimation when One Class is Rare
ICML 2014