30 citations · 97 across the 13 of their papers we have counts for
Showing 2022Show 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 pens with unknown amounts of ink , and we want to choose a pen with the maximum amount of remaini…
cs.LG2022
A Fourier Approach to Mixture Learning
Mingda Qiao, Guru Guruganesh, Ankit Singh Rawat +2
We revisit the problem of learning mixtures of spherical Gaussians. Given samples from mixture , the goal is to estimate the means $…
cs.DS2022
Open Problem: Properly learning decision trees in polynomial time?
Guy Blanc, Jane Lange, Mingda Qiao +1
The authors recently gave an time membership query algorithm for properly learning decision trees under the uniform distribution (Blanc et al., 2021). The previ…