Computational complexity of combinatorial problems related to piecewise linear committee pattern-recognition learning procedures

Authors:
M. Yu. Khachai;M. I. Poberii
Affiliations:
Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia 620990;Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia 620990
Venue:
Pattern Recognition and Image Analysis
Year:
2012

Citing 6
Cited 0

Complexity Results on Learning by Neural Nets

Machine Learning
The nature of statistical learning theory

The nature of statistical learning theory
The PCP theorem by gap amplification

Journal of the ACM (JACM)
Complexity and Approximability of Committee Polyhedral Separability of Sets in General Position

Informatica
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
On the complexity of locating linear facilities in the plane

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of combinatorial optimization problems related to optimal pattern recognition learning is studied by the method of structural risk minimization in the class of piecewise linear committee decision rules. Most of the problems are shown to be intractable and the thresholds of their efficient approximability are estimated and approximation polynomial algorithms are given.