| On generalization error bounds of noisy gradient methods for non-convex learning J Li, X Luo, M Qiao arXiv preprint arXiv:1902.00621, 2019 | 61 | 2019 |
| Nearly instance optimal sample complexity bounds for top-k arm selection L Chen, J Li, M Qiao Artificial Intelligence and Statistics, 101-110, 2017 | 57 | 2017 |
| Towards instance optimal bounds for best arm identification L Chen, J Li, M Qiao Conference on Learning Theory, 535-592, 2017 | 49 | 2017 |
| 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 | 46 | 2017 |
| Collaborative PAC learning A Blum, N Haghtalab, AD Procaccia, M Qiao Advances in Neural Information Processing Systems 30, 2017 | 41 | 2017 |
| Learning discrete distributions from untrusted batches M Qiao, G Valiant arXiv preprint arXiv:1711.08113, 2017 | 39 | 2017 |
| Low-distortion social welfare functions G Benade, AD Procaccia, M Qiao Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1788-1795, 2019 | 18 | 2019 |
| Do Outliers Ruin Collaboration? M Qiao International Conference on Machine Learning, 4180-4187, 2018 | 14 | 2018 |
| Practical algorithms for best-k identification in multi-armed bandits H Jiang, J Li, M Qiao arXiv preprint arXiv:1705.06894, 2017 | 10 | 2017 |
| Properly learning decision trees in almost polynomial time G Blanc, J Lange, M Qiao, LY Tan Journal of the ACM 69 (6), 1-19, 2022 | 9 | 2022 |
| A theory of selective prediction M Qiao, G Valiant Conference on Learning Theory, 2580-2594, 2019 | 5 | 2019 |
| Stronger calibration lower bounds via sidestepping M Qiao, G Valiant Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 3 | 2021 |
| Online Pen Testing M Qiao, G Valiant arXiv preprint arXiv:2210.00655, 2022 | 1 | 2022 |
| A Fourier Approach to Mixture Learning M Qiao, G Guruganesh, A Rawat, KA Dubey, M Zaheer Advances in Neural Information Processing Systems 35, 20850-20861, 2022 | | 2022 |
| Open Problem: Properly learning decision trees in polynomial time? G Blanc, J Lange, M Qiao, LY Tan Conference on Learning Theory, 5619-5623, 2022 | | 2022 |
| Exponential Weights Algorithms for Selective Learning M Qiao, G Valiant Conference on Learning Theory, 3833-3858, 2021 | | 2021 |
| Decision tree heuristics can fail, even in the smoothed setting G Blanc, J Lange, M Qiao, LY Tan arXiv preprint arXiv:2107.00819, 2021 | | 2021 |
