首页 > 最新文献

Doklady Mathematics最新文献

英文 中文
Generating Survival Interpretable Trajectories and Data 生成生存可解释轨迹和数据
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424601999
A. V. Konstantinov, S. R. Kirpichenko, L. V. Utkin

A new model for generating survival trajectories and data based on applying an autoencoder of a specific structure is proposed. It solves three tasks. First, it provides predictions in the form of the expected event time and the survival function for a new feature vector based on the Beran estimator. Second, the model generates additional data based on a given training set that would supplement the original dataset. Third, the most important, it generates a prototype time-dependent trajectory for an object, which characterizes how features of the object could be changed to achieve a different time to an event. The trajectory can be viewed as a type of the counterfactual explanation. The proposed model is robust during training and inference due to a specific weighting scheme incorporated into the variational autoencoder. The model also determines the censored indicators of new generated data by solving a classification task. The paper demonstrates the efficiency and properties of the proposed model using numerical experiments on synthetic and real datasets. The code of the algorithm implementing the proposed model is publicly available.

本文提出了一种基于特定结构的自动编码器生成生存轨迹和数据的新模型。它解决了三项任务。首先,它以预期事件时间的形式提供预测,并根据贝伦估计器为新特征向量提供生存函数。其次,该模型根据给定的训练集生成额外数据,对原始数据集进行补充。第三,也是最重要的一点,它能为一个物体生成一个与时间相关的轨迹原型,该轨迹描述了如何改变物体的特征以达到不同的事件发生时间。该轨迹可视为一种反事实解释。由于在变异自动编码器中加入了特定的加权方案,因此所提出的模型在训练和推理过程中具有很强的鲁棒性。该模型还能通过解决分类任务来确定新生成数据的删减指标。论文通过对合成数据集和真实数据集的数值实验,证明了所提模型的效率和特性。实现所提模型的算法代码已公开。
{"title":"Generating Survival Interpretable Trajectories and Data","authors":"A. V. Konstantinov,&nbsp;S. R. Kirpichenko,&nbsp;L. V. Utkin","doi":"10.1134/S1064562424601999","DOIUrl":"10.1134/S1064562424601999","url":null,"abstract":"<p>A new model for generating survival trajectories and data based on applying an autoencoder of a specific structure is proposed. It solves three tasks. First, it provides predictions in the form of the expected event time and the survival function for a new feature vector based on the Beran estimator. Second, the model generates additional data based on a given training set that would supplement the original dataset. Third, the most important, it generates a prototype time-dependent trajectory for an object, which characterizes how features of the object could be changed to achieve a different time to an event. The trajectory can be viewed as a type of the counterfactual explanation. The proposed model is robust during training and inference due to a specific weighting scheme incorporated into the variational autoencoder. The model also determines the censored indicators of new generated data by solving a classification task. The paper demonstrates the efficiency and properties of the proposed model using numerical experiments on synthetic and real datasets. The code of the algorithm implementing the proposed model is publicly available.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S75 - S86"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424601999.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Environments for Automatic Curriculum Learning: A Short Survey 自动课程学习的环境:一个简短的调查
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602099
M. I. Nesterova, A. A. Skrynnik, A. I. Panov

Reinforcement learning encompasses various approaches that involve training an agent on multiple tasks. These approaches include training a general agent capable of executing a wide range of tasks and training a specialized agent focused on mastering a specific skill. Curriculum learning strategically orders tasks to optimize the learning process, enhancing training efficiency and improving overall performance. Researchers developing novel methods must select appropriate environments for evaluation and comparison with other methods. We introduce an overview of environments suitable for assessing curriculum learning methods, highlighting their key differences. This work details task components, modifications, and a classification of existing curriculum learning methods. We aim to provide researchers with valuable insights into the selection and utilization of environments for evaluating curriculum learning approaches.

强化学习包括各种方法,包括在多个任务上训练智能体。这些方法包括训练一个能够执行广泛任务的普通代理和训练一个专注于掌握特定技能的专门代理。课程学习战略性地安排任务,优化学习过程,提高培训效率,提高整体绩效。开发新方法的研究人员必须选择合适的环境进行评估和与其他方法的比较。我们概述了适合评估课程学习方法的环境,强调了它们的主要区别。这项工作详细介绍了任务的组成、修改和现有课程学习方法的分类。我们的目标是为研究人员提供有价值的见解,以选择和利用环境来评估课程学习方法。
{"title":"Environments for Automatic Curriculum Learning: A Short Survey","authors":"M. I. Nesterova,&nbsp;A. A. Skrynnik,&nbsp;A. I. Panov","doi":"10.1134/S1064562424602099","DOIUrl":"10.1134/S1064562424602099","url":null,"abstract":"<p>Reinforcement learning encompasses various approaches that involve training an agent on multiple tasks. These approaches include training a general agent capable of executing a wide range of tasks and training a specialized agent focused on mastering a specific skill. Curriculum learning strategically orders tasks to optimize the learning process, enhancing training efficiency and improving overall performance. Researchers developing novel methods must select appropriate environments for evaluation and comparison with other methods. We introduce an overview of environments suitable for assessing curriculum learning methods, highlighting their key differences. This work details task components, modifications, and a classification of existing curriculum learning methods. We aim to provide researchers with valuable insights into the selection and utilization of environments for evaluating curriculum learning approaches.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S223 - S229"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424602099.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Review of Multimodal Environments for Reinforcement Learning 强化学习的多模态环境研究综述
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602166
Z. A. Volovikova, M. P. Kuznetsova, A. A. Skrynnik, A. I. Panov

This article presents a review and comparative analysis of multimodal virtual environments for reinforcement learning. Seven different environments are considered, including the HomeGrid, BabyAI, RTFM, Messenger, Touchdown, Alfred, and IGLU, and research is focused on their peculiarities and requirements to agents. The main attention is paid to such parameters as complexity of text instructions and the dynamic properties of the environment. The conducted analysis identifies the strengths and weaknesses of each environment, which allows determining the optimal conditions for effective agent training, and also emphasizes the need to create more balanced environments combining high requirements to both understanding of language and interaction with the surrounding.

本文介绍了用于强化学习的多模态虚拟环境的综述和比较分析。考虑了七种不同的环境,包括HomeGrid、BabyAI、RTFM、Messenger、Touchdown、Alfred和IGLU,研究重点是它们的特性和对代理的要求。本文主要关注文本指令的复杂度和环境的动态特性等参数。所进行的分析确定了每个环境的优点和缺点,从而可以确定有效的智能体训练的最佳条件,并且还强调需要创建更平衡的环境,结合对语言理解和与周围环境交互的高要求。
{"title":"Review of Multimodal Environments for Reinforcement Learning","authors":"Z. A. Volovikova,&nbsp;M. P. Kuznetsova,&nbsp;A. A. Skrynnik,&nbsp;A. I. Panov","doi":"10.1134/S1064562424602166","DOIUrl":"10.1134/S1064562424602166","url":null,"abstract":"<p>This article presents a review and comparative analysis of multimodal virtual environments for reinforcement learning. Seven different environments are considered, including the HomeGrid, BabyAI, RTFM, Messenger, Touchdown, Alfred, and IGLU, and research is focused on their peculiarities and requirements to agents. The main attention is paid to such parameters as complexity of text instructions and the dynamic properties of the environment. The conducted analysis identifies the strengths and weaknesses of each environment, which allows determining the optimal conditions for effective agent training, and also emphasizes the need to create more balanced environments combining high requirements to both understanding of language and interaction with the surrounding.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S110 - S116"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424602166.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Empirical Approach to Sample Size Estimation for Testing of AI Algorithms 人工智能算法测试中样本量估计的经验方法
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602063
M. R. Kodenko, T. M. Bobrovskaya, R. V. Reshetnikov, K. M. Arzamasov, A. V. Vladzymyrskyy, O. V. Omelyanskaya, Yu. A. Vasilev

Calculation of sample size is one of the basic tasks in the field of correct and objective testing of artificial intelligence (AI) algorithms. Existing approaches, despite their exhaustive theoretical justification, can give results that differ by an order of magnitude under the same initial conditions. Most of the input parameters for such methods are determined by the researcher intuitively or on the basis of relevant literature data in the subject area. Such uncertainty at the research planning stage is associated with a high risk of obtaining biased results, which is especially important to take into account when using AI algorithms for medical diagnosis. Within the framework of this work, an empirical study of the value of the minimum required sample size of radiology diagnostic studies to obtain an objective value of the AUROC metric was conducted. An algorithm for calculating the threshold value of sample size according to the criterion of no statistically significant changes in the metric value in case of increasing this size was developed and implemented in software format. Using datasets containing the results of testing of AI algorithms on mammographic and radiographic studies with the total volume of more than 300 thousand, the empirical threshold for the sample size from 30 to 25 thousand studies with different relative content of pathology—from 10 to 90%—was calculated. The proposed algorithm allows obtaining results invariant to the balance of classes in the sample, the target value of AUROC, the modality of studies, and the AI algorithm. The empirical value of the minimum sufficient sample size for testing the AI algorithm for binary classification, obtained by analyzing over 2 million estimated values, is 400 studies. The results can be used to solve the problems of development and testing of diagnostic tools, including AI algorithms.

样本大小的计算是正确、客观地测试人工智能算法的基本任务之一。现有的方法尽管有详尽的理论依据,但在相同的初始条件下,得出的结果可能相差一个数量级。这些方法的输入参数大多由研究者凭直觉或根据该学科领域的相关文献数据确定。研究规划阶段的这种不确定性与获得偏倚结果的高风险相关,在使用人工智能算法进行医疗诊断时,这一点尤为重要。在这项工作的框架内,对获得AUROC指标客观值的放射学诊断研究所需的最小样本量的值进行了实证研究。根据增大样本量时度量值无统计学显著变化的标准,提出了一种计算样本量阈值的算法,并以软件形式实现。利用包含人工智能算法在30多万份乳腺x线摄影和x线摄影研究中测试结果的数据集,计算3万至2.5万份不同病理相对含量的研究样本数量的经验阈值(10%至90%)。所提出的算法允许获得与样本中类别的平衡、AUROC的目标值、研究的模式和AI算法不变的结果。通过对200多万个估计值进行分析,得到的用于检验人工智能二分类算法的最小足够样本量的经验值为400个研究。研究结果可用于解决包括人工智能算法在内的诊断工具的开发和测试问题。
{"title":"Empirical Approach to Sample Size Estimation for Testing of AI Algorithms","authors":"M. R. Kodenko,&nbsp;T. M. Bobrovskaya,&nbsp;R. V. Reshetnikov,&nbsp;K. M. Arzamasov,&nbsp;A. V. Vladzymyrskyy,&nbsp;O. V. Omelyanskaya,&nbsp;Yu. A. Vasilev","doi":"10.1134/S1064562424602063","DOIUrl":"10.1134/S1064562424602063","url":null,"abstract":"<p>Calculation of sample size is one of the basic tasks in the field of correct and objective testing of artificial intelligence (AI) algorithms. Existing approaches, despite their exhaustive theoretical justification, can give results that differ by an order of magnitude under the same initial conditions. Most of the input parameters for such methods are determined by the researcher intuitively or on the basis of relevant literature data in the subject area. Such uncertainty at the research planning stage is associated with a high risk of obtaining biased results, which is especially important to take into account when using AI algorithms for medical diagnosis. Within the framework of this work, an empirical study of the value of the minimum required sample size of radiology diagnostic studies to obtain an objective value of the AUROC metric was conducted. An algorithm for calculating the threshold value of sample size according to the criterion of no statistically significant changes in the metric value in case of increasing this size was developed and implemented in software format. Using datasets containing the results of testing of AI algorithms on mammographic and radiographic studies with the total volume of more than 300 thousand, the empirical threshold for the sample size from 30 to 25 thousand studies with different relative content of pathology—from 10 to 90%—was calculated. The proposed algorithm allows obtaining results invariant to the balance of classes in the sample, the target value of AUROC, the modality of studies, and the AI algorithm. The empirical value of the minimum sufficient sample size for testing the AI algorithm for binary classification, obtained by analyzing over 2 million estimated values, is 400 studies. The results can be used to solve the problems of development and testing of diagnostic tools, including AI algorithms.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S62 - S74"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424602063.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Introductory Words of AI Journey Team AI之旅团队简介
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424702272
The AI Journey Team
{"title":"Introductory Words of AI Journey Team","authors":"The AI Journey Team","doi":"10.1134/S1064562424702272","DOIUrl":"10.1134/S1064562424702272","url":null,"abstract":"","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S1 - S1"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stratified Statistical Models in Hardware Reliability Analysis 分层统计模型在硬件可靠性分析中的应用
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424601963
I. A. Vasilev, I. O. Filimonova, M. I. Petrovskiy, I. V. Mashechkin

Reliability analysis is becoming paramount to the successful operation of systems. This paper considers the problem of hardware failure using hard disc drives and solid state drives as examples. Survivability analysis methods are used to predict hardware degradation by estimating the probability of an event occurring over time. Also, survival models account for incomplete data about the true time to event for censored observations. However, popular statistical methods do not account for features of real data such as the presence of outliers and categorical variables. In this paper, we propose to extend classical survival statistical methods by introducing an interpretable stratifying tree, each leaf of which corresponds to a statistical model. The experimental study is based on evaluating the dependence of the models’ quality as the depth of the tree increases. According to the experimental results, the proposed method outperforms classical statistical models. The results of the study demonstrate the effectiveness of the proposed approach and its potential in the field of reliability of complex technical systems.

可靠性分析对系统的成功运行至关重要。本文以硬盘驱动器和固态驱动器为例研究硬件故障问题。生存性分析方法用于通过估计事件随时间发生的概率来预测硬件退化。此外,生存模型解释了关于审查观察的事件真实时间的不完整数据。然而,流行的统计方法没有考虑到真实数据的特征,如异常值和分类变量的存在。在本文中,我们提出通过引入一个可解释的分层树来扩展经典的生存统计方法,该树的每个叶子对应一个统计模型。实验研究是基于评估模型质量随树深度增加的依赖性。实验结果表明,该方法优于经典统计模型。研究结果证明了该方法的有效性及其在复杂技术系统可靠性研究领域的潜力。
{"title":"Stratified Statistical Models in Hardware Reliability Analysis","authors":"I. A. Vasilev,&nbsp;I. O. Filimonova,&nbsp;M. I. Petrovskiy,&nbsp;I. V. Mashechkin","doi":"10.1134/S1064562424601963","DOIUrl":"10.1134/S1064562424601963","url":null,"abstract":"<p>Reliability analysis is becoming paramount to the successful operation of systems. This paper considers the problem of hardware failure using hard disc drives and solid state drives as examples. Survivability analysis methods are used to predict hardware degradation by estimating the probability of an event occurring over time. Also, survival models account for incomplete data about the true time to event for censored observations. However, popular statistical methods do not account for features of real data such as the presence of outliers and categorical variables. In this paper, we propose to extend classical survival statistical methods by introducing an interpretable stratifying tree, each leaf of which corresponds to a statistical model. The experimental study is based on evaluating the dependence of the models’ quality as the depth of the tree increases. According to the experimental results, the proposed method outperforms classical statistical models. The results of the study demonstrate the effectiveness of the proposed approach and its potential in the field of reliability of complex technical systems.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S103 - S109"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424601963.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Neural Network Image Classifiers Informed by Factor Analyzers 基于因子分析的神经网络图像分类器
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S106456242460204X
A. M. Dostovalova, A. K. Gorshenin

The paper develops an approach to probability informing deep neural networks, that is, improving their results by using various probability models within architectural elements. We introduce factor analyzers with additive and impulse noise components as such models. The identifiability of the model is proved. The relationship between the parameter estimates by the methods of least squares and maximum likelihood is established, which actually means that the estimates of the parameters of the factor analyzer obtained within the informed block are unbiased and consistent. A mathematical model is used to create a new architectural element that implements the fusion of multiscale image features to improve classification accuracy in the case of a small volume of training data. This problem is typical for various applied tasks, including remote sensing data analysis. Various widely used neural network classifiers (EfficientNet, MobileNet, and Xception), both with and without a new informed block, are tested. It is demonstrated that on the open datasets UC Merced (remote sensing data) and Oxford Flowers (flower images), informed neural networks achieve a significant increase in accuracy for this class of tasks: the largest improvement in Top-1 accuracy was 6.67% (mean accuracy without informing equals 87.3%), while Top-5 accuracy increased by 1.49% (mean base accuracy value is 96.27%).

本文开发了一种概率通知深度神经网络的方法,即通过在架构元素中使用各种概率模型来改进其结果。我们介绍了以加性和脉冲噪声成分为模型的因子分析仪。证明了模型的可辨识性。建立了最小二乘法和最大似然法的参数估计之间的关系,这实际上意味着在知情块内得到的因子分析仪的参数估计是无偏和一致的。利用数学模型创建新的架构元素,实现多尺度图像特征的融合,在训练数据量小的情况下提高分类精度。这个问题是各种应用任务的典型问题,包括遥感数据分析。测试了各种广泛使用的神经网络分类器(EfficientNet, MobileNet和Xception),无论是否有新的通知块。结果表明,在开放数据集UC Merced(遥感数据)和Oxford Flowers(花卉图像)上,知情神经网络在这类任务上的准确率显著提高:Top-1的准确率最大提高了6.67%(未告知的平均准确率为87.3%),Top-5的准确率提高了1.49%(平均基础准确率值为96.27%)。
{"title":"Neural Network Image Classifiers Informed by Factor Analyzers","authors":"A. M. Dostovalova,&nbsp;A. K. Gorshenin","doi":"10.1134/S106456242460204X","DOIUrl":"10.1134/S106456242460204X","url":null,"abstract":"<p>The paper develops an approach to probability informing deep neural networks, that is, improving their results by using various probability models within architectural elements. We introduce factor analyzers with additive and impulse noise components as such models. The identifiability of the model is proved. The relationship between the parameter estimates by the methods of least squares and maximum likelihood is established, which actually means that the estimates of the parameters of the factor analyzer obtained within the informed block are unbiased and consistent. A mathematical model is used to create a new architectural element that implements the fusion of multiscale image features to improve classification accuracy in the case of a small volume of training data. This problem is typical for various applied tasks, including remote sensing data analysis. Various widely used neural network classifiers (EfficientNet, MobileNet, and Xception), both with and without a new informed block, are tested. It is demonstrated that on the open datasets UC Merced (remote sensing data) and Oxford Flowers (flower images), informed neural networks achieve a significant increase in accuracy for this class of tasks: the largest improvement in Top-1 accuracy was 6.67% (mean accuracy without informing equals 87.3%), while Top-5 accuracy increased by 1.49% (mean base accuracy value is 96.27%).</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S35 - S41"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S106456242460204X.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Solution of the Multimode Nonlinear Schrödinger Equation Using Physics-Informed Neural Networks 利用物理信息神经网络求解多模非线性Schrödinger方程
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602105
I. A. Chuprov, J. Gao, D. S. Efremenko, F. A. Buzaev, V. V. Zemlyakov

Single-mode optical fibers (SMFs) have become the foundation of modern communication systems. However, their capacity is expected to reach its theoretical limit in the near future. The use of multimode fibers (MMF) is seen as one of the most promising solutions to address this capacity deficit. The multimode nonlinear Schrödinger equation (MMNLSE) describing light propagation in MMF is significantly more complex than the equations for SMF, making numerical simulations of MMF-based systems computationally costly and impractical for most realistic scenarios. In this paper, we apply physics-informed neural networks (PINNs) to solve the MMNLSE. We show that a simple implementation of PINNs does not yield satisfactory results. We investigate the convergence of PINN and propose a novel scaling transformation for the zeroth-order dispersion coefficient that allows PINN to account for all important physical effects. Our calculations show good agreement with the Split-Step Fourier (SSF) method for fiber lengths of up to several hundred meters.

单模光纤(SMFs)已成为现代通信系统的基础。然而,它们的容量预计将在不久的将来达到理论极限。多模光纤(MMF)的使用被认为是解决这一容量不足的最有希望的解决方案之一。描述光在MMF中传播的多模非线性Schrödinger方程(MMNLSE)比SMF方程要复杂得多,这使得基于MMF的系统的数值模拟在大多数实际情况下计算成本高昂且不切实际。在本文中,我们应用物理通知神经网络(pinn)来解决MMNLSE问题。我们证明了pin n的简单实现不会产生令人满意的结果。我们研究了PINN的收敛性,并提出了一种新的零阶色散系数的缩放变换,该变换允许PINN考虑所有重要的物理效应。对于长度达几百米的光纤,我们的计算结果与分步傅里叶(SSF)方法很好地吻合。
{"title":"Solution of the Multimode Nonlinear Schrödinger Equation Using Physics-Informed Neural Networks","authors":"I. A. Chuprov,&nbsp;J. Gao,&nbsp;D. S. Efremenko,&nbsp;F. A. Buzaev,&nbsp;V. V. Zemlyakov","doi":"10.1134/S1064562424602105","DOIUrl":"10.1134/S1064562424602105","url":null,"abstract":"<p>Single-mode optical fibers (SMFs) have become the foundation of modern communication systems. However, their capacity is expected to reach its theoretical limit in the near future. The use of multimode fibers (MMF) is seen as one of the most promising solutions to address this capacity deficit. The multimode nonlinear Schrödinger equation (MMNLSE) describing light propagation in MMF is significantly more complex than the equations for SMF, making numerical simulations of MMF-based systems computationally costly and impractical for most realistic scenarios. In this paper, we apply physics-informed neural networks (PINNs) to solve the MMNLSE. We show that a simple implementation of PINNs does not yield satisfactory results. We investigate the convergence of PINN and propose a novel scaling transformation for the zeroth-order dispersion coefficient that allows PINN to account for all important physical effects. Our calculations show good agreement with the Split-Step Fourier (SSF) method for fiber lengths of up to several hundred meters.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S15 - S24"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424602105.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deforming Implicit Neural Representation Generative Adversarial Network for Unsupervised Appearence Editing 变形隐式神经表示生成对抗网络的无监督外观编辑
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602373
S. Ignatiev, V. Egiazarian, R. Rakhimov, E. Burnaev

In this work, we present a new deep generative model for disentangling image shape from its appearance through differentiable warping. We propose to use implicit neural representations for modeling the deformation field and show that coordinate-based representations hold the necessary inductive bias. Unlike the previous warping-based approaches, which tend to model only local and small-scale displacements, our method is able to learn complex deformations and is not restricted to reversible mappings. We study the convergence of warping-based generative models and find that the high-frequency nature of the textures leads to shattered learning gradients, slow convergence, and suboptimal solutions. To cope with this problem, we propose to use invertible blurring, which smooths the gradients and leads to improved results. As a way to further facilitate the convergence of warping, we train the deformation module jointly as a vanilla GAN generator to guide the learning process in a self-distillation manner. Our complete pipeline shows decent results on the LSUN churches dataset. Finally, we demonstrate various applications of our model, like composable texture editing, controllable deformation editing, and keypoint detection.

在这项工作中,我们提出了一种新的深度生成模型,通过可微扭曲将图像形状与其外观分离开来。我们建议使用隐式神经表征来建模变形场,并表明基于坐标的表征具有必要的归纳偏差。与之前的基于翘曲的方法不同,这些方法倾向于只对局部和小尺度位移进行建模,我们的方法能够学习复杂的变形,并且不局限于可逆映射。我们研究了基于翘曲的生成模型的收敛性,发现纹理的高频特性导致了破碎的学习梯度、缓慢的收敛和次优解。为了解决这个问题,我们提出使用可逆模糊,平滑梯度,导致改善的结果。为了进一步促进翘曲的收敛,我们将变形模块作为香草GAN生成器联合训练,以自蒸馏的方式指导学习过程。我们完整的管道在LSUN教堂数据集上显示了不错的结果。最后,我们演示了模型的各种应用,如可组合纹理编辑、可控变形编辑和关键点检测。
{"title":"Deforming Implicit Neural Representation Generative Adversarial Network for Unsupervised Appearence Editing","authors":"S. Ignatiev,&nbsp;V. Egiazarian,&nbsp;R. Rakhimov,&nbsp;E. Burnaev","doi":"10.1134/S1064562424602373","DOIUrl":"10.1134/S1064562424602373","url":null,"abstract":"<p>In this work, we present a new deep generative model for disentangling image shape from its appearance through differentiable warping. We propose to use implicit neural representations for modeling the deformation field and show that coordinate-based representations hold the necessary inductive bias. Unlike the previous warping-based approaches, which tend to model only local and small-scale displacements, our method is able to learn complex deformations and is not restricted to reversible mappings. We study the convergence of warping-based generative models and find that the high-frequency nature of the textures leads to shattered learning gradients, slow convergence, and suboptimal solutions. To cope with this problem, we propose to use invertible blurring, which smooths the gradients and leads to improved results. As a way to further facilitate the convergence of warping, we train the deformation module jointly as a vanilla GAN generator to guide the learning process in a self-distillation manner. Our complete pipeline shows decent results on the LSUN churches dataset. Finally, we demonstrate various applications of our model, like composable texture editing, controllable deformation editing, and keypoint detection.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S299 - S311"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424602373.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CRAFT: Cultural Russian-Oriented Dataset Adaptation for Focused Text-to-Image Generation CRAFT:以俄语文化为导向的数据集改编,用于文本到图像的集中生成
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602324
V. A. Vasilev, V. S. Arkhipkin, J. D. Agafonova, T. V. Nikulina, E. O. Mironova, A. A. Shichanina, N. A. Gerasimenko, M. A. Shoytov, D. V. Dimitrov

Despite the fact that popular text-to-image generation models cope well with international and general cultural queries, they have a significant knowledge gap regarding individual cultures. This is due to the content of existing large training datasets collected on the Internet, which are predominantly based on Western European or American popular culture. Meanwhile, the lack of cultural adaptation of the model can lead to incorrect results, a decrease in the generation quality, and the spread of stereotypes and offensive content. In an effort to address this issue, we examine the concept of cultural code and recognize the critical importance of its understanding by modern image generation models, an issue that has not been sufficiently addressed in the research community to date. We propose the methodology for collecting and processing the data necessary to form a dataset based on the cultural code, in particular the Russian one. We explore how the collected data affects the quality of generations in the national domain and analyze the effectiveness of our approach using the Kandinsky 3.1 text-to-image model. Human evaluation results demonstrate an increase in the level of awareness of Russian culture in the model.

尽管流行的文本到图像生成模型可以很好地处理国际和一般文化查询,但它们在个体文化方面存在显著的知识差距。这是由于在互联网上收集的现有大型训练数据集的内容主要基于西欧或美国流行文化。同时,缺乏对模型的文化适应,会导致不正确的结果,导致生成质量下降,以及刻板印象和攻击性内容的传播。为了解决这个问题,我们研究了文化代码的概念,并认识到现代图像生成模型对其理解的重要性,这是一个迄今为止在研究界尚未得到充分解决的问题。我们提出了收集和处理必要数据的方法,以形成基于文化代码的数据集,特别是俄罗斯文化代码。我们探讨了收集的数据如何影响国家领域的世代质量,并使用Kandinsky 3.1文本到图像模型分析了我们方法的有效性。人的评价结果表明,在该模型中,俄罗斯文化的意识水平有所提高。
{"title":"CRAFT: Cultural Russian-Oriented Dataset Adaptation for Focused Text-to-Image Generation","authors":"V. A. Vasilev,&nbsp;V. S. Arkhipkin,&nbsp;J. D. Agafonova,&nbsp;T. V. Nikulina,&nbsp;E. O. Mironova,&nbsp;A. A. Shichanina,&nbsp;N. A. Gerasimenko,&nbsp;M. A. Shoytov,&nbsp;D. V. Dimitrov","doi":"10.1134/S1064562424602324","DOIUrl":"10.1134/S1064562424602324","url":null,"abstract":"<p>Despite the fact that popular text-to-image generation models cope well with international and general cultural queries, they have a significant knowledge gap regarding individual cultures. This is due to the content of existing large training datasets collected on the Internet, which are predominantly based on Western European or American popular culture. Meanwhile, the lack of cultural adaptation of the model can lead to incorrect results, a decrease in the generation quality, and the spread of stereotypes and offensive content. In an effort to address this issue, we examine the concept of cultural code and recognize the critical importance of its understanding by modern image generation models, an issue that has not been sufficiently addressed in the research community to date. We propose the methodology for collecting and processing the data necessary to form a dataset based on the cultural code, in particular the Russian one. We explore how the collected data affects the quality of generations in the national domain and analyze the effectiveness of our approach using the Kandinsky 3.1 text-to-image model. Human evaluation results demonstrate an increase in the level of awareness of Russian culture in the model.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S137 - S150"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Doklady Mathematics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1