article · 2000

A weight evolution algorithm with deterministic perturbation

Cited by 1Abstract and details only

Abstract

Introduces a learning algorithm for multi-layered feedforward network-weight evolution algorithm with deterministic perturbation. During the learning phase of the gradient algorithm (such as backpropagation), the network weights are adjusted intentionally in order to have an improvement in system performance. The intention is to reduce the overall system error after every weight update. By looking at the error component, it is possible to adjust some of the network weights dramatically so as to have an overall reduction in system error. Using the deterministic perturbation, it is found that the weight evolution between the hidden and output layer can accelerate the convergence speed, whereas the weight evolution between the input layer and the hidden layer can assist in solving the local minima problem.

Cite this paper

APA 7

Ng, S.-C., Leung, S., & Luk, A. (2000). A weight evolution algorithm with deterministic perturbation. https://doi.org/10.1109/ijcnn.2000.857834

MLA 9

Ng, Sin-Chun, et al. “A weight evolution algorithm with deterministic perturbation.” vol. e77 a, 2000, pp. 185–190 vol.1, https://doi.org/10.1109/ijcnn.2000.857834.

Chicago

Ng, Sin-Chun, S.H. Leung, and A. Luk. 2000. “A weight evolution algorithm with deterministic perturbation.” https://doi.org/10.1109/ijcnn.2000.857834.

Harvard

Ng, S.-C., Leung, S. and Luk, A. (2000) ‘A weight evolution algorithm with deterministic perturbation’. Available at: https://doi.org/10.1109/ijcnn.2000.857834.

BibTeX

@article{ng2000weight,
  title = {{A weight evolution algorithm with deterministic perturbation}},
  author = {Ng, Sin-Chun and Leung, S.H. and Luk, A.},
  volume = {e77 a},
  pages = {185--190 vol.1},
  year = {2000},
  doi = {10.1109/ijcnn.2000.857834}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.