2 problems

0 votes0 replies0 views
Ma et al.'s conjecture on super-teachability under asymptotic normality
Ma et al.'s conjecture. If the MLE satisfies the asymptotic normality condition, then the estimation problem is super-teachable.
Conjectureopenmaximum-likelihood-estimation statistical-estimation subset-selectionarXiv posted 2 days ago
0 votes0 replies0 views
NP-hardness conjecture for kernel discrepancy subset selection
Kernel discrepancy subset-selection complexity conjecture. The subset selection problem is NP-hard.
Conjectureopencomputational-complexity kernel-methods subset-selectionarXiv posted 2 days ago

Ma et al.'s conjecture on super-teachability under asymptotic normality