Links between Perceptrons, MLPs and SVMs

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 177-184

  Collobert, Ronan ^a   Bengio, Samy ^a  

^a IDIAP RESEARCH INSTITUTE   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BACKPROPAGATION; CLASSIFICATION (OF INFORMATION); COMPUTATIONAL METHODS; CONSTRAINT THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION;

MULTI-LAYER PERCEPTION (MLP); SUPPORT VECTOR PERCEPTRONS (SVP); TRAINING ALGORITHMS; WEIGHT DECAY;

NEURAL NETWORKS;

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

References (19)

1. Auer, P., Burgsteiner, H., & Maass, W. (2002). Reducing communication for distributed learning in neural networks. ICANN'2002 (pp. 123-128). Springer.
2. Bishop, C. (1995). Neural networks for pattern recognition. Oxford University Press.
3. Collobert, R., & Bengio, S. (2004a). A gentle hessian for efficient gradient descent. IEEE International Conference on Acoustic, Speech, and Signal Processing, ICASSP.
4. Collobert, R., & Bengio, S. (2004b). Links between Perceptrons, MLPs and SVMs (Technical Report 04-06). IDIAP.
5. Duda, R., & Hart, P. (1973). Pattern classification and scene analysis. New York: Wiley.
6. Fletcher, R. (1987). Practical methods of optimization. John Wiley & Sons.
7. Graepel, T., Herbrich, R., & Williainson, R. (2001). From margin to sparsity. Advances in Neural Information Processing Systems (pp. 210-216). MIT Press.
8. Hornik, K., Stinchcombe, M., & White, H. (1989). Multilayer feedforward networks are universal approximators. Neural Networks, 2, 359-366.
9. Joachims, T. (1999). Making large-scale support vector machine learning practical. In B. Schölkopf, C. Burges and A. Smola (Eds.), Advances in Kernel Methods. The MIT Press.
10. Kivinen, J., Smola, A. J., & Williamson, R. C. (2002). Online learning with kernels. Advances in Neural Information Processing Systems (pp. 785-792). MIT Press.
11. LeCun, Y. (1987). Modeles connexionnistes de l'apprentissage (connectionist learning models). Doctoral dissertation, Université P. et M. Curie (Paris 6).
12. LeCun, Y., Bottou, L., Orr, G., & Müller, K.-R. (1998). Efficient backprop. In G. Orr and K.-R. Müller (Eds.), Neural networks: Tricks of the trade, 9-50. Springer.
13. Nilsson, N. (1965). Learning machines. McGraw-Hill.
14. Novikoff, A. B. J. (1962). On convergence proofs on perceptrons. Proceedings of the Symposium on the Mathematical Theory of Automata (pp. 615-622).
15. Plaut, D., Nowlan, S., & Hinton, G. E. (1986). Experiments on learning by back-propagation (Technical Report CMU-CS-86-126). Department of Computer Science, Carnegie-Mellon University.
16. Rosenblatt, F. (1957). The perceptron - a perceiving and recognizing automaton (Technical Report 85-460-1). Cornell Aeronautical Laboratory.
17. Rosset, S., Zhu, J., & Hastie, T. (2004). Margin maximizing loss functions. In S. Thrun, L. Saul and B. Schölkopf (Eds.), Advances in neural information processing systems 16. Cambridge, MA: MIT Press.
18. Rumelhart, D., Hinton, G., & Williams, R. (1986). Learning internal representations by back-propagating errors. In D. Rumelhart and J. McClelland (Eds.), Parallel distributed processing: Explorations in the microstructure of cognition, vol. 1, 318-362. MIT Press.
19. Vapnik, V. (1995). The Nature of Statistical Learning Theory. Springer. Second edition.