ML Anthology

A Polynomial Time Algorithm for Generating Neural Networks for Pattern Classification: Its Stability Properties and Some Test Results

Somnath Mukhopadhyay, Asim Roy, Lark Sang Kim, Sandeep Govil
NeCo 1993 pp. 317-330
doi:10.1162/NECO.1993.5.2.317 /neco/1993/mukhopadhyay1993neco-polynomial/

Abstract

Polynomial time training and network design are two major issues for the neural network community. A new algorithm has been developed that can learn in polynomial time and also design an appropriate network. The algorithm is for classification problems and uses linear programing models to design and train the network. This paper summarizes the new algorithm, proves its stability properties, and provides some computational results to demonstrate its potential.

NeCo Semantic Scholar

Cite

Text

Mukhopadhyay et al. "A Polynomial Time Algorithm for Generating Neural Networks for Pattern Classification: Its Stability Properties and Some Test Results." Neural Computation, 1993. doi:10.1162/NECO.1993.5.2.317

Markdown

[Mukhopadhyay et al. "A Polynomial Time Algorithm for Generating Neural Networks for Pattern Classification: Its Stability Properties and Some Test Results." Neural Computation, 1993.](https://mlanthology.org/neco/1993/mukhopadhyay1993neco-polynomial/) doi:10.1162/NECO.1993.5.2.317

BibTeX

@article{mukhopadhyay1993neco-polynomial,
  title     = {{A Polynomial Time Algorithm for Generating Neural Networks for Pattern Classification: Its Stability Properties and Some Test Results}},
  author    = {Mukhopadhyay, Somnath and Roy, Asim and Kim, Lark Sang and Govil, Sandeep},
  journal   = {Neural Computation},
  year      = {1993},
  pages     = {317-330},
  doi       = {10.1162/NECO.1993.5.2.317},
  volume    = {5},
  url       = {https://mlanthology.org/neco/1993/mukhopadhyay1993neco-polynomial/}
}