RUS  ENG
Full version
PEOPLE

Shibzukhov Zaur Mukhadinovich

Publications in Math-Net.Ru

  1. On a robust gradient boosting scheme based on aggregation functions insensitive to outliers

    Avtomat. i Telemekh., 2022, no. 10,  156–168
  2. On a robust approach to search for cluster centers

    Avtomat. i Telemekh., 2021, no. 10,  140–151
  3. Minimizing robust estimates of sums of parameterized functions

    Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 166 (2019),  95–109
  4. Principle of Minimizing Empirical Risk and Averaging Aggregate Functions

    Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 154 (2018),  123–137
  5. Minimization of some robast summs of parametrized functions

    News of the Kabardin-Balkar scientific center of RAS, 2017, no. 6-2,  244–248
  6. Center based clustering and averaging aggregation functions

    Vestnik KRAUNC. Fiz.-Mat. Nauki, 2017, no. 3(19),  70–77
  7. On the principle of minimizing the average empiric risk to solutions of regression problems

    News of the Kabardin-Balkar scientific center of RAS, 2016, no. 6,  88–95
  8. Stochastic gradient algorithm based on the average aggregate functions

    Vestnik KRAUNC. Fiz.-Mat. Nauki, 2016, no. 4-1(16),  112–125
  9. A recurrent method for effective learning of certain algebraic networks of $\Sigma\Pi$-neurons and $\Sigma\Pi$-neuromodules

    Zh. Vychisl. Mat. Mat. Fiz., 43:8 (2003),  1260–1272
  10. On estimating the complexity of threshold functions in terms of analogues of spectral norms

    News of the Kabardin-Balkar scientific center of RAS, 1999, no. 1,  46–50
  11. Synthesis and Complexity Reduction Methods for Diophantine Neural Networks over a Finite Field

    Avtomat. i Telemekh., 1997, no. 4,  204–212


© Steklov Math. Inst. of RAS, 2024