Doklady Mathematics

, Volume 98, Issue 3, pp 646–647 | Cite as

Soft Randomized Machine Learning

  • Yu. S. PopkovEmail author


A new method for entropy-randomized machine learning is proposed based on empirical risk minimization instead of the exact fulfillment of empirical balance conditions. The corresponding machine learning algorithm is shown to generate a family of exponential distributions, and their structure is found.


  1. 1.
    P. Campbell, Nature 455 (7209), 1 (2008).CrossRefGoogle Scholar
  2. 2.
    Yu. S. Popkov, A. Yu. Popkov, and Yu. A. Dubnov, “Randomized machine learning,” Proceedings of the 8th International IEEE Conference on Intelligent Systems, Sofia, Bulgaria, 2016 (2016).Google Scholar
  3. 3.
    V. V. Voevodin and Yu. A. Kuznetsov, Matrices and Computations (Nauka, Moscow, 1984) [in Russian].zbMATHGoogle Scholar
  4. 4.
    V. M. Tikhomirov, V. N. Alekseev, and S. V. Fomin, Optimal Control (Nauka, Moscow, 1979) [in Russian].zbMATHGoogle Scholar
  5. 5.
    A. D. Ioffe and V. M. Tikhomirov, Theory of Extremal Problems (Nauka, Moscow, 1974; Elsevier, Amsterdam, 1978).Google Scholar
  6. 6.
    Ya. Z. Tsypkin, Foundations of the Theory of Learning Systems (Nauka, Moscow, 1970) [in Russian].Google Scholar
  7. 7.
    C. M. Bishop, Pattern Recognition and Machine Learning (Springer, Berlin, 2006).zbMATHGoogle Scholar
  8. 8.
    M. A. Kaashoek, S. Seatzu, and C. van der Mee, Recent Advances in Operator Theory and Its Applications (Springer, New York, 2006).Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  1. 1.Institute for Systems Analysis, Federal Research Center “Computer Science and Control,”Russian Academy of SciencesMoscowRussia
  2. 2.Haifa UniversityKarmielIsrael
  3. 3.Yugorsk Research Institute of Information TechnologiesKhanty-Mansiysk, Tyumen oblastRussia

Personalised recommendations