Sciweavers

448 search results - page 3 / 90
» Perceptrons
Sort
View
NIPS
2000
15 years 3 months ago
From Margin to Sparsity
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
Thore Graepel, Ralf Herbrich, Robert C. Williamson
NN
2000
Springer
145views Neural Networks» more  NN 2000»
15 years 1 months ago
Best approximation by Heaviside perceptron networks
In Lp-spaces with p [1, ) there exists a best approximation mapping to the set of functions computable by Heaviside perceptron networks with n hidden units; however for p (1, ) ...
Paul C. Kainen, Vera Kurková, Andrew Vogt
ICML
2009
IEEE
16 years 2 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
EUROGP
2004
Springer
170views Optimization» more  EUROGP 2004»
15 years 5 months ago
Comparing Hybrid Systems to Design and Optimize Artificial Neural Networks
Abstract. In this paper we conduct a comparative study between hybrid methods to optimize multilayer perceptrons: a model that optimizes the architecture and initial weights of mul...
Pedro A. Castillo Valdivieso, Maribel Garcí...
WCE
2007
15 years 3 months ago
Neural Networks for Optimal Control of Aircraft Landing Systems
Abstract—In this work we present a variational formulation for a multilayer perceptron neural network. With this formulation any learning task for the neural network is defined ...
Kevin Lau, Roberto Lopez, Eugenio Oñate