1 citations · 1 across the 7 of their papers we have counts for
7 papers
Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
Yuchen He, Tianhui Jiang, Sihan Wang +1
We develop a discrete optimal transport framework for analyzing simulated annealing algorithms on finite state spaces. Building on the discrete Wasserstein metric introduced by Maa…
Improved sampling algorithms and functional inequalities for non-log-concave distributions
Yuchen He, Zhehan Lei, Jianan Shao +1
We study the problem of sampling from a distribution with density for some potential function with query access to and $\nabla…
On the Problem of Best Arm Retention
Houshuang Chen, Yuchen He, Chihao Zhang
This paper presents a comprehensive study on the problem of Best Arm Retention (BAR), which has recently found applications in streaming algorithms for multi-armed bandits. In the…
On the query complexity of sampling from non-log-concave distributions
Yuchen He, Chihao Zhang
We study the problem of sampling from a -dimensional distribution with density , which does not necessarily satisfy good isoperimetric conditions. Specifi…
Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
Yuchen He, Zichun Ye, Chihao Zhang
We study the stochastic multi-armed bandit problem in the -pass streaming model. In this problem, the arms are present in a stream and at most arms and their statistic…
On Interpolating Experts and Multi-Armed Bandits
Houshuang Chen, Yuchen He, Chihao Zhang
Learning with expert advice and multi-armed bandit are two classic online decision problems which differ on how the information is observed in each round of the game. We study a fa…
Improved Algorithms for Bandit with Graph Feedback via Regret Decomposition
Yuchen He, Chihao Zhang
The problem of bandit with graph feedback generalizes both the multi-armed bandit (MAB) problem and the learning with expert advice problem by encoding in a directed graph how the…