Follow
Mingda Qiao
Title
Cited by
Cited by
Year
On generalization error bounds of noisy gradient methods for non-convex learning
J Li, X Luo, M Qiao
arXiv preprint arXiv:1902.00621, 2019
752019
Nearly instance optimal sample complexity bounds for top-k arm selection
L Chen, J Li, M Qiao
Artificial Intelligence and Statistics, 101-110, 2017
712017
Towards instance optimal bounds for best arm identification
L Chen, J Li, M Qiao
Conference on Learning Theory, 535-592, 2017
642017
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
562017
Collaborative PAC learning
A Blum, N Haghtalab, AD Procaccia, M Qiao
Advances in Neural Information Processing Systems 30, 2017
532017
Learning discrete distributions from untrusted batches
M Qiao, G Valiant
arXiv preprint arXiv:1711.08113, 2017
452017
Low-distortion social welfare functions
G Benade, AD Procaccia, M Qiao
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1788-1795, 2019
212019
Do Outliers Ruin Collaboration?
M Qiao
International Conference on Machine Learning, 4180-4187, 2018
172018
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
152022
Practical algorithms for best-k identification in multi-armed bandits
H Jiang, J Li, M Qiao
arXiv preprint arXiv:1705.06894, 2017
142017
Stronger calibration lower bounds via sidestepping
M Qiao, G Valiant
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
122021
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
62022
Decision tree heuristics can fail, even in the smoothed setting
G Blanc, J Lange, M Qiao, LY Tan
arXiv preprint arXiv:2107.00819, 2021
62021
A theory of selective prediction
M Qiao, G Valiant
Conference on Learning Theory, 2580-2594, 2019
62019
Online pen testing
M Qiao, G Valiant
arXiv preprint arXiv:2210.00655, 2022
42022
Open Problem: Properly learning decision trees in polynomial time?
G Blanc, J Lange, M Qiao, LY Tan
Conference on Learning Theory, 5619-5623, 2022
12022
Exponential Weights Algorithms for Selective Learning
M Qiao, G Valiant
Conference on Learning Theory, 3833-3858, 2021
12021
Platforms for Efficient and Incentive-Aware Collaboration
N Haghtalab, M Qiao, K Yang
arXiv preprint arXiv:2402.15169, 2024
2024
Collaborative Learning with Different Labeling Functions
Y Deng, M Qiao
arXiv preprint arXiv:2402.10445, 2024
2024
On the Distance from Calibration in Sequential Prediction
M Qiao, L Zheng
arXiv preprint arXiv:2402.07458, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20