RUS  ENG
Full version
JOURNALS // Trudy Instituta Matematiki i Mekhaniki UrO RAN // Archive
Trudy Inst. Mat. i Mekh. UrO RAN, 2010 Volume 16, Number 3, Pages 276–284 (Mi timm599)
This article is cited in 2 papers

Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning

M. Yu. Khachai

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences

Abstract: The computational complexity of a new class of combinatorial optimization problems that are induced by optimal machine learning procedures in the class of collective piecewise linear classifiers of committee type is studied.

Keywords: empirical risk minimization, committee decision rule, computational complexity.

UDC: 519.6

Received: 02.04.2010


 English version: Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2011, 272, suppl. 1, S46–S54

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024