Mingda Qiao
Mingda Qiao
Verified email at stanford.edu - Homepage
Title
Cited by
Cited by
Year
Nearly instance optimal sample complexity bounds for top-k arm selection
L Chen, J Li, M Qiao
Artificial Intelligence and Statistics, 101-110, 2017
392017
Nearly optimal sampling algorithms for combinatorial pure exploration
L Chen, A Gupta, J Li, M Qiao, R Wang
Conference on Learning Theory, 482-534, 2017
342017
Towards instance optimal bounds for best arm identification
L Chen, J Li, M Qiao
Conference on Learning Theory, 535-592, 2017
252017
Collaborative PAC learning
A Blum, N Haghtalab, AD Procaccia, M Qiao
NIPS 2017, 2017
222017
On generalization error bounds of noisy gradient methods for non-convex learning
J Li, X Luo, M Qiao
arXiv preprint arXiv:1902.00621, 2019
212019
Learning discrete distributions from untrusted batches
M Qiao, G Valiant
arXiv preprint arXiv:1711.08113, 2017
152017
Low-distortion social welfare functions
G Benade, AD Procaccia, M Qiao
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1788-1795, 2019
142019
Practical algorithms for best-k identification in multi-armed bandits
H Jiang, J Li, M Qiao
arXiv preprint arXiv:1705.06894, 2017
92017
Do Outliers Ruin Collaboration?
M Qiao
International Conference on Machine Learning, 4180-4187, 2018
72018
A theory of selective prediction
M Qiao, G Valiant
Conference on Learning Theory, 2580-2594, 2019
12019
Stronger calibration lower bounds via sidestepping
M Qiao, G Valiant
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–11