scientific article; zbMATH DE number 5957329

MaRDI QIDQ3093345zbMATH OpenFDO

Authors Paul W. Goldberg

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/goldberg06a.html

zbMATH Keywords

computational complexitycomputational learning theorypattern classification

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• PAC learning of probability distributions over a discrete domain.
• PAC analogues of Perceptron and Winnow via boosting the margin
• PAC-learning with approximate predictors
• A PAC approach to application-specific algorithm selection
• A PAC Approach to Application-Specific Algorithm Selection
• An introduction to some statistical aspects of PAC learning theory
• Discriminant Analysis Algorithm Based on a Distance Function and on a Bayesian Decision
• scientific article; zbMATH DE number 7625197

Cited in

(5)

• Discriminative learning can succeed where generative learning fails
• PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
• scientific article; zbMATH DE number 1804110 (Why is no real title available?)
• scientific article; zbMATH DE number 7626788 (Why is no real title available?)
• A PAC Approach to Application-Specific Algorithm Selection

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093345)