### ?

## Reinforcement Procedure for Randomized Machine Learning

Mathematics. 2023. Vol. 11. No. 17. Article 3651.

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.

Малышева А. И., PEROLAT J., VYLDER B. D., American Association for the Advancement of Science 378.6623 2022 Vol. 378 No. 6623 P. 990–996

Stratego is a popular two-player imperfect information board game. Because of its complexity stemming from its enormous game tree, decision-making under imperfect information, and a piece deployment phase at the start, Stratego poses a challenge for artificial intelligence (AI). Previous computer programs only performed at an amateur level at best. Perolat et al. introduce a model-free ...

Added: June 17, 2023

Bobrov E., Kropotov Dmitry, Lu H. et al., IEEE Communications Letters 2022 Vol. 26 No. 4 P. 818–822

IEEEThe paper describes an online deep learning algorithm (ODL) for adaptive modulation and coding in massive MIMO. The algorithm is based on a fully connected neural network, which is initially trained on the output of the traditional algorithm and then incrementally retrained by the service feedback of its output. We show the advantage of our ...

Added: October 26, 2022

Yu. A. Dubnov, A. Yu. Popkov, Polishchuk V. Y. et al., Automation and Remote Control 2023 Vol. 84 No. 1 P. 64–81

Randomized machine learning focuses on problems with considerable uncertainty in data and models. Machine learning algorithms are formulated in terms of a functional entropylinear programming problem. We adapt these algorithms to forecasting problems on an example of the evolution of thermokarst lakes area in permafrost zones. Thermokarst lakes generate methane, a greenhouse gas affecting climate ...

Added: February 5, 2024

Tiapkin D., Belomestny D., Naumov A. et al., Working papers by Cornell University. Series math "arxiv.org" 2023 Article 2304.03056

In this work, we derive sharp non-asymptotic deviation bounds for weighted sums of Dirichlet random variables. These bounds are based on a novel integral representation of the density of a weighted Dirichlet sum. This representation allows us to obtain a Gaussian-like approximation for the sum distribution using geometry and complex analysis methods. Our results generalize ...

Added: June 28, 2023

Gremyachikh L., Dubov D., Kazeev N. et al., Advances in the Astronautical Sciences 2020 Vol. 170 P. 305–319

The number of space objects will grow several times in a few years due to the planned launches of constellations of thousands microsatellites. It leads to a significant increase in the threat of satellite collisions. Spacecraft must undertake collision avoidance maneuvers to mitigate the risk. According to publicly available information, conjunction events are now manually ...

Added: October 10, 2019

Springer, 2021

This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021.
The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length.
The research part ...

Added: July 10, 2021

Akopov A. S., Beklaryan A., Искусственные общества 2021 Т. 16 № 1 С. 1–23

This article presents a model of the ground autonomous vehicles (AVs) motion in the Artificial Road Network (ARN) belonging to the "Manhattan Lattice" type with the implementation of the large-scale agent-based modeling framework FLAME GPU. The most important scenarios of the traffic situation development are investigated, in particular, which are associated with reducing visibility on ...

Added: April 1, 2021

Zlotnik A., Lomonosov T., Успехи кибернетики 2024 Т. 5 № 3 С. 6–12

We numerically solved an initial-boundary value problem for the n-dimensional acoustic wave equation (n ⩾ 1) with variable sound speed and nonhomogeneous Dirichlet boundary conditions. We studied a non-standard, three-level, semi-explicit compact scheme. The scheme uses three points per spatial direction and exploits n auxiliary functions to approximate second-order non-mixed spatial derivatives. At the first ...

Added: August 23, 2024

Akopov A. S., Beklaryan L. A., Saghatelyan A. K., Environmental Modelling and Software 2019 Vol. 116 P. 7–25

Urban greenery such as trees can effectively reduce air pollution in a natural and eco-friendly way. However, how to spatially locate and arrange greenery in an optimal way remains as a challenging task. We developed an agent-based model of air pollution dynamics to support the optimal allocation and configuration of tree clusters in a city. The Pareto ...

Added: February 24, 2019

Malyshev D., Discrete Mathematics 2015 Vol. 338 No. 11 P. 1860–1865

We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. ...

Added: April 7, 2014

Lanham: University Press of America, 2012

The history of logic and analytic philosophy in Central and Eastern Europe is still known to very few people. As an exception to the rule, only two scientific schools became internationally popular: the Vienna Circle and the Lvov-Warsaw School. Nevertheless, the countries included in this region have not only joint history, but also joint cultural ...

