17 citations · 41 across the 4 of their papers we have counts for
4 papers
Learning Discrete Distributions from Untrusted Batches
Mingda Qiao, Gregory Valiant
We consider the problem of learning a discrete distribution in the presence of an fraction of malicious data sources. Specifically, we consider the setting where there is some…
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…
Practical Algorithms for Best-K Identification in Multi-Armed Bandits
Haotian Jiang, Jian Li, Mingda Qiao
In the Best- identification problem (Best--Arm), we are given stochastic bandit arms with unknown reward distributions. Our goal is to identify the arms with the larg…
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…