Sampath Kannan

5 papers · 2012–2024 · 5 conferences · across top CS/AI conferences

Achievements

🌍 Conference Polyglot (5) 🏃 Academic Marathon (12) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🐝 Cross-Pollinator (15)

Conferences

ALT (1) CONLL (1) EMNLP (1) ICLR (1) NIPS (1)

Top co-authors

Eshwar Ram Arunachaleswaran (2) Aaron Roth (2) Emily Pitler (2) Mitchell Marcus (2) Jamie H Morgenstern (1) Krishna Acharya (1) Zhiwei Steven Wu (1) Anindya De (1) Bo Waggoner (1) Juba Ziani (1)

Keywords

regret analysis (1) evolutionary trees (1) regret bound (1) greedy algorithm (1) contextual bandit (1) adversarial perturbation (1) smoothed analysis (1) linear contextual bandit (1) tree topology (1) phylogenetic reconstruction (1) ultrametric tree (1) distance-based noise (1)

Papers

Oracle Efficient Algorithms for Groupwise Regret ICLR 2024

Reconstructing Ultrametric Trees from Noisy Experiments ALT 2023

A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem NIPS 2018

Dynamic Programming for Higher Order Parsing of Gap-Minding Trees CONLL 2012

Dynamic Programming for Higher Order Parsing of Gap-Minding Trees EMNLP 2012