On the value of partial information for learning from examples
From MaRDI portal
Recommendations
- Learning from examples with information theoretic criteria
- A survey on recent results on partial learning
- Learning with incomplete information and the mathematical structure behind it
- Learning in the presence of partial explanations
- General bounds on the number of examples needed for learning probabilistic concepts
- Intrinsic complexity of partial learning
- Intrinsic complexity of partial learning
- Learning and total evidence with imprecise probabilities
- On the information content of partial observations
Cites work
- scientific article; zbMATH DE number 4157187 (Why is no real title available?)
- scientific article; zbMATH DE number 4088698 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 3504209 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 4001210 (Why is no real title available?)
- scientific article; zbMATH DE number 835699 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 3250960 (Why is no real title available?)
- A theory of the learnable
- Convergence of stochastic processes
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Fat-shattering and the learnability of real-valued functions
- Learnability and the Vapnik-Chervonenkis dimension
- Learning by canonical smooth estimation. I. Simultaneous estimation
- Learning from hints in neural networks
- Lower Bounds for Approximation by Nonlinear Manifolds
- Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
- On best approximation by ridge functions
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the degree of approximation by manifolds of finite pseudo-dimension
- Probabilistic and average linear width in \(L_ \infty\)-norm with respect to \(r\)-fold Wiener measure
- Probability Inequalities for Sums of Bounded Random Variables
- Scale-sensitive dimensions, uniform convergence, and learnability
Cited in
(12)- Approximation of Sobolev-type classes with quasi-seminorms
- On the orders of nonlinear approximations for classes of functions of given form
- Learning in the presence of partial explanations
- The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension
- Continuous algorithms in \(n\)-term approximation and nonlinear widths
- Learning with side information: PAC learning bounds
- Nonlinear approximation of functions by sets of finite pseudo-dimension in the probabilistic and average case settings
- Some problems in the theory of ridge functions
- Approximation by neural networks and learning theory
- A FOIL-Like Method for Learning under Incompleteness and Vagueness
- Learning with prior information
- Approximation in shift-invariant spaces with deep ReLU neural networks
This page was built for publication: On the value of partial information for learning from examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383444)
