Machine Search Problem for Mathematical Expression

IF 0.5 4区数学 Q3 MATHEMATICS

Doklady Mathematics Pub Date : 2025-03-22 DOI:10.1134/S1064562424602087

A. I. Diveev, E. A. Sofronova

引用次数: 0

Abstract

The problem of searching for a mathematical expression is formulated. Classes of mathematical problems where this problem is in demand are presented. A general approach to solving this problem based on machine learning using symbolic regression methods is given. This approach allows finding not only the parameters of the desired mathematical expression, but also its structure. The general problem of machine learning by methods of symbolic regression is described and a unified approach to overcoming it based on the application of the principle of small variations of the basis solution is given.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Doklady Mathematics 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3-6 weeks

期刊介绍： Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.