On the Value of Partial Information for Learning from Examples
Authors:
- Joel RatsabyJRJoel Ratsaby
- Vitaly MaiorovVMVitaly Maiorov
- 1 December 1997
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 13 (4) , 509-544
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Neural Network Exploration Using Optimal Experiment DesignNeural Networks, 1996
- Learning by canonical smooth estimation. I. Simultaneous estimationIEEE Transactions on Automatic Control, 1996
- Probabilistic and Average Linear Widths inL∞-Norm with Respect tor-fold Wiener MeasureJournal of Approximation Theory, 1996
- Machines that Learn from HintsScientific American, 1995
- Hints and the VC DimensionNeural Computation, 1993
- Decision theoretic generalizations of the PAC model for neural net and other learning applicationsInformation and Computation, 1992
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- A theory of the learnableCommunications of the ACM, 1984
- Lower bounds for approximation by nonlinear manifoldsTransactions of the American Mathematical Society, 1968
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963