arXiv subjects

Andrey Morozov

Publications and source records attributed to Andrey Morozov.

At least 19 recordsLinked to original sources

arXiv2026

Limits of the inverse scattering problem

The main goal of tomography is the reconstruction of density function out of its line integrals (integral measurements of this density along x-ray lines). Such construction is possible and known as inverse x-ray/Radon transformations. We are interested in generalization of this problem to the case of particles. For this we need to limit the speed of these particles, otherwise the problem is reduced to the previous one. The question we discuss in this paper is how low can this speed be depending on the parameters of the studied potential. We study this problem using simple theoretical examples and Machine Learning pipeline to restore the potential.

hep-th↗

arXiv2026

Ising anyons in the $SU(2)_2$ Chern--Simons theory

The present work is motivated by the statement that the Ising minimal model $\mathcal{M}(4,3)$ is equivalent, at the level of observables, to the $SU(2)_2$ Chern--Simons theory. At first glance, however, these two theories appear to differ substantially. For instance, the number of irreducible highest-weight representations does not match the number of Ising anyons. For tensor products of low degree, these discrepancies are examined in this work. While representation structure differs, it does not affect the observables underlying topological quantum computation algorithms.

hep-th↗

arXiv2026

Entangling gates for the SU(N) anyons

The model of a topological quantum computer is a promising one due to its natural resistance to noise and other errors. Operations in such a computer are implemented by braiding the trajectories of anyons. While it is easy to understand how to build one-qubit operations, two-qubit operations are more difficult. In arXiv:2412.20931 we suggested an approach to build such operations for a topological quantum computer based on SU(2) Chern-Simons theory with arbitrary level using cabling of knots. In this paper we discuss how this approach should be generalized to the SU(N) case, what the differences are, and which new problems arise.

hep-th↗

arXiv2026

Racah matrices for the symmetric representation of the SO(5) group

Approaches to calculate SU(N) colored knot invariants (HOMFLY-PT polynomials) are well and widely developed. However, SO(N) case is mostly forgotten. With this paper we want to start the discusion of how to generalize Reshetikhin-Turaev approach to the SO(2n+1) case and which difficutlies arise in this discussion. We provide R and Racah matrices for the symmetric representation of the SO(5) group and show how to find the corresponding Kauffmann polynomials.

hep-th↗

arXiv2026

RAMSeS: Robust and Adaptive Model Selection for Time-Series Anomaly Detection Algorithms

Time-series data vary widely across domains, making a universal anomaly detector impractical. Methods that perform well on one dataset often fail to transfer because what counts as an anomaly is context dependent. The key challenge is to design a method that performs well in specific contexts while remaining adaptable across domains with varying data complexities. We present the Robust and Adaptive Model Selection for Time-Series Anomaly Detection RAMSeS framework. RAMSeS comprises two branches: (i) a stacking ensemble optimized with a genetic algorithm to leverage complementary detectors. (ii) An adaptive model-selection branch identifies the best single detector using techniques including Thompson sampling, robustness testing with generative adversarial networks, and Monte Carlo simulations. This dual strategy exploits the collective strength of multiple models and adapts to dataset-specific characteristics. We evaluate RAMSeS and show that it outperforms prior methods on F1.

cs.DB↗

arXiv2025

Stylized Synthetic Augmentation further improves Corruption Robustness

This paper proposes a training data augmentation pipeline that combines synthetic image data with neural style transfer in order to address the vulnerability of deep vision models to common corruptions. We show that although applying style transfer on synthetic images degrades their quality with respect to the common Frechet Inception Distance (FID) metric, these images are surprisingly beneficial for model training. We conduct a systematic empirical analysis of the effects of both augmentations and their key hyperparameters on the performance of image classifiers. Our results demonstrate that stylization and synthetic data complement each other well and can be combined with popular rule-based data augmentation techniques such as TrivialAugment, while not working with others. Our method achieves state-of-the-art corruption robustness on several small-scale image classification benchmarks, reaching 93.54%, 74.9% and 50.86% robust accuracy on CIFAR-10-C, CIFAR-100-C and TinyImageNet-C, respectively

cs.CV↗

arXiv2025

Advanced Strategies for Uncertainty-Guided Live Measurement Sequencing in Fast, Robust SAR ADC Linearity Testing

