Mingda Qiao

Orcid: 0000-0002-9182-6152

According to our database1, Mingda Qiao authored at least 21 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Platforms for Efficient and Incentive-Aware Collaboration.
CoRR, 2024

Collaborative Learning with Different Labeling Functions.
CoRR, 2024

On the Distance from Calibration in Sequential Prediction.
CoRR, 2024

A Combinatorial Approach to Robust PCA.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Online Pen Testing.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Properly Learning Decision Trees in almost Polynomial Time.
J. ACM, 2022

Open Problem: Properly learning decision trees in polynomial time?
CoRR, 2022

A Fourier Approach to Mixture Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Stronger calibration lower bounds via sidestepping.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Exponential Weights Algorithms for Selective Learning.
Proceedings of the Conference on Learning Theory, 2021

Decision Tree Heuristics Can Fail, Even in the Smoothed Setting.
Proceedings of the Approximation, 2021

2020
On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning.
Proceedings of the 8th International Conference on Learning Representations, 2020

2019
A Theory of Selective Prediction.
Proceedings of the Conference on Learning Theory, 2019

Low-Distortion Social Welfare Functions.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Learning Discrete Distributions from Untrusted Batches.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Do Outliers Ruin Collaboration?
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Practical Algorithms for Best-K Identification in Multi-Armed Bandits.
CoRR, 2017

Collaborative PAC Learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Towards Instance Optimal Bounds for Best Arm Identification.
Proceedings of the 30th Conference on Learning Theory, 2017

Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration.
Proceedings of the 30th Conference on Learning Theory, 2017

Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017


  Loading...