17 citations · 24 across the 3 of their papers we have counts for
5 papers
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators
Lijie Chen, Ofer Grossman
We develop techniques to prove lower bounds for the BCAST(log n) Broadcast Congested Clique model (a distributed message passing model where in each round, each processor can broad…
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
Lijie Chen, Anupam Gupta, Jian Li +2
We study the combinatorial pure exploration problem Best-Set in stochastic multi-armed bandits. In a Best-Set instance, we are given arms with unknown reward distributions, as…
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection
Lijie Chen, Jian Li, Mingda Qiao
In the Best--Arm problem, we are given stochastic bandit arms, each associated with an unknown reward distribution. We are required to identify the arms with the largest…
Pure Exploration of Multi-armed Bandit Under Matroid Constraints
Lijie Chen, Anupam Gupta, Jian Li
We study the pure exploration problem subject to a matroid constraint (Best-Basis) in a stochastic multi-armed bandit game. In a Best-Basis instance, we are given stochastic ar…
A Note on Oracle Separations for BQP
Lijie Chen
In 2009, using the problem, Aaronson claimed to construct the relativized worlds such that and $\textsf{B…