This paper builds on our Uncertainty-Guided Live Measurement Sequencing (UGLMS) method. UGLMS is a closed-loop test strategy that adaptively selects SAR ADC code edges based on model uncertainty and refines a behavioral mismatch model in real time via an Extended Kalman Filter (EKF), eliminating full-range sweeps and offline post-processing. We introduce an enhanced UGLMS that delivers significantly faster test runtimes while maintaining estimation accuracy. First, a rank-1 EKF update replaces costly matrix inversions with efficient vector operations, and a measurement-aligned covariance-inflation strategy accelerates convergence under unexpected innovations. Second, we extend the static mismatch model with a low-order carrier polynomial to capture systematic nonlinearities beyond pure capacitor mismatch. Third, a trace-based termination adapts test length to convergence, preventing premature stops and redundant iterations. Simulations show the enhanced UGLMS reconstructs full Integral- and Differential-Non-Linearity (INL/DNL) in just 36 ms for 16-bit and under 70 ms for 18-bit ADCs (120 ms with the polynomial extension). Combining the faster convergence from covariance inflation with reduced per-iteration runtime from the rank-1 EKF update, the method reaches equal accuracy 8x faster for 16-bit ADCs. These improvements enable real-time, production-ready SAR ADC linearity testing.

cs.AR↗

arXiv2025

Uncertainty-Guided Live Measurement Sequencing for Fast SAR ADC Linearity Testing

This paper introduces a novel closed-loop testing methodology for efficient linearity testing of high-resolution Successive Approximation Register (SAR) Analog-to-Digital Converters (ADCs). Existing test strategies, including histogram-based approaches, sine wave testing, and model-driven reconstruction, often rely on dense data acquisition followed by offline post-processing, which increases overall test time and complexity. To overcome these limitations, we propose an adaptive approach that utilizes an iterative behavioral model refined by an Extended Kalman Filter (EKF) in real time, enabling direct estimation of capacitor mismatch parameters that determine INL behavior. Our algorithm dynamically selects measurement points based on current model uncertainty, maximizing information gain with respect to parameter confidence and narrowing sampling intervals as estimation progresses. By providing immediate feedback and adaptive targeting, the proposed method eliminates the need for large-scale data collection and post-measurement analysis. Experimental results demonstrate substantial reductions in total test time and computational overhead, highlighting the method's suitability for integration in production environments.

cs.AR↗

arXiv2025

LiHRA: A LiDAR-Based HRI Dataset for Automated Risk Monitoring Methods

We present LiHRA, a novel dataset designed to facilitate the development of automated, learning-based, or classical risk monitoring (RM) methods for Human-Robot Interaction (HRI) scenarios. The growing prevalence of collaborative robots in industrial environments has increased the need for reliable safety systems. However, the lack of high-quality datasets that capture realistic human-robot interactions, including potentially dangerous events, slows development. LiHRA addresses this challenge by providing a comprehensive, multi-modal dataset combining 3D LiDAR point clouds, human body keypoints, and robot joint states, capturing the complete spatial and dynamic context of human-robot collaboration. This combination of modalities allows for precise tracking of human movement, robot actions, and environmental conditions, enabling accurate RM during collaborative tasks. The LiHRA dataset covers six representative HRI scenarios involving collaborative and coexistent tasks, object handovers, and surface polishing, with safe and hazardous versions of each scenario. In total, the data set includes 4,431 labeled point clouds recorded at 10 Hz, providing a rich resource for training and benchmarking classical and AI-driven RM algorithms. Finally, to demonstrate LiHRA's utility, we introduce an RM method that quantifies the risk level in each scenario over time. This method leverages contextual information, including robot states and the dynamic model of the robot. With its combination of high-resolution LiDAR data, precise human tracking, robot state data, and realistic collision events, LiHRA offers an essential foundation for future research into real-time RM and adaptive safety strategies in human-robot workspaces.

cs.RO↗

arXiv2025

Combined Image Data Augmentations diminish the benefits of Adaptive Label Smoothing

Soft augmentation regularizes the supervised learning process of image classifiers by reducing label confidence of a training sample based on the magnitude of random-crop augmentation applied to it. This paper extends this adaptive label smoothing framework to other types of aggressive augmentations beyond random-crop. Specifically, we demonstrate the effectiveness of the method for random erasing and noise injection data augmentation. Adaptive label smoothing permits stronger regularization via higher-intensity Random Erasing. However, its benefits vanish when applied with a diverse range of image transformations as in the state-of-the-art TrivialAugment method, and excessive label smoothing harms robustness to common corruptions. Our findings suggest that adaptive label smoothing should only be applied when the training data distribution is dominated by a limited, homogeneous set of image transformation types.

cs.CV↗

arXiv2025

Dynamic Risk Assessment for Human-Robot Collaboration Using a Heuristics-based Approach

