The basic problem in the PAC model of computational learning theory is to determine which hypothesis classes are effficiently learnable. There is presently a dearth of results showing hardness of learning problems. Moreover, the existing lower bounds fall short of the best known algorithms.
No takes yet. Share an insight, caveat, or question.
Daniely et al. (2014) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: