Search Results for author:
Found 4 papers, 1 papers with code
The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
Here, $n$ is the number of arms and $\Delta$ is the reward gap between the best and the second-best arms.
Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions
We present a new approach for solving (minimum disagreement) correlation clustering that results in sublinear algorithms with highly efficient time and space complexity for this problem.
Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits
In particular, algorithms with optimal sample complexity (number of coin tosses) have been known for this problem for quite some time.
Sublinear Algorithms for $(Δ+ 1)$ Vertex Coloring
Any graph with maximum degree $\Delta$ admits a proper vertex coloring with $\Delta + 1$ colors that can be found via a simple sequential greedy algorithm in linear time and space.
Data Structures and Algorithms
