PAC-learning with approximate predictors
From MaRDI portal
Recommendations
- Publication:4714286
- A generalized model of PAC learning and its applicability
- scientific article; zbMATH DE number 2089366
- Exploring learnability between exact and PAC
- The optimal sample complexity of PAC learning
- An introduction to some statistical aspects of PAC learning theory
- PAC learning under helpful distributions
- scientific article; zbMATH DE number 1104347
- PAC-learning from general examples
Cites work
- 10.1162/153244303321897690
- A discriminative model for semi-supervised learning
- A survey on semi-supervised learning
- Benign overfitting in linear regression
- Foundations of machine learning
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 6982943 (Why is no real title available?)
- scientific article; zbMATH DE number 7559867 (Why is no real title available?)
- scientific article; zbMATH DE number 7064043 (Why is no real title available?)
- Local Rademacher complexities
- Proximité et dualité dans un espace hilbertien
- Sensitivity-informed provable pruning of neural networks
- Size-independent sample complexity of neural networks
- Stochastic Markov gradient descent and training low-bit neural networks
- The geometry of hypothesis testing over convex cones: generalized likelihood ratio tests and minimax radii
Cited in
(5)- Can PAC learning algorithms tolerate random attribute noise?
- scientific article; zbMATH DE number 5957329 (Why is no real title available?)
- scientific article; zbMATH DE number 1104347 (Why is no real title available?)
- PAC learning with simple examples
- scientific article; zbMATH DE number 7272386 (Why is no real title available?)
This page was built for publication: PAC-learning with approximate predictors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103580)