Finite sample performance guarantees of fusers for function estimators

Information Fusion

Volumn 1, Issue 1, 2000, Pages 35-44

  Rao, Nageswara S V ^a  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

Function estimation; Multiple model; PAC learning; Sample size estimation

Indexed keywords

EID: 0034216174     PISSN: 15662535     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1566-2535(00)00004-X     Document Type: Article

References (46)

1. M.A. Abidi, R.C. Gonzalez, Data Fusion in Robotics and Machine Intelligence, Academic Press, New York, 1992.
2. M.A. Aizerman, E.M. Braverman, L.I. Rozonoer, Extrapolative problems in automatic control and method of potential functions, American Mathematical Society Translations 87 (1970) 281-303.
3. N. Alon, S. Ben-David, N. Cesa-Bianchi, D. Hausler, Scale-sensitive dimensions, uniform convergence, and learnability, in: Proceedings of the 1993 IEEE Symposium on Foundations of Computer Science, 1993.
4. P.L. Bartlett, The Sample Complexity of Pattern Classification with Neural Networks: The Sample Size of the Weights is More Important than the Size of the Network, Technical report, Department of Systems Engineering, Australian National University, 1996.
5. J.M. Bates, C.W.J. Granger, The combination of forecasts, Operations Research Quarterly 20 (1969) 451-468.
6. L. Brieman, Stacked regressions, Machine Learning 24 (1) (1996) 49-64.
7. N. Cesa-Bianchi, Y. Fruend, D.P. Helmbold, D. Haussler, R.E. Schipire, M.K. Warmuth, How to use expert advice, in: Proceedings of the Twenty-fifth Annual ACM Symposium on the Theory of Computing (1993) 382-391.
8. N. Cesa-Bianchi, Y. Fruend, D.P. Helmbold, M.K. Warmuth, On-line prediction and conversion strategies, Machine Learning 25 (1996) 71-110.
9. T. Cover, Geometric and statistical properties of systems of linear inequalities with application in pattern recognition, IEEE Trans. on Electronic Comput. EC-14 (1965) 326-334.
10. B.V. Dasarathy, Decision Fusion, IEEE Computer Society Press, Los Alamitos, California, 1994.
11. P.S. deLaplace, Deuxième Supplément à la Théorie Analytique des Probabilités, 1818, Reprinted (1847) in Oeuvres Complètes de Laplace, vol. 7, Paris, Gauthier-Villars, pp. 531-580.
12. D.P. Foster, R.V. Vohra, A randomization rule for selecting forecasts, Operations Research 41 (4) (1993) 704-709.
13. Y. Freund, Boosting a weak learning algorithm by majority, Information and Computation 121 (1995) 256-285.
14. Y. Freund, R.E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, in: Proceedings of Second European Conference on Computational Learning Theory, 1995, pp. 23-37.
15. P.W. Goldberg, M.R. Jerrum, Bounding the Vapnik-Chervonenkis dimension of concept classes parametrized by real numbers, Machine Learning 18 (1995) 131-148.
16. S. Hashem, Optimal linear combinations of neural networks, Neural Networks 10 (4) (1997) 599-614.
17. D. Haussler, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Information and Computation 100 (1992) 78-150.
18. D. Haussler, J. Kivinen, M.K. Warmuth, Tight worst-case loss bounds for predicting with expert advice, in: Proceedings of Second European Conference on Computational Learning Theory, 1995, pp. 69-83.
19. A. Juditsky, A. Nemirovski, Functional Aggregation for Nonparametric Estimation, Publication Interne, IRISA, 993, 1996.
20. M. Karpinski, A. Macintyre, Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks, J. Comput. and Syst. Sci. 54 (1997) 169-176.
21. M.J. Kearns, H.S. Seung, Learning from a population of hypotheses, Machine Learning 18 (1995) 255-276.
22. J. Kivinen, M.K. Warmuth, Using experts for predicting continous outcomes, in: Computational Learning Theory: Euro-COLT'93, 1993, pp. 109-120.
23. A. Krzyzak, T. Linder, G. Lugosi, Nonparametric estimation and classification using radial basis function nets and empirical risk minimization, IEEE Trans. on Neural Networks 7 (2) (1996) 475-487.
24. W.S. Lee, Agnostic Learning and Single Hidden Layer Neural Networks, Ph.D. thesis, Australian National University, 1996.
25. N. Littlestone, M.K. Warmuth, The weighted majority algorithm, Information and Computation 108 (2) (1994) 212-261.
26. L. Ljung, System Identification, Prentice Hall, Engelwood Cliffs, NJ, 1987.
27. G. Lugosi, K. Zeger, Nonparametric estimation via empirical risk minimization, IEEE Trans. on Inform. Theory 41 (3) (1995) 677-687.
28. R.N. Madan, N.S.V. Rao, Guest editorial on information/decision fusion with engineering applications, J. Franklin Inst. 336B (2) (1999) 199-204.
29. D. Nolan, D. Pollard, U-processes: Rates of convergence, Ann. Stat. 15 (2) (1987) 780-799.
30. D. Pollard, Convergence of Stochastic Processes, Springer, New York, 1984.
31. D. Pollard, Asyptotics via empirical processes (with discussion), Statistical Science 4 (1989) 341-366.
32. B.L.S. Prakasa Rao, Nonparametric Functional Estimation, Academic Press, New York, 1983.
33. N.S.V. Rao, Fusion methods for multiple sensor systems with unknown error densities, J. Franklin Inst. 331B (5) (1994) 509-530.
34. N.S.V. Rao, Fusion methods in multiple sensor systems using feedforward neural networks, Intell. Automat. Soft Comput. 5 (1) (1998) 21-30.
35. N.S.V. Rao, Simple sample bound for feedforward sigmoid networks with bounded weights, Neurocomputing 29 (1999).
36. N.S.V. Rao, E.M. Oblow, C.W. Glover, G.E. Liepins, N-learners problem: Fusion of concepts, IEEE Trans. on Syst. Man and Cybernet. 24 (2) (1994) 319-327.
37. N.S.V. Rao, V. Protopopescu, Function estimation by feedforward sigmoidal networks with bounded weights, Neural Process. Lett. 7 (1998) 125-131.
38. V. RoychowdhuryK. Siu, A. Orlitsky, Theoretical Advances in Neural Computation and Learning, Kluwer Academic Publishers, Boston, 1994.
39. R.E. Schapire, The strength of weak learnability, Machine Learning 5 (1990) 197-227.
40. L.G. Valiant, A theory of the learnable, Commun. ACM 27 (11) (1984) 1134-1142.
41. V. Vapnik, Estimation of Dependences Based on Empirical Data, Springer, New York, 1982.
42. V.N. Vapnik, The Nature of Statistical Learning Theory, Springer, New York, 1995.
43. M. Vidyasagar, A Theory of Learning and Generalization, Springer, New York, 1997.
44. J. von Neumann, Probabilistic logics and the synthesis of reliable organisms from unreliable components, in: C.E. Shannon, J. McCarthy (Eds.), Automata Studies, Princeton University Press, Princeton, 1956, pp. 43-98.
45. V.G. Vovk, Aggregating strategies, in: Proceedings of Workshop on Computational Learning Theory, 1990, pp. 371-383.
46. Y. Yang, Aggregating Regression Procedures for a Better Performance, Technical Report 17, Department of Statistics, Iowa State University, 1999.