Added: February 13, 2013

Пермь: Пермский государственный национальный исследовательский университет, 2020

В сборнике представлены статьи участников Всероссийской научно-практической конференции молодых ученых с международным участием «Математика и междисциплинарные исследования – 2020». На конференцию было прислано более ста статей из различных регионов России, а также из ближнего
и дальнего зарубежья. По итогам работы экспертной комиссии для публикации было отобрано шестьдесят две статьи. Каждая статья оценивалась группой экспертов в той области, которая рассматривается автором.
Представленные ...

Added: December 10, 2020

Yasnitsky L., Ваулева С. В., Сафонова Д. Н. et al., Всероссийский криминологический журнал 2015 Т. 9 № 3 С. 423–430

Modern criminalists do not share a common opinion regarding the choice of parameters which could be used to work out a system of characteristics to differentiate a maniac killer from an ordinary person. This hinders the development of efficient software for investigation purposes. The paper describes the experience of developing a neural network that can ...

Added: October 1, 2015

Koldanov A. P., Koldanov P., Semenov D., Журнал Новой экономической ассоциации 2021 Т. 2 № 50 С. 12–34

. The problem of analysis of pairwise connections between stocks of financial market by observations on stock returns is considered. Such problem arise in stock market network analysis. It is assumed that joint distribution of stock returns belongs to the wide class of elliptical distributions. Classical Pearson correlation, Fechner correlation and Kendall correlation are used ...

Added: June 17, 2021

Gafarov E., Lazarev A. A., Information Processing Letters 2012 Т. 112 № 3 С. 72–76

In this note, we consider a single machine scheduling problem with generalized total tardiness objective function.
A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new
graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number
of tardy jobs on a single ...

Added: November 24, 2012

Bliznets Ivan, Cygan M., Komosa P. et al., ACM Transactions on Computation Theory 2018 Vol. 10 No. 2 P. 1–32

The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free—that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly, but we add edges instead of deleting them. The study of these two problem families has recently been the subject of intensive studies from the point of ...

Added: October 30, 2018

Alexandrov D. E., Galkin V. V., Zobnin A.I. et al., Journal of Mathematical Sciences 2009 Vol. 163 No. 5 P. 469–486

Sequential and parallel implementations of the F4 algorithm for computing Gr¨obner bases of
polynomial ideals are discussed. ...

Added: October 1, 2014

Красноярск: ИВМ СО РАН, 2013

Труды Пятой Международной конференции «Системный анализ и информационные технологии» САИТ-2013 (19–25 сентября 2013 г., г.Красноярск, Россия): ...

Added: November 18, 2013

Vyalyi M., Дискретная математика 1991 Т. 3 № 3 С. 35–45

Added: October 17, 2014

Chernyshev S. V., Cherepanov E. A., Pankratiev E. V. et al., Journal of Mathematical Sciences 2005 Vol. 128 No. 6 P. 3487–3495

Added: January 27, 2014

Marshirov V. V., Marshirova L. E., Сибирский журнал индустриальной математики 2013 Т. XVI № 4 С. 111–120

The paper considers the problem of determining the rate of cooling of metal during solidification at the intersection of the liquidus temperature under intense heat sink from the surface. The solution to this problem it is necessary to determine the process conditions, the boundary and initial conditions for which it is possible to get new ...

Added: November 17, 2013

P.: Université Paris 13 - Paris Sorbonne Cité, 2013

In this workshop we will bring together participants who have solutions for one or more of the following problems: How can mutual understanding be optimized with the help of technology in hospitals where both patients and professionals have varying language skills, cultural backgrounds and cognitive capacities? Can domain ontologies, natural language processing tools, multilingual knowledge-based ...

Added: December 18, 2014

Malyshev D., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2020 Vol. 14 No. 4 P. 706–721

The edge coloring problem for a graph is to minimize the number of colors that are sufficient to color all edges of the graph so that all adjacent edges receive distinct colors. The computational complexity of the problem is known for all graph classes defined by forbidden subgraphs with at most 6 edges. We improve ...

Added: January 30, 2021

Litvin Y. V., Абрамов И. В., Технологии техносферной безопасности 2016 № 66

Advanced approach to the assessment of a random time of arrival fire fighting calculation on the object of protection, the time of their employment and the free combustion. There is some quantitative assessments with the review of analytical methods and simulation ...

Added: August 27, 2016