12 citations · 14 across the 8 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.CG2021
Embeddings and labeling schemes for A*
Talya Eden, Piotr Indyk, Haike Xu
A* is a classic and popular method for graphs search and path finding. It assumes the existence of a heuristic function that estimates the shortest distance from any input…
cs.LG2021
Simple Combinatorial Algorithms for Combinatorial Bandits: Corruptions and Approximations
Haike Xu, Jian Li
We consider the stochastic combinatorial semi-bandit problem with adversarial corruptions. We provide a simple combinatorial algorithm that can achieve a regret of $\tilde{O}\left(…
cs.LG2021★ 12 cited
Fine-Grained Gap-Dependent Bounds for Tabular MDPs via Adaptive Multi-Step Bootstrap
Haike Xu, Tengyu Ma, Simon S. Du
This paper presents a new model-free algorithm for episodic finite-horizon Markov Decision Processes (MDP), Adaptive Multi-step Bootstrap (AMB), which enjoys a stronger gap-depende…