Approximation and learning of convex superpositions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 904, Issue , 1995, Pages 222-236

  Gurvits, Leonid ^a   Koiran, Pascal ^b  

^a SIEMENS CORPORATE RESEARCH   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CLOSURE PROPERTY; CONTINUOUS NEURAL NETWORKS; GENERAL METHOD; INTEGRAL REPRESENTATION; NEURAL NETWORKS WITH ONE HIDDEN LAYER; REAL-VALUED FUNCTIONS; THRESHOLD FUNCTIONS; VAPNIK-CHERVONENKIS DIMENSIONS;

MULTILAYER NEURAL NETWORKS;

EID: 84955611223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59119-2_180     Document Type: Conference Paper

References (16)

1. N. Alon, S. Ben-David, N. Cesa-Bianehi, and D. Haussler. Scale-sensitive dimensions, uniform convergence, and learnability. In Proc. 3Jth IEEE Syrup. on Foundations of Computer Science, pages 292-301, 1993.
2. A. Barton. Neural net approximation. In Proc. 7th Yale Workshop on Adaptative and Learning Systems. 1992.
3. A. Barton. Universal approximation bounds for superpositions of a sigmoidal function. IEEE Transactions on Information Theory, 39(3):930-945, May 1993.
4. P. Bartlett, P. Long, and R. Willlamson. Fat-shatterlng and the learnabillty of real valued functions. In Proc. 7th Annual ACM Conference on Computational Learning Theory, pages 299-310, 1994.
5. E.B. Bantu and D. Haussler. What size net gives valide generalization ? Neural Computation, 1:151-160, 1989.
6. A. Blamer, A Ehrenfeucht, D. Hanssler, and M. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the A CM, 36(4):929-965, 1990.
7. C. Darken, M. Donahue, L. Gurvits, and E. Sontag. Rates of convex approximations in non-l:filbert spaces. Technical Report. 1251, Insitute for Mathematics and its applications, University of Minnesota, Minneapolis, Minnesota 55455, September 1994.
8. R. M. Dudley. Universal Donsker classes and metric entropy. Annals of Probability, 15(4):1306-1326, 1987.
9. D. Haussler. Decision theoretic generalizations of the PAC model for neural nets and other learning applications. Information and Uomputation, (100):78-150, 1992.
10. M. Keaxns and R. Schapite. Efficient distribution-freee learning of probabmstic concepts. Journal of Computer and System Sciences, 48(3):464-497, 1994.
11. M. Laskowsld. Vapnik-Chervonenkis classes of definable sets. 3. London. Math. Soc., 45(2):377-384, 1992.
12. M. Ledoux and M. Talagrand. Probability in Banach Spaces. Springer Verlag, 1991.
13. D. Nolan and D. Pollard. U-processes: Rates of convergence. Annals of Statistics, 15(2):780-799, 1987.
14. R. Phelps. Lectures on Choquet's Theorem. Van Nostrand Mathematical Studies. D. Van Nostrand Company, 1966.
15. D. Pollard. Convergence of Stochastic Processes. Springer Verlag, 1984.
16. V. Vapnik. Estimation of dependences based on empirical data. Springer Series in Statistics. Springer-Verlag, 1982.