Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning

Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference

Volumn , Issue , 2009, Pages 1313-1320

  Rahimi, Ali ^a   Recht, Benjamin ^b  

^a INTEL RESEARCH   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); STATISTICAL TESTS; TEACHING;

CLASSIFICATION PERFORMANCE; CONCENTRATION OF MEASURE; CONDITION; MINIMISATION; NEURAL-NETWORKS; RANDOM NETWORK; RANDOMISATION; TEACHERS'; TEST ERRORS; WEIGHTED SUM;

PERSONAL COMPUTING;

EID: 78149297677     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. H. D. Block. The perceptron: a model for brain functioning. Review of modern physics, 34:123-135, January 1962.
2. Y. Amit and D. Geman. Shape quantization and recognition with randomized trees. Neural Computation, 9(7):1545-1588, 1997. (Pubitemid 127462804)
3. F. Moosmann, B. Triggs, and F. Jurie. Randomized clustering forests for building fast and discriminative visual vocabularies. In Advances in Neural Information Processing Systems (NIPS), 2006.
4. A. Rahimi and B. Recht. Random features for large-scale kernel machines. In Advances in Neural Information Processing Systems (NIPS), 2007.
5. W. Maass and H. Markram. On the computational power of circuits of spiking neurons. Journal of Computer and System Sciences, 69:593-616, December 2004.
6. E. Osuna, R. Freund, and F. Girosi. Training support vector machines: an application to face detection. In Computer Vision and Pattern Recognition (CVPR), 1997.
7. R. E. Schapire. The boosting approach to machine learning: An overview. In D. D. Denison, M. H. Hansen, C. Holmes, B. Mallick, and B. Yu, editors, Nonlinear Estimation and Classification. Springer, 2003.
8. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: a statistical view of boosting. Technical report, Dept. of Statistics, Stanford University, 1998.
9. L. K. Jones. A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training. The Annals of Statistics, 20(1):608-613, March 1992.
10. R. Rifkin, G. Yeo, and T. Poggio. Regularized least squares classification. Advances in Learning Theory: Methods, Model and Applications, NATO Science Series III: Computer and Systems Sciences, 190, 2003.
11. A.R. Barron. Universal approximation bounds for superpositions of a sigmoidal function. IEEE Transactions on Information Theory, 39:930-945, May 1993.
12. P. L. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research (JMLR), 3:463-482, 2002.
13. F. Girosi. Approximation error bounds that use VC-bounds. In International Conference on Neural Networks, pages 295-302, 1995.
14. G. Gnecco and M. Sanguineti. Approximation error bounds via Rademacher's complexity. Applied Mathematical Sciences, 2(4):153-176, 2008.