?
Solving Smooth Min-Min and Min-Max Problems by Mixed Oracle Algorithms
Communications in Computer and Information Science. 2021. Vol. 1476. P. 19–40.
In this paper, we consider two types of problems that have some similarity in their structure, namely, min-min problems and min-max saddle-point problems. Our approach is based on considering the outer minimization problem as a minimization problem with an inexact oracle. This inexact oracle is calculated via an inexact solution of the inner problem, which is either minimization or maximization problem. Our main assumption is that the available oracle is mixed: it is only possible to evaluate the gradient w.r.t. the outer block of variables which corresponds to the outer minimization problem, whereas for the inner problem, only zeroth-order oracle is available. To solve the inner problem, we use the accelerated gradient-free method with zeroth-order oracle. To solve the outer problem, we use either an inexact variant of Vaidya’s cutting-plane method or a variant of the accelerated gradient method. As a result, we propose a framework that leads to non-asymptotic complexity bounds for both min-min and min-max problems. Moreover, we estimate separately the number of first- and zeroth-order oracle calls, which are sufficient to reach any desired accuracy.
Aleksei Samarin, Nazarenko A., Nazarenko D. et al., Machine Learning and Knowledge Extraction 2026 Vol. 8 No. 10 Article 330
Automated microscopic image analysis is essential for quantitative microbiology, yet manual acquisition and generic recognition models struggle with morphological variability and scene artifacts. We address both ends of this pipeline. First, we present a low-cost, open-source acquisition system, based on an Arduino UNO R3 microcontroller and NEMA 17 stepper motors, that automates focusing, magnification, and ...
Added: October 14, 2026
Parkhomenko V., Kulikova S., Buzmakov A. V., Lobachevskii Journal of Mathematics 2026 Vol. 47 No. 6 P. 2979–2992
The stability of formal concepts and its generalization as robustness are considered in the paper. We use an approximation of stability in the form of Δ-measure for fast calculations. A computationally efficient method for calculating robustness based on subcontexts is presented. We also present a new method to analytically evaluate the number of preimages for ...
Added: October 14, 2026
Kuznetsov A. P., Sedova Y. V., Sataev I. R. et al., Mathematics and Computers in Simulation 2027 Vol. 2 P. 574–592
Universal bifurcation structures on the parameter plane of nonlinear systems, known as shrimps, are discussed. An overview of numerous examples from various fields of science is given. Shrimps are typical for both maps of different dimensions and flows. The varieties of shrimp are discussed and relevant examples are given. The similarity property on the parameter ...
Added: October 14, 2026
Gusein-Zade S., Campillo A., Delgado F., Mathematische Zeitschrift 2026 Vol. 314 No. 1 P. 1–22
For a subfield $\K$ of the field $\C$ of complex numbers, we consider curve and divisorial valuations on the algebra $\K[[x,y]]$ of formal power series in two variables with the coefficients in $\K$. We compute the semigroup Poincar\'e series and the classical Poincar\'e series of a (discrete, rank one) valuation on it. ...
Added: October 13, 2026
Mishuris G., Meylan M. H., Pelinovsky E., Journal of Fluid Mechanics 2026 Vol. 1045 Article A4
In this paper, we revisit the classic problem of a wave field on a sloping beach of an arbitrary angle and propose a general approach that allows the computation of regular solutions of the problem regardless of the angle. We use the Mellin-transform technique, reducing the problem to singular integral equations with fixed-point singularities of ...
Added: October 12, 2026
Gusein-Zade S., М.: МЦНМО, 2026.
Книга содержит курс лекций по дифференциальной геометрии и топологии, читавшихся автором на механико-математическом факультете МГУ в разные годы. В дополнениях приводятся некоторые сюжеты (связности в расслоениях, теорема Фробениуса, производные Ли и др.), которые были включены в курс в отдельные годы либо содержались в аналогичных курсах лекций в Независимом московском университете.
Для студентов математических и физических специальностей. ...
Added: October 12, 2026
Брычков М. Е., Незнанов А.А., Программирование 2026 № 4 С. 50–66
The matrix profile (MP) quickly became one of the most important time series preprocessing methods when it was introduced in 2016, facilitating the solution of a wide range of time series analysis problems, in particular anomaly and pattern detection problems. The high significance has led to the emergence of various tools for MP calculating, but ...
Added: October 9, 2026
М.: Юрайт, 2026.
The Collection of Olympiad Problems (COP) in Probability Theory and Mathematical Statistics (PTMS) is offered as a teaching aid primarily for university students and faculty as a developmental supplementary resource, expanding the range of problems to be solved in lectures, seminars, and out-of-class independent work with students in various formats, including (as the title suggests) ...
Added: October 9, 2026
Aleskerov F. T., Вайншток А. П., Делахова А. М. et al., Информационные процессы 2026 Т. 26 № 3 С. 895–913
The development and effective management of territorial entities are priority issues for all states, particularly in the context of the digital transformation of public administration. Over the past decade, the integration of information technologies into municipal and regional planning has significantly altered approaches to strategic development, service delivery, and public engagement. This paper describes the ...
Added: October 9, 2026
Kupavskii A., Noskov F., Forum of Mathematics, Sigma 2026 Vol. 14 Article 124
We call a family of $s$ sets $\{F_1, \ldots, F_s\}$ a sunflower with $s$ petals if, for any distinct $i, j \in [s]$, one has $F_i \cap F_j = \cap_{u = 1}^s F_u$. The set $C = \cap_{u = 1}^s F_u$ is called the {\it core} of the sunflower. It is a classical result of ...
Added: October 8, 2026
Flamarion M. V., Pelinovsky E., Chaos, Solitons and Fractals 2026 Vol. 213 No. 2 Article 119245
This article concerns the study of modulational instability in the rotated-modified Gardner–Whitham (rmGW) equation. This model incorporates both quadratic and cubic nonlinearities, similarly to the Gardner equation, while also retaining the fully dispersive character of the Whitham equation together with a large-scale dispersive term analogous to that in the Ostrovsky equation. Using a classical multiple-scale asymptotic expansion, we ...
Added: October 8, 2026
Люксембург А. А., УРСС, 2005.
Изучается возможность автоматизированного построения математических теорий. Рассматривается дедуктивная система, основанная на языке логики предикатов первого порядка, объектами системы являются математические выражения или формулы, которые описывают математические объекты или их свойства. В дедуктивной системе выводятся математические определения и теоремы. Для доказательства теорем используются методы автоматического доказательства. Разработан алгоритм, выводящий часть формул системы. Для решения задачи используется аппарат математической ...
Added: October 7, 2026
Aleskerov F. T., Chaika E., Дерендяев А. Б. et al., Procedia Computer Science 2026 No. 287 P. 590–595
Under conditions of dynamic socio-economic changes, effective planning and decision-making are key factors in ensuring a high quality of life for the population in territories. This paper presents a decision support system for territorial administrations for the development and implementation of sustainable development strategies, using one of the regions of the Russian Federation – the ...
Added: October 7, 2026
Bernardin C., Gonçalves P., Olla S., Mathematical Physics Analysis and Geometry 2024 Vol. 27 No. 7
We consider the macroscopic limit for the space-time density fluctuations in the open symmetric simple exclusion in the quasi-static scaling limit. We prove that the distribution of these fluctuations converge to a gaussian space-time field that is delta correlated in time but with long-range correlations in space. ...
Added: October 6, 2026
Bernardin C., Chhaibi R., Najnudel J. et al., Probability Theory and Related Fields 2026 Vol. 195 P. 1823–1875
We study the celebrated Shiryaev-Wonham filter (Wonham, W.M., in J. Soc. Ind. Appl. Math. 347–369, 1964) in its historical setup, where the hidden Markov jump process has two states. We are interested in the weak noise regime for the observation equation. Interestingly, this becomes a strong noise regime for the filtering equations. Earlier results of ...
Added: October 5, 2026
Ismailov A., Spiridonov V., Успехи математических наук 2026 Т. 81 № 5 С. 183–184
Получена новая формула для цепной дроби Аски–Вильсона в форме отношения двух q-гипер-геометрических рядов. ...
Added: October 5, 2026
Beznosikov A., Kormakov G., Grigorievskiy A. et al., Journal of Optimization Theory and Applications 2026 Vol. 209 Article 18
The objective of Vertical Federated Learning (VFL) is to collectively train a model using features available on different devices while sharing the same users. This paper focuses on the saddle point reformulation of the VFL problem via the classical Lagrangian function. We first demonstrate how this formulation can be solved using deterministic methods.More importantly, we explore various stochastic modifications to ...
Added: June 17, 2026
Statkevich E., Bondar S., Dvinskikh D. et al., Chaos, Solitons and Fractals: X 2024 Vol. 185 Article 115048
This paper focuses on solving a stochastic saddle point problem (SPP) under an overparameterized regime for the case, when the gradient computation is impractical. As an intermediate step, we generalize Same-sample Stochastic Extra-gradient algorithm (Gorbunov et al., 2022) to a biased oracle and estimate novel convergence rates. As the result of the paper we introduce ...
Added: February 7, 2025
Gladin E., Sadiev A., Gasnikov A. et al., , in: Mathematical Optimization Theory and Operations Research: 20th International Conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021, Proceedings.: Cham: Springer, 2021. P. 19–40.
In this paper, we consider two types of problems that have some similarity in their structure, namely, min-min problems and min-max saddle-point problems. Our approach is based on considering the outer minimization problem as a minimization problem with an inexact oracle. This inexact oracle is calculated via an inexact solution of the inner problem, which ...
Added: November 29, 2024
Gladin E., Alkousa M., Gasnikov A., Automation and Remote Control 2021 Vol. 82 P. 1679–1691
The article deals with some approaches to solving convex problems of the min-min type with smoothness and strong convexity in only one of the two groups of variables. It is shown that the proposed approaches based on Vaidya’s method, the fast gradient method, and the accelerated gradient method with variance reduction have linear convergence. It ...
Added: November 29, 2024
Gladin E., Gasnikov A., Ermakova E., Mathematical notes 2022 Vol. 112 No. 1 P. 183–190
The paper deals with a general problem of convex stochastic optimization in a space of small dimension (for example, 100 variables). It is known that for deterministic problems of convex optimization in small dimensions, the methods of centers of gravity type (for example, Vaidya’s method) provide the best convergence. For stochastic optimization problems, the question ...
Added: November 29, 2024
Gladin E., Gasnikov A., Dvurechensky P., Journal of Optimization Theory and Applications 2025 Vol. 204 No. 1 Article 1
Accuracy certificates for convex minimization problems allow for online verification of the accuracy of approximate solutions and provide a theoretically valid online stopping criterion. When solving the Lagrange dual problem, accuracy certificates produce a simple way to recover an approximate primal solution and estimate its accuracy. In this paper, we generalize accuracy certificates for the ...
Added: November 29, 2024
Gladin E., Borodich E., Computer Research and Modeling 2022 Vol. 14 No. 2 P. 257–275
The paper is devoted to convex-concave saddle point problems where the objective is a sum of a large number of functions. Such problems attract considerable attention of the mathematical community due to the variety of applications in machine learning, including adversarial learning, adversarial attacks and robust reinforcement learning, to name a few. The individual functions ...
Added: November 29, 2024
Rogozin A., Beznosikov A., Dvinskikh D. et al., Optimization Methods and Software 2025 Vol. 40 No. 5 P. 1127–1152
We consider smooth convex-concave saddle point problems in the decentralized distributed setting, where a finite-sum objective is distributed among the nodes of a computational network. At each node, the local objective depends on the groups of local and global variables. For such problems, we propose a decentralized distributed algorithm with O(ϵ−1) communication and oracle calls complexities to ...
Added: March 26, 2024