Human-robot collaboration (HRC) introduces significant safety challenges, particularly in protecting human operators working alongside collaborative robots (cobots). While current ISO standards emphasize risk assessment and hazard identification, these procedures are often insufficient for addressing the complexity of HRC environments, which involve numerous design factors and dynamic interactions. This publication presents a method for objective hazard analysis to support Dynamic Risk Assessment, extending beyond reliance on expert knowledge. The approach monitors scene parameters, such as the distance between human body parts and the cobot, as well as the cobot`s Cartesian velocity. Additionally, an anthropocentric parameter focusing on the orientation of the human head within the collaborative workspace is introduced. These parameters are transformed into hazard indicators using non-linear heuristic functions. The hazard indicators are then aggregated to estimate the total hazard level of a given scenario. The proposed method is evaluated using an industrial dataset that depicts various interactions between a human operator and a cobot.

cs.RO↗

arXiv2024

Entangling gates from cabling of knots

While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and effectiveness. In this paper we discuss how to construct an efficient realization of a two qubit gate in topological quantum computer, by using principle of cabling from the knot theory. This allows to construct a braiding of cables dependent on the parameters of the theory where there is a low probability of moving out of computational space (high fidelity of operation) while there is a non-trivial entangling two-qubit operation. We also present some examples of these operations for different parameters of the theory.

quant-ph↗

arXiv2024

Direct proof of one-hook scaling property for Alexander polynomial from Reshetikhin-Turaev formalism

We prove that normalized colored Alexander polynomial (the $A \rightarrow 1$ limit of colored HOMFLY-PT polynomial) evaluated for one-hook (L-shape) representation R possesses scaling property: it is equal to the fundamental Alexander polynomial with the substitution $q \rightarrow q^{|R|}$. The proof is simple and direct use of Reshetikhin-Turaev formalism to get all required R-matrices.

math-ph↗

arXiv2024

A practical approach to evaluating the adversarial distance for machine learning classifiers

Robustness is critical for machine learning (ML) classifiers to ensure consistent performance in real-world applications where models may encounter corrupted or adversarial inputs. In particular, assessing the robustness of classifiers to adversarial inputs is essential to protect systems from vulnerabilities and thus ensure safety in use. However, methods to accurately compute adversarial robustness have been challenging for complex ML models and high-dimensional data. Furthermore, evaluations typically measure adversarial accuracy on specific attack budgets, limiting the informative value of the resulting metrics. This paper investigates the estimation of the more informative adversarial distance using iterative adversarial attacks and a certification approach. Combined, the methods provide a comprehensive evaluation of adversarial robustness by computing estimates for the upper and lower bounds of the adversarial distance. We present visualisations and ablation studies that provide insights into how this evaluation method should be applied and parameterised. We find that our adversarial attack approach is effective compared to related implementations, while the certification method falls short of expectations. The approach in this paper should encourage a more informative way of evaluating the adversarial robustness of ML classifiers.

cs.LG↗

arXiv2024

Measuring Chern-Simons level $k$ by braiding $SU(2)_k$ anyons

Chern-Simons theory in application to the quantum computing is actively developing at the present. However, most discussed are the questions of using materials with known parameters and building corresponding quantum gates and algorithms. In this paper we discuss opposite problem of finding Chern-Simons level $k$ in the unknown material. For this purpose, we use the previously derived braiding rules for Chern-Simons $SU(2)_k$ anyons. Using certain operations (turnarounds) on three anyons, one can measure probabilities of annihilation of pairs of anyons, which depend on the parameter of the theory. Therefore, Chern-Simons level $k$ can be found from such an experiment. It is implied that anyons additionally possess certain properties which are required for topological quantum computations.

hep-th↗

arXiv2024

Calculating HOMFLY-PT polynomials on a photonic processor

In this paper we discuss an approach to calculate knot polynomials on a photonic processor. Calculations of knot polynomials is a computationally difficult problem and therefore it is interesting to use new advanced calculation methods to find them. Here we present a proof of concept by calculating the simplest knot polynomial of the trefoil knot in fundamental representation. This approach, however, can easily be generalized to more complex knots and representations. Same operators can also be realized on a quantum computer with the same effect.

quant-ph↗

arXiv2024

Entangled states from arborescent knots

In this paper we discuss how to use arborescent knots to construct entangled multi-qubit states. We show that Bell-states, GHZ-states and cluster states can be constructed from such knots. The latter are particularly interesting since they form a base for the measurement-based quantum computers.

hep-th↗

arXiv2024

On measuring the topological charge of anyons

In this paper we discuss the principles of measuring topological charge or representation traveling in the set of anyons. We describe the procedure and analyze how it works for the different values of parameters of the theory. We also show how it can be modified to be more effective for different levels of Chern-Simons theory.

hep-th↗