Mingda Qiao

activity

20162022

most citedOn Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning

30 citations · 97 across the 13 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2022

Online Pen Testing

Mingda Qiao, Gregory Valiant

We study a "pen testing" problem, in which we are given $n$ pens with unknown amounts of ink $X_{1}, X_{2}, \dots, X_{n}$ , and we want to choose a pen with the maximum amount of remaini…

cs.DS2022

Open Problem: Properly learning decision trees in polynomial time?

Guy Blanc, Jane Lange, Mingda Qiao +1

The authors recently gave an $n^{O (l o g l o g n)}$ time membership query algorithm for properly learning decision trees under the uniform distribution (Blanc et al., 2021). The previ…

cs.DS2021

Properly learning decision trees in almost polynomial time

Guy Blanc, Jane Lange, Mingda Qiao +1

We give an $n^{O (l o g l o g n)}$ -time membership query algorithm for properly and agnostically learning decision trees under the uniform distribution over ${\pm 1}^{n}$ . Even in the…