On learning functions from noise-free and noisy samples via Occam's razor

SIAM Journal on Computing

Volumn 29, Issue 3, 2000, Pages 712-727

  Natarajan, B ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Noisy data; Probably approximate learning

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; FUNCTIONS; INTERPOLATION; SAMPLING; SET THEORY; SIGNAL PROCESSING; SPURIOUS SIGNAL NOISE;

LEARNING FUNCTIONS; NOISY SAMPLES; OCCAM APPROXIMATION; OCCAM RAZOR;

APPROXIMATION THEORY;

EID: 0033296769     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794277111     Document Type: Article

References (29)

1. N. ALON, S. BEN-DAVID, N. CESA-BIANCHI, AND D. HAUSSLER, Scale-sensitive dimensions, uniform convergence and learnability, in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1993, pp. 292-301.
2. D. ANGLUIN AND P. LAIRD, Learning from noisy examples, Mach. Learning, 2 (1988), pp. 319-342.
3. M. ANTHONY AND N. BIGGS, Computational Learning Theory: An Introduction, Cambridge University Press, London, UK, 1992.
4. M. ANTHONY, P. L BARTLETT, Y. ISHAI, AND J. SHAWE-TAYLOR, Valid generalization from approximate interpolation, Combin. Probab. Comput., 5 (1996), pp. 191-214.
5. S. AR, R. LIPTON, R. RUBENFELD, AND M. SUDAN, Reconstructing algebraic functions from mixed data, in Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1992, pp. 503-511.
6. P. L. BARTLETT, P. M. LONG, AND R. C. WILLIAMSON, Fat shattering and the learnability of real-valued functions, in Proceedings of the 7th ACM Symposium on Computer Learning Theory, New Brunswick, NJ, 1994, pp. 299-310.
7. M. BEN-OR AND P. TIWARI, A deterministic algorithm for sparse multivariate polynomial interpolation, in Proceedings of the 20th ACM Symposium on Theory of Computing, 1988, pp. 394-398.
8. E. BERLEKAMP AND L. WELCH, Error Correction of Algebraic Block Codes, U.S. Patent 4,633,470, 1970.
9. A. BLUMER, A. EHRENFEUCHT, D. HAUSSLER, AND M. WARMUTH, Learnability and the Vapnik-Chervonenkis dimension, J. ACM, 36 (1991), pp. 929-965.
10. W. FELLER, An Introduction to Probability Theory and its Applications, Vol. II, John Wiley, New York, 1966.
11. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, Johns Hopkins Press, Baltimore, MD, 1983.
12. D. Y. GRIGORIEV, M. KARPINSKI, AND M. F. SINGER, Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields, SIAM J. Comput., 19 (1990), pp. 1059-1063.
13. D. HAUSSLER, Generalizing the PAC model for neural net and other learning applications, Inform. and Comput., 100 (1992), pp. 78-150.
14. D. HAUSSLER AND P. LONG, A Generalization of Sauer's Lemma, Tech. Report UCSC-CRL-90-15, University of California, Santa Cruz, CA, 1990.
15. H. IMAI AND M. IRI, An optimal algorithm for approximating a piecewise linear function, J. Inform. Processing, 9 (1986), pp. 159-162.
16. A. H. JAZWINSKI, Stochastic Processes and Filtering Theory, Academic Press, New York, 1970.
17. M. KEARNS AND M. LI, Learning in the presence of malicious errors, SIAM J. Comput., 22 (1993), pp. 807-837.
18. M. KEARNS AND R. E. SCHAPIRE, Efficient distribution-free learning of probabilistic concepts, in Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1990, pp. 382-391.
19. V. KRISHNAN, Non-Linear Filtering and Smoothing, John Wiley, New York, 1984.
20. B. K. NATARAJAN, On learning sets and functions, Mach. Learning, 4 (1989), pp. 67-97.
21. B. K. NATARAJAN, Machine Learning: A Theoretical Approach, Morgan Kaufmann, San Mateo, CA, 1991.
22. B. K. NATARAJAN, Occam's razor for functions, in Proceedings of the Sixth ACM Symposium on Computer Learning Theory, 1993, pp. 370-376.
23. B. K. NATARAJAN, Filtering random noise from deterministic signals via data compression, IEEE Trans. Signal Processing, (Nov., 1995).
24. A. V. OPPENHEIM AND R. SCHAFER, Digital Signal Processing, Prentice-Hall, Englewood Cliffs, NJ, 1974.
25. A. PAPOULIS, Probability, Random Variables and Stochastic Processes, McGraw-Hill, New York, 1965.
26. D. POLLARD, Convergence of Stochastic Processes, Springer-Verlag, New York, 1984.
27. R. SLOAN, Types of noise in data for concept learning, in Proceedings of the Workshop on Computational Learning Theory, 1988, pp. 91-96.
28. S. SURI, On some link distance problems in a simple polygon, IEEE Trans. Robotics Automation, 6 (1988), pp. 108-113.
29. V. N. VAPNIK AND A. Y. CHERVONENKIS, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl., 16 (1970), pp. 264-280.