?
Reinforcement Procedure for Randomized Machine Learning
Mathematics. 2023. Vol. 11. No. 17. Article 3651.
Yuri S. Popkov, Dubnov Y. A., Alexey Yu. Popkov
This paper is devoted to problem-oriented reinforcement methods for the numerical implementation of Randomized Machine Learning. We have developed a scheme of the reinforcement procedure based on the agent approach and Bellman’s optimality principle. This procedure ensures strictly monotonic properties of a sequence of local records in the iterative computational procedure of the learning process. The dependences of the dimensions of the neighborhood of the global minimum and the probability of its achievement on the parameters of the algorithm are determined. The convergence of the algorithm with the indicated probability to the neighborhood of the global minimum is proved.
Trubochkina N. K., М.: Издательство «Юрайт», 2026.
This textbook is designed to develop students' holistic understanding of modern production processes and methods for their analysis and management using machine learning technologies. In the context of the fourth industrial revolution, where traditional engineering disciplines are inextricably intertwined with intelligent data processing methods, there is a growing need for specialists capable of integrating knowledge ...
Added: August 8, 2026
Kulev Y., Maksaev A., Promyslov V., Linear Algebra and its Applications 2026 Vol. 730 P. 51–72
The notion of λ-th upper scrambling index was introduced by Huang and Liu in 2010, as a generalization of a notion considered by Akelbek and Kirkland in 2009. For a primitive digraph D, it is defined as the smallest positive integer k such that for every λ vertices of D there exist directed paths of lengths k from these vertices to a common vertex. This ...
Added: August 7, 2026
Kanunnikov A., Promyslov V., Vassilieva E., Electronic Journal of Combinatorics 2024 Vol. 31 No. 3 Article P3.6
Introduced by Goulden and Jackson in their 1996 paper, the matchings-Jack conjecture and the hypermap-Jack conjecture (also known as the b-conjecture) are two major open questions relating Jack symmetric functions, the representation theory of the symmetric groups and combinatorial maps. They show that the coefficients in the power sum expansion of some Cauchy sum for ...
Added: August 7, 2026
Фирсанова В. И., ACM, 2026.
The inclusion of autistic people can be augmented by a mobile app that provides information without a human mediator making information perception more liberating for people in the spectrum. This paper is an overview of a doctoral work dedicated to the development of a web-based mobile tool for supporting the inclusion of people on the ...
Added: August 4, 2026
Фирсанова В. И., Хлусова Я. К., CEUR Workshop Proceedings, 2025.
Knowledge graphs are widely used in Retrieval Augmented Generation (RAG) and Explainable AI (XAI), since they can illustrate semantic relationships generated by Large Language Models (LLMs). Recent studies focus on generating knowledge graphs from unstructured data to improve RAG performance; however, they do not explain the underlying graph structure. The analysis of synthetic graphs behind ...
Added: August 4, 2026
Spiridonov V. P., Belousov N. M., Sarkissian G. A., Analysis and Mathematical Physics 2026 Vol. 16 Article 96
Hyperbolic hypergeometric integrals are defined as Barnes-type integrals of products of hyperbolic gamma functions. Their reduction to ordinary hypergeometric functions is well known. We study in detail their degeneration to complex hypergeometric functions. Namely, using uniform bounds on the integrands, we prove that the univariate hyperbolic beta integral and the conical function degenerate to two-dimensional ...
Added: August 4, 2026
Gayfullin S., Kikteva V., Results in Mathematics 2026 Vol. 81 No. 5 Article 146
In this paper we obtain a criterion of flexibility for an affine complexity-zero horospherical variety. This result generalizes previously known results on flexibility of normal horospherical varieties, horospherical varieties with an action of a semisimple group, and non-normal toric varieties. ...
Added: August 3, 2026
Lunts V., Функциональный анализ и его приложения 2026 Т. 60 № 3 С. 127–129
Доказано, что канонические полуортогональные разложения производной категории диаграммной схемы индуцируют аналогичные разложения подкатегории совершенных комплексов. ...
Added: August 3, 2026
Belomestny D., Gasnikov A., Gladin E. et al., Russian Mathematical Surveys 2026 Vol. 81 No. 4(490) P. 3–90
Reinforcement learning (RL) is increasingly grounded in tools from probability, optimization, and operator theory. This survey organizes the mathematical structures that underpin the design and analysis of modern algorithms in RL. We begin from Markov decision processes (MDPs) and the Bellman operators, emphasizing contraction mappings, monotonicity, and fixed-point theory that yield convergence guarantees and rates ...
Added: August 3, 2026
Chepovskiy A., Мастерская Печати Идей, 2026.
The textbook presents methods and algoгithms for automatic analysis
of соrроrа of texts in natural languages. It is intended fоr sfudenБ of
methods of processing texts in паtчrаl languages and creating training
arays of texts.
Fоr students, graduate students and researchers studying methods
of computational linguistics and word processing. ...
Added: August 1, 2026
A. Radomskii, Mathematical notes 2026 Vol. 119 No. 6 P. 1136–1147
We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in\mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some restrictions. As applications, for any $t>0$, we obtain an upper bound for the number of $n\in [1,N]$ such that $a_{n}/ \varphi (a_{n})> t$. ...
Added: July 31, 2026
Абызов А. Н., Буутай П. Н., Математика и теоретические компьютерные науки 2026 Т. 4 № 2 С. 4–75
This paper is expository and methodological in nature and is devoted to the development of E.I. Zolotarev’s ideas embedded in his approach to the proof of the quadratic reciprocity law (1872). We consider extensions of Zolotarev’s approach to abstract number rings presented in the work of A. Brunyate and P.L. Clark (2015), and to finite ...
Added: July 30, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Уилкокс П., Romanov A., М.: ДМК Пресс, 2025.
Книга, которую вы держите в руках, продолжает серию «Книжная полка истового
инженера», которая издается при поддержке компании YADRO.
Данная книга представляет собой учебник по теоретическим основам продвинутой
функциональной верификации и содержит лучшие практики, используемые в настоящее
время. В ней подробно описана унифицированная методология верификации
(UVM) и раскрыты такие темы, как функциональный виртуальный прототип, функциональное
покрытие, утверждения, формальная верификация, тестбенчи, косимуляция,
эмуляция, аппаратное ...
Added: July 30, 2026
Mikhaylets E. V., Razorenova A. М., Chernyshev V. L. et al., Scientific Reports 2026 Vol. 16 Article 23560
Meditation offers a naturalistic paradigm for studying introspection, yet the neural dynamics of advanced tantric practices remain largely unexplored. Buddhist Highest Yoga Tantra (BHYT) comprises a sequence of eight dissolution stages culminating in the “clear light” state. We recorded EEG during eyes-closed BHYT meditation performed in monasteries and hermitages (51 sessions from 36 male practitioners; ...
Added: July 29, 2026
Попеленский Ф. Ю., Математический сборник 2026 Т. 217 № 2 С. 108–153
In a recent paper Buchstaber and the author introduced a new structure on the cohomology of Hopf algebras in terms of the Buchstaber spectral sequence (Bss). We fully calculate this structure on the cohomology (known for a long time) of the important Hopf subalgebra A(1) of the classical Steenrod algebra A2.
As part of a demonstration ...
Added: July 28, 2026
Kychkin A., Chernitsin I., Прикладная информатика 2026 № 1(121) С. 40–58
The results of the development of a software microservice embedded in atmospheric air quality monitoring systems to support the identification of industrial pollution sources are presented. The emission and subsequent spread of harmful substances in the lower layers of the atmosphere is dynamic and characterized by high uncertainty due to the specific features of technological ...
Added: April 23, 2026
Cham: Springer, 2025.
This book constitutes the refereed proceedings of 34th International Workshops which were held in conjunction with the 34th International Conference on Artificial Neural Networks and Machine Learning, ICANN 2025, held in Kaunas, Lithuania, September 9–12, 2025.
The 20 full papers and 8 abstracts included in this workshop volume were carefully reviewed and selected from 42 submissions. ...
Added: September 29, 2025
Delev A., Semakov S., , in: 2025 8th International Conference on Artificial Intelligence and Big Data (ICAIBD).: IEEE, 2025. P. 318–322.
Profit is one of the most important economic indicators of a company’s performance, and for every company it is necessary to allocate resources in such a way as to obtain the maximum possible profit. The profit maximization problem is usually a dynamic optimization problem. This article discusses an approach to solving the production expansion problem ...
Added: August 25, 2025
Pastushkov A., Boulatov A., Finance Research Letters 2025 Vol. 83 Article 107671
Recent studies have increasingly explored whether reinforcement learning algorithms can give rise to cooperative behavior that results in non-competitive pricing across various market settings. In financial markets, Cartea et al. (2022) show that market makers using multi-armed bandit (MAB) algorithms generally converge to competitive pricing in quote-driven over-the-counter (OTC) markets, barring some unlikely exceptions where ...
Added: June 19, 2025
Rozhkov M., Alyamovskaya N., Zakhodiakin G., International Journal of Production Research 2025 Vol. 63 No. 18 P. 6630–6647
This article investigates the application of reinforcement learning (RL) methods to optimise a four-echelon linear supply chain model with stochastic demand. The proposed supply chain configuration is largely based on the production-distribution supply chain of the MIT Supply Chain Beer Game. We show that RL can significantly improve ordering efficiency and overall supply chain performance. ...
Added: March 24, 2025
Blokhin A., Kalev V., Pusev R. et al., , in: 2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Novosibirsk: IEEE, 2024. P. 25–30.
Congestion control is one of the key mechanisms of communication in QUIC protocol which controls how much data and at which rate can be send to an endpoint at particular moment of time for better use of shared network resources and avoids moving into congestive collapse state. In this work we tackle the problem of ...
Added: December 18, 2024
Tiapkin D., Morozov N., Naumov A. et al., , in: Proceedings of The 27th International Conference on Artificial Intelligence and Statistics (AISTATS 2024), 2-4 May 2024, Palau de Congressos, Valencia, Spain. PMLR: Volume 238Vol. 238.: Valencia: PMLR, 2024. P. 4213–4221.
The recently proposed generative flow networks (GFlowNets) are a method of training a policy to sample compositional discrete objects with probabilities proportional to a given reward via a sequence of actions. GFlowNets exploit the sequential nature of the problem, drawing parallels with reinforcement learning (RL). Our work extends the connection between RL and GFlowNets to ...
Added: June 22, 2024
Tiapkin D., Belomestny D., Calandriello D. et al., , in: Advances in Neural Information Processing Systems 36 (NeurIPS 2023).: Curran Associates, Inc., 2023. P. 73719–73774.
Added: February 17, 2024