We derive general bounds on the complexity of learning in the Statistical Query (SQ) model and in the PAC model with classi cation noise. We do so by considering the problem of boosting the accuracyâ€¦ (More)

In this paper we study learning in the PAC model of Valiant [18] in which the example oracle used for learning may be faulty in one of two ways: either by misclassifying the example or by distortingâ€¦ (More)

We investigate learnability in the PAC model when the data used for learning, attributes and labels, is either corrupted or incomplete. In order to prove our main results, we define a new complexityâ€¦ (More)

We consider the problem of determining the three-dimensional folding of a protein given its one-dimensional amino acid sequence. The model we use is based on the Hydrophobic-Polar (HP) model [2] onâ€¦ (More)

We consider formal models of learning from noisy data. Speciically, we focus on learning in the probability approximately correct model as deened by Valiant. Two of the most widely studied models ofâ€¦ (More)