?
Structure-adaptive Manifold Estimation
Journal of Machine Learning Research. 2022. Vol. 23. No. 40. P. 1–62.
We consider a problem of manifold estimation from noisy observations. Many manifold learning procedures locally approximate a manifold by a weighted average over a small neighborhood. However, in the presence of large noise, the assigned weights become so corrupted that the averaged estimate shows very poor performance. We suggest a structure-adaptive procedure, which simultaneously reconstructs a smooth manifold and estimates projections of the point cloud onto this manifold. The proposed approach iteratively refines the weights on each step, using the structural information obtained at previous steps. After several iterations, we obtain nearly “oracle” weights, so that the final estimates are nearly efficient even in the presence of relatively large noise. In our theoretical study, we establish tight lower and upper bounds proving asymptotic optimality of the method for manifold estimation under the Hausdorff loss, provided that the noise degrades to zero fast enough.
Piliugin L., Antropov A., Lobashev E. et al., Journal of Nuclear Materials 2026 Vol. 632 Article 156876
The effects of dislocations on the mobility of gas nanobubbles pinned to them are considered as novel unex- plored mechanisms of accelerated fission gas release and investigated using classical molecular dynamics of helium bubbles in FCC aluminum. Non-equilibrium methods are developed to calculate the mobility of a pinned bubble both along and across the dislocation ...
Added: September 28, 2026
Kashpurovich I., Oleynichenko A., Stegailov V., Supercomputing Frontiers and Innovations 2026 Vol. 13 No. 1 P. 52–73
We report a high-performance implementation of the resolution-of-the-identity Hartree–Fock method that fully exploits the permutational symmetry of three-center electron repulsion integrals (ERI). The present implementation adopts a hybrid MPI+OpenMP parallelization strategy. Two different algorithmic approaches (with and without the pre-transformation of ERIs) are compared. A custom data layout introduced previously is employed. Designed to efficiently ...
Added: September 28, 2026
Teregulov T., Loubenets E. R., / Series Quantum Physics "arXiv". 2026. No. 2609.31472.
We develop a new three-party quantum secret-sharing (QSS) protocol based on a three-qubit W state. This protocol encodes the secret-sequence bits using X gates and employs randomly selected Hadamard operations and measurement bases to generate information and security-test rounds. We evaluate the efficiency of the proposed protocol and analyze its security against an internal adversary ...
Added: September 28, 2026
Silakov D., Системный администратор 2026 С. 84–89
Social media users rarely think about what lies behind the beautiful facade of activity feeds, teeming with photos and video stories. However, the widespread popularity of such platforms generates a huge amount of all sorts of content that needs to be stored, processed quickly, and displayed, and in the era of AI, it also needs ...
Added: September 28, 2026
Prokhorov A., Wei Z., Sang H. et al., Journal of Productivity Analysis 2026 Vol. 65 P. 1–16
The stochastic frontier model (SFM) is widely employed in the analysis of productivity and efficiency, yet strict parametric forms, such as the Cobb-Douglas and Translog functions, are often assumed for modeling production, leading to potential misspecification issues. While semi- and nonparametric SFMs offer greater flexibility, they face challenges in imposing monotonicity and concavity to maintain ...
Added: September 28, 2026
Guterman A., Jonoska N., Kreines E. et al., Proceedings of the Edinburgh Mathematical Society 2026 Vol. 69 No. 3 P. 1041–1057
We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative to its size. These conditions serve to prove the conjecture that such a maximum, which is equal to 𝐹_(2𝑛+1) −1, ...
Added: September 27, 2026
Qian X., Guan X., Zhang B. et al., Journal of Global Optimization 2026
Inverse quickest path problem on networks ...
Added: September 27, 2026
Shishkina E., Современная математика. Фундаментальные направления 2026 Т. 72 № 1 С. 52–67
In this paper, we construct a weighted Sobolev space of fractional order based on the
generalized Bessel potential.We apply these results to the analysis of the singular fractional Schr¨odinger
equation. To solve the Cauchy problem for this equation, we prove an estimate that relates the norm of
the solution to the norm of the initial condition in the ...
Added: September 26, 2026
Shishkina E., Computational Mathematics and Mathematical Physics 2026 Vol. 66 No. 5 P. 804–815
This article demonstrates that the Laplace–Bessel operator generates a strongly continuous
semigroup on a weighted Lebesgue space. Using this semigroup, we define the fractional Laplace–
Bessel operator via Balakrishnan’s formula. Furthermore, we derive three distinct representations for
fractional powers of the negative Laplace–Bessel operator. ...
Added: September 26, 2026
Kolokoltsov V., Shishkina E., Journal of Theoretical Probability 2026 P. 39–83
In this paper, we introduce a new construction of fractional derivatives and integrals
with respect to a function, based on a matrix approach. We believe that this is a powerful
tool in both analytical and numerical calculations.We begin with the differential
operator with respect to a function that generates a semigroup. By discretizing this
operator, we obtain a matrix ...
Added: September 26, 2026
Switzerland: Springer Cham, 2026.
This volume gathers selected, peer-reviewed contributions presented at the 19th Conference of the International Federation of Classification Societies (IFCS 2026), held on 14–16 July 2026 in Milan, Italy. Reflecting the volume’s motto, Navigating Complexity – Statistical Methods, Data Analysis, and Machine Learning for Actionable Insights, the papers showcase modern methodologies and real-world applications designed to extract ...
Added: September 25, 2026
Petr Kucheriaviy, Bulletin of the Australian Mathematical Society 2026
We prove that an analogue of Rogers’ theorem on sieving holds for an order if and only if the order is a Dedekind domain. We also prove that it holds for a finite commutative ring if and only if the ring is a direct product of local rings with linearly ordered ideals. ...
Added: September 25, 2026
Kraevskiy A., Sokolovskiy E., Prokhorov A., Emerging Markets Review 2026 No. 74 P. 1–19
Financial markets of emerging economies are vulnerable to extreme and cascading information spillovers, surges, sudden stops and reversals. With this in mind, we develop a new online early warning system (EWS) to detect what is referred to as ‘concept drift’ in machine learning, as a ‘regime shift’ in economics and as a ‘change-point’ in statistics. ...
Added: September 25, 2026
Пелевин Ф. Е., Математические заметки 2026 Т. 120 № 1 С. 159–163
Две не равные тождественно нулю функции (последовательности элементов некоторого поля) будем называть эквивалентными, если они удовлетворяют функциональному уравнению типа теорем сложения тэта-функций. Основной результат работы состоит в том, что рассматриваемое отношение действительно является отношением эквивалентности. ...
Added: September 25, 2026
Shimanogov I. N., Vyalyi M., Siberian Mathematical Journal 2026 Vol. 67 No. 5 P. 1203–1212
We consider a class of Boolean algebras formed by intersections of regular languages with
a given language. In the case where such an algebra is isomorphic to the algebra of regular languages,
we prove the existence of an isomorphism that is computable using oracles for the regular realizability
problem and the infinite regular realizability problem. This result yields ...
Added: September 25, 2026
Дубич Е. В., Schagin D., Славянский форум 2026 № 2 (52) С. 560–565
The paper compares HTTP/2 and HTTP/3 for static resource transfer under software-simulated network degradation. The experiment shows that HTTP/3 is not universally faster, but it is more stable as latency and packet loss increase. ...
Added: September 25, 2026
Ramazanov I., Bukh A., Shepelev Igor A., Chaos 2026 No. 36 P. 083150–083150
We investigate how stochastic Poisson impulsive forcing influences the spatiotemporal dynamics of a two-dimensional network of Hindmarsh–Rose neurons. Unlike continuous noise, impulsive forcing introduces discrete, state-dependent perturbations, making the system response highly sensitive to both the statistics and the spatial structure of the input. In most of the parameter space, stochastic impulses destabilize the initial ...
Added: September 24, 2026
Joulitov A.K., Lomazova I.A., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4(2) P. 215–224
In process mining, DFG (Directly-Follows Graph) models are popular due to their simplicity and clarity. However, if a process is acyclic but contains concurrent events, standard algorithms for discovering DFG models can generate "fake" cycles that do not actually exist in the event log. These cycles hinder the analysis of information processes, significantly reducing the ...
Added: September 24, 2026
Kachan O., Yanovich Y., Abramov E., Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki 2018 Vol. 160 No. 2 P. 300–308
According to the manifold hypothesis, high-dimensional data can be viewed and meaning- fully represented as a lower-dimensional manifold embedded in a higher dimensional feature space. Manifold learning is a part of machine learning where an intrinsic data representation is uncovered based on the manifold hypothesis.
Many manifold learning algorithms were developed. The one called Grassmann&Stiefel eigenmaps ...
Added: January 21, 2026
Nikita Puchkin, Vladimir Spokoiny, Eugene Stepanov et al., ESAIM - Control, Optimisation and Calculus of Variations 2024 Vol. 30 Article 3
We consider the problem of reconstructing an embedding of a compact connected Riemannian manifold in a Euclidean space up to an almost isometry, given the information on intrinsic distances between points from its “sufficiently large” subset. This is one of the classical manifold learning problems. It happens that the most popular methods to deal with ...
Added: February 2, 2024
Puchkin N., Zhivotovskiy N., , in: Proceedings of Machine Learning Research: Volume 195: The Thirty Sixth Annual Conference on Learning Theory, 12-15 July 2023, Bangalore, IndiaVol. 195: The Thirty Sixth Annual Conference on Learning Theory, 12-15 July 2023, Bangalore, India.: PMLR, 2023. P. 1993–2013.
We consider the standard problem of stochastic convex optimization with exp-concave losses using Empirical Risk Minimization in a convex class. Answering a question raised in several prior works, we provide a 𝑂(𝑑/𝑛 + 1/𝑛 log(1/𝛿)) excess risk bound valid for a wide class of bounded exp-concave losses, where 𝑑 is the dimension of the convex reference set, 𝑛 is the sample ...
Added: August 2, 2023
Alanov A., Kochurov M., Volkhonskiy D. et al., , in: Proceedings of the 15th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISAPP 2020)Vol. 4.: SciTePress, 2020. P. 214–221.
We propose a novel multi-texture synthesis model based on generative adversarial networks (GANs) with a user-controllable mechanism. The user control ability allows to explicitly specify the texture which should be generated by the model. This property follows from using an encoder part which learns a latent representation for each texture from the dataset. To ensure ...
Added: November 8, 2020
Kachan O. N., Yanovich Y., Abramov E., Ученые записки Казанского университета. Серия: Физико-математические науки 2018 Vol. 160 No. 2 P. 300–308
According to the manifold hypothesis, high-dimensional data can be viewed and meaningfully represented as a lower-dimensional manifold embedded in a higher dimensional feature space. Manifold learning is a part of machine learning where an intrinsic data representation is uncovered based on the manifold hypothesis.
Many manifold learning algorithms were developed. The one called Grassmann & Stiefel eigenmaps (GSE) ...
Added: October 29, 2020
Abramov E., Yanovich Y., Ученые записки Казанского университета. Серия: Физико-математические науки 2018 Vol. 160 No. 2 P. 220–228
Real data are usually characterized by high dimensionality. However, real data obtained from real sources, due to the presence of various dependencies between data points and limitations on their possible values, form, as a rule, form a small part of the high-dimensional space of observations. The most common model is based on the hypothesis that ...
Added: October 29, 2020