Geodesic
Stability of a correct algorithm in the polynomial closure of the family of binary classification algorithms
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 2, pp. 354-356 
E. A. Lutsenko. Stability of a correct algorithm in the polynomial closure of the family of binary classification algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 2, pp. 354-356. http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_2_a17/
@article{ZVMMF_2005_45_2_a17,
     author = {E. A. Lutsenko},
     title = {Stability of a correct algorithm in the polynomial closure of the family of binary classification algorithms},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {354--356},
     year = {2005},
     volume = {45},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_2_a17/}
}
TY  - JOUR
AU  - E. A. Lutsenko
TI  - Stability of a correct algorithm in the polynomial closure of the family of binary classification algorithms
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2005
SP  - 354
EP  - 356
VL  - 45
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_2_a17/
LA  - ru
ID  - ZVMMF_2005_45_2_a17
ER  - 
%0 Journal Article
%A E. A. Lutsenko
%T Stability of a correct algorithm in the polynomial closure of the family of binary classification algorithms
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2005
%P 354-356
%V 45
%N 2
%U http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_2_a17/
%G ru
%F ZVMMF_2005_45_2_a17

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of the recovery of a partially defined predicate on a metric compact of special form is considered. In a certain family of algorithms (for example, algorithms for computing estimates), an algorithm of the predicate evaluation is constructed, and its stability on the set of the recovery problems in a neighborhood of the given problem is proved. The lower bound for the stability radius of the algorithm constructed is computed.

[1] Zhuravlev Yu. I., “Korrektnye algebry nad mnozhestvami nekorrektnykh (evristicheskikh) algoritmov. I; II”, Kibernetika, 1977, no. 4, 5–17; No 6, 21–27