Sepehr Assadi
7 papers · 2017–2024 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Conference Polyglot (3) π Academic Marathon (7) π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (12) π§ Keyword Pioneer
π£
Hot Topic Early Bird
π
Cross-Pollinator
(15)
Conferences
COLT (3)
NIPS (3)
ICML (1)
Top co-authors
Keywords
streaming algorithm
(4)
multi-armed bandit
(3)
approximation algorithm
(2)
sample complexity
(2)
lower bound
(2)
correlation clustering
(1)
online algorithm
(1)
pairwise comparison
(1)
distributed algorithm
(1)
secretary problem
(1)
pure exploration
(1)
parallel computation
(1)
graph stream
(1)
sublinear space
(1)
random order
(1)
cut sparsifier
(1)
space lower bound
(1)
composable coreset
(1)
instance-sensitive complexity
(1)
kendall-tau distance
(1)
Papers
The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
COLT 2024
Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost
NIPS 2023
Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity
NIPS 2022
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds
COLT 2022
Distributed Weighted Matching via Randomized Composable Coresets
ICML 2019
Secretary Ranking with Minimal Inversions
NIPS 2019
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons
COLT 2017