Abishek Sankararaman
12 papers · 2020–2026 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🐝 Cross-Pollinator (9) 🌍 Conference Polyglot (4) 🏃 Academic Marathon (5) 🧭 Keyword Pioneer 🌈 Renaissance Researcher (5)
🌍
Conference Polyglot
(4)
🏃
Academic Marathon
(5)
🐝
Cross-Pollinator
(9)
🏆
Keyword Champion
(2)
💎
Century Club
(11)
🗃️
Keyword Collector
(50)
🔥
Unstoppable
(6)
Conferences
ICML (5)
AISTATS (3)
NIPS (2)
AAAI (1)
UAI (1)
Top co-authors
Keywords
online learning
(4)
linear bandit
(2)
multi-armed bandit
(2)
stochastic gradient descent
(2)
robust estimation
(2)
decentralized algorithm
(2)
posterior inference
(1)
bandit feedback
(1)
regret minimization
(1)
logarithmic regret
(1)
price discovery
(1)
parameter estimation
(1)
false positive rate
(1)
hash encoding
(1)
regret bound
(1)
distribution shift
(1)
cumulative regret
(1)
contextual bandit
(1)
adaptive algorithm
(1)
change-point detection
(1)
Papers
Probabilistic Hash Embeddings for Online Learning of Categorical Features
AAAI 2026
SEAD: Unsupervised Ensemble of Streaming Anomaly Detectors
ICML 2025
Online Adaptive Anomaly Thresholding with Confidence Sequences
ICML 2024
Double Auctions with Two-sided Bandit Feedback
NIPS 2023
Online robust non-stationary estimation
NIPS 2023
Online Heavy-tailed Change-point detection
UAI 2023
Breaking the $\sqrtT$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits
ICML 2022
FITNESS: (Fine Tune on New and Similar Samples) to detect anomalies in streams with drift and outliers
ICML 2022
Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits
AISTATS 2021
Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship
AISTATS 2021
Beyond $log^2(T)$ regret for decentralized bandits in matching markets
ICML 2021
The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits
AISTATS 2020