Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules

Authors:
M. Yu. Khachai
Affiliations:
Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia
Venue:
Automation and Remote Control
Year:
2010

Citing 4
Cited 0

Complexity Results on Learning by Neural Nets

Machine Learning
Original Contribution: Training a 3-node neural network is NP-complete

Neural Networks
Parallel computations and committee constructions

Automation and Remote Control
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two new results concerned with the computational and approximation complexities of the combinatorial optimization problems arising at learning pattern recognition in the class of committee piecewise-linear decision rule were discussed.