SearcharxivSearch

arXiv subjects

Alexander Popov

Publications and source records attributed to Alexander Popov.

18 recordsLinked to original sources

Planning-aligned Token Compression for Long-Context Autonomous Driving

Monolithic vision-action models represent an emerging paradigm in autonomous driving. However, this architecture produces token sequences that quickly exceed real-time computational budgets when encoding extended temporal context for complex interactions. While approaches like linear transformers and external memory try to make the context lightweight, token compression is most compatible with the architecture as it requires no backbone modifications. Yet existing compression adopts rule-based heuristics like temporal decay, decoupled from planning, risking loss of decision-critical information. We propose COMPACT-VA, a planning-aligned working memory framework built on conditional VQ-VAE, compressing extended context into bounded representations. Compression is conditioned on both historical trajectory and a learned planning intent that the posterior encoder distills from future trajectories during training, while the prior encoder learns to predict it from compressed observations. The compressed memory, concatenated with the predicted latent, feeds the policy for end-to-end optimization, planning with retained decision-critical information. We evaluate on high-signal dynamic scenarios where historical context is most critical for behavior correctness (e.g., stop, yield, or proceed), and accordingly design behavioral metrics. Under comparable token budgets, we achieve $>$6% improvement (68.3%) on success rates with consistent gains across metrics. Ablations validate planning-aligned coupling effectiveness. Closed-loop evaluation confirms that COMPACT-VA maintained general driving performance with 3.3* speedup and 2.7* memory reduction over uncompressed processing.

cs.RO

Optimized Compilation of Logical Clifford Circuits

Fault-tolerant quantum computing hinges on efficient logical compilation, in particular, translating high-level circuits into code-compatible implementations. Gate-by-gate compilation often yields deep circuits, requiring significant overhead to ensure fault-tolerance. As an alternative, we investigate the compilation of primitives from quantum simulation as single blocks. We focus our study on the [[n,n-2,2]] code family, which allows for the exhaustive comparison of potential compilation primitives on small circuit instances. Based upon that, we then introduce a methodology that lifts these primitives into size-invariant, depth-efficient compilation strategies. This recovers known methods for circuits with moderate Hadamard counts and yields improved realizations for sparse and dense placements. Simulations show significant error-rate reductions in the compiled circuits. We envision the approach as a core component of peephole-based compilers. Its flexibility and low hand-crafting burden make it readily extensible to other circuit structures and code families.

quant-ph

Data Scaling Laws for End-to-End Autonomous Driving

Autonomous vehicle (AV) stacks have traditionally relied on decomposed approaches, with separate modules handling perception, prediction, and planning. However, this design introduces information loss during inter-module communication, increases computational overhead, and can lead to compounding errors. To address these challenges, recent works have proposed architectures that integrate all components into an end-to-end differentiable model, enabling holistic system optimization. This shift emphasizes data engineering over software integration, offering the potential to enhance system performance by simply scaling up training resources. In this work, we evaluate the performance of a simple end-to-end driving architecture on internal driving datasets ranging in size from 16 to 8192 hours with both open-loop metrics and closed-loop simulations. Specifically, we investigate how much additional training data is needed to achieve a target performance gain, e.g., a 5% improvement in motion prediction accuracy. By understanding the relationship between model performance and training dataset size, we aim to provide insights for data-driven decision-making in autonomous driving development.

cs.RO

Mitigating Covariate Shift in Imitation Learning for Autonomous Vehicles Using Latent Space Generative World Models

We propose the use of latent space generative world models to address the covariate shift problem in autonomous driving. A world model is a neural network capable of predicting an agent's next state given past states and actions. By leveraging a world model during training, the driving policy effectively mitigates covariate shift without requiring an excessive amount of training data. During end-to-end training, our policy learns how to recover from errors by aligning with states observed in human demonstrations, so that at runtime it can recover from perturbations outside the training distribution. Additionally, we introduce a novel transformer-based perception encoder that employs multi-view cross-attention and a learned scene query. We present qualitative and quantitative results, demonstrating significant improvements upon prior state of the art in closed-loop testing in the CARLA simulator, as well as showing the ability to handle perturbations in both CARLA and NVIDIA's DRIVE Sim.

cs.RO

An encryption algorithm using a generalization of the Markovski algorithm and a system of orthogonal operations based on T-quasigroups

Here is a more detailed description of the algorithm proposed in [1]. This algorithm simultaneously uses two cryptographic procedures: encryption using a generalization of the Markovski algorithm [2] and encryption using a system of orthogonal operations. In this paper, we present an implementation of this algorithm based on T-quasigroups, more precisely, based on medial quasigroups.

cs.CR

Warm-Start Variational Quantum Policy Iteration

Reinforcement learning is a powerful framework aiming to determine optimal behavior in highly complex decision-making scenarios. This objective can be achieved using policy iteration, which requires to solve a typically large linear system of equations. We propose the variational quantum policy iteration (VarQPI) algorithm, realizing this step with a NISQ-compatible quantum-enhanced subroutine. Its scalability is supported by an analysis of the structure of generic reinforcement learning environments, laying the foundation for potential quantum advantage with utility-scale quantum computers. Furthermore, we introduce the warm-start initialization variant (WS-VarQPI) that significantly reduces resource overhead. The algorithm solves a large FrozenLake environment with an underlying 256x256-dimensional linear system, indicating its practical robustness.

quant-ph

Probabilistic Galois Theory in Function Fields

We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set $\{a(x)\in\mathbb{F}_q[x]: \mathrm{deg}\, a\leq d\}$ with uniform probability, is irreducible with probability tending to $1-\frac{1}{q^d}$ as $n\to\infty$, where $d$ and $q$ are fixed. We also prove that with the same probability, the Galois group of this random polynomial contains the alternating group $A_n$. Moreover, we prove that if we assume a version of the polynomial Chowla conjecture over $\mathbb{F}_q[x]$, then the Galois group of this polynomial is actually equal to the symmetric group $S_n$ with probability tending to $1-\frac{1}{q^d}$. We also study the other possible Galois groups occurring with positive limit probability. Finally, we study the same problems with $n$ fixed and $d\to\infty$.

math.NT

Particle identification with the cluster counting technique for the IDEA drift chamber

IDEA (Innovative Detector for an Electron-positron Accelerator) is a general-purpose detector concept, designed to study electron-positron collisions in a wide energy range from a very large circular leptonic collider. Its drift chamber is designed to provide an efficient tracking, a high precision momentum measurement and an excellent particle identification by exploiting the application of the cluster counting technique. To investigate the potential of the cluster counting techniques on physics events, a simulation of the ionization clusters generation is needed, therefore we developed an algorithm which can use the energy deposit information provided by Geant4 toolkit to reproduce, in a fast and convenient way, the clusters number distribution and the cluster size distribution. The results obtained confirm that the cluster counting technique allows to reach a resolution 2 times better than the traditional dE/dx method. A beam test has been performed during November 2021 at CERN on the H8 to validate the simulations results, to define the limiting effects for a fully efficient cluster counting and to count the number of electron clusters released by an ionizing track at a fixed $\beta\gamma$ as a function of the track angle. The simulation and the beam test results will be described briefly in this issue.

hep-ex

NVRadarNet: Real-Time Radar Obstacle and Free Space Detection for Autonomous Driving

Detecting obstacles is crucial for safe and efficient autonomous driving. To this end, we present NVRadarNet, a deep neural network (DNN) that detects dynamic obstacles and drivable free space using automotive RADAR sensors. The network utilizes temporally accumulated data from multiple RADAR sensors to detect dynamic obstacles and compute their orientation in a top-down bird's-eye view (BEV). The network also regresses drivable free space to detect unclassified obstacles. Our DNN is the first of its kind to utilize sparse RADAR signals in order to perform obstacle and free space detection in real time from RADAR data only. The network has been successfully used for perception on our autonomous vehicles in real self-driving scenarios. The network runs faster than real time on an embedded GPU and shows good generalization across geographic regions.

cs.CV

The Search for $\mu^+\to e^+ \gamma$ with 10$^{-14}$ Sensitivity: the Upgrade of the MEG Experiment

The MEG experiment took data at the Paul Scherrer Institute in the years 2009--2013 to test the violation of the lepton flavour conservation law, which originates from an accidental symmetry that the Standard Model of elementary particle physics has, and published the most stringent limit on the charged lepton flavour violating decay ${\mu}^+ \rightarrow {\rm e}^+ \gamma$: BR(${\mu}^+ \rightarrow {\rm e}^+ \gamma$) $<4.2 \times 10^{-13}$ at 90% confidence level. The MEG detector has been upgraded in order to reach a sensitivity of $6\times10^{-14}$. The basic principle of MEG II is to achieve the highest possible sensitivity using the full muon beam intensity at the Paul Scherrer Institute ($7\times10^{7}$ muons/s) with an upgraded detector. The main improvements are better rate capability of all sub-detectors and improved resolutions while keeping the same detector concept. In this paper, we present the current status of the preparation, integration and commissioning of the MEG II detector in the recent engineering runs.

hep-ex

MVLidarNet: Real-Time Multi-Class Scene Understanding for Autonomous Driving Using Multiple Views

Autonomous driving requires the inference of actionable information such as detecting and classifying objects, and determining the drivable space. To this end, we present Multi-View LidarNet (MVLidarNet), a two-stage deep neural network for multi-class object detection and drivable space segmentation using multiple views of a single LiDAR point cloud. The first stage processes the point cloud projected onto a perspective view in order to semantically segment the scene. The second stage then processes the point cloud (along with semantic labels from the first stage) projected onto a bird's eye view, to detect and classify objects. Both stages use an encoder-decoder architecture. We show that our multi-view, multi-stage, multi-class approach is able to detect and classify objects while simultaneously determining the drivable space using a single LiDAR scan as input, in challenging scenes with more than one hundred vehicles and pedestrians at a time. The system operates efficiently at 150 fps on an embedded GPU designed for a self-driving car, including a postprocessing step to maintain identities over time. We show results on both KITTI and a much larger internal dataset, thus demonstrating the method's ability to scale by an order of magnitude.

cs.CV

Discovery of a pre-cataclysmic binary with unusual chromaticity of the eclipsed white dwarf by the GPX Survey

We report the discovery of a relatively bright eclipsing binary system, which consists of a white dwarf and a main sequence K7 star with clear signs of chromospheric and spot activity. The light curve of this system shows $\sim0.2$mag ellipsoidal variability with a period of 0.297549d and a short total eclipse of the white dwarf. Based on our analysis of the spectral and photometric data, we estimated the parameters of the system. The K7V star is tidally deformed but does not fill its Roche lobe (the filling factor is about 0.86). The orbital inclination is $i=73^\circ.1\pm 0^\circ.2$, the mass ratio is $q=M_2/M_1\approx 0.88$. The parameters of the K7V star are $M_2\approx 0.64$M$_{\odot}$, $R_2=0.645\pm 0.012$R$_{\odot}$, $T_2\approx 4070$K. The parameters of the white dwarf are $M_1\approx 0.72$M$_{\odot}$, $R_1=0.013\pm 0.003$R$_{\odot}$, $T_1=8700\pm 1100$K. Photometric observations in different bands revealed that the maximum depth of the eclipse is in the \textit{SDSS r} filter, which is unusual for a system of a white dwarf and a late main sequence star. We suspect that this system is a product of the evolution of a common envelope binary star, and that the white dwarf accretes the stellar wind from the secondary star (the so-called low-accretion rate polar, LARP).

astro-ph.SR

KPS-1b: the first transiting exoplanet discovered using an amateur astronomer's wide-field CCD data

We report the discovery of the transiting hot Jupiter KPS-1b. This exoplanet orbits a V=13.0 K1-type main-sequence star every 1.7 days, has a mass of $1.090_{-0.087}^{+0.086}$ $M_{\mathrm{Jup}}$ and a radius of $1.03_{-0.12}^{+0.13}$ $R_{\mathrm{Jup}}$. The discovery was made by the prototype Kourovka Planet Search (KPS) project, which used wide-field CCD data gathered by an amateur astronomer using readily available and relatively affordable equipment. Here we describe the equipment and observing technique used for the discovery of KPS-1b, its characterization with spectroscopic observations by the SOPHIE spectrograph and with high-precision photometry obtained with 1-m class telescopes. We also outline the KPS project evolution into the Galactic Plane eXoplanet survey (GPX). The discovery of KPS-1b represents a new major step of the contribution of amateur astronomers to the burgeoning field of exoplanetology.

astro-ph.EP

Autonomous 3D Reconstruction Using a MAV

An approach is proposed for high resolution 3D reconstruction of an object using a Micro Air Vehicle (MAV). A system is described which autonomously captures images and performs a dense 3D reconstruction via structure from motion with no prior knowledge of the environment. Only the MAVs own sensors, the front facing camera and the Inertial Measurement Unit (IMU) are utilized. Precision agriculture is considered as an example application for the system.

cs.CV

Optimization of the magnetic properties of FePd alloys by severe plastic deformation

A FePd alloy was nanostructured by severe plastic deformation following two different routes: ordered and disordered states were processed by high pressure torsion (HPT). A grain size in a range of 50 to 150 nm is obtained in both cases. Severe plastic deformation induces some significant disordering of the long range ordered L10 phase. However, Transmission Electron Microscopy (TEM) data clearly show that few ordered nanocrystals remain in the deformed state. The deformed materials were annealed to achieve nanostructured long range ordered alloys. The transformation proceeds via a first order transition characterized by the nucleation of numerous ordered domains along grain boundaries. The influence of the annealing conditions (temperature and time) on the coercivity was studied for both routes. It is demonstrated that starting with the disorder state prior to HPT and annealing at low temperature (400\degree C) leads to the highest coercivity (about 1.8 kOe).

cond-mat.mtrl-sci

Strategies for Development of a Distributed Framework for Computational Sciences

This paper discusses some generic approach for developing grid-based framework for enabling establishment of workflows comprising existing software in computational sciences areas. We highlight the main requirements addressed the developing of such framework. Some strategies for enabling interoperability between convenient computation software in the grid environment has been shown. The UML based instruments of graphical description of workflows for the developing system has been suggested.

cs.DC

Transient detections and other real-time data processing from wide-field chambers MASTER-VWF

At present time Robotic observatory making is of current importance. Having a large field of view and being able to point at anywhere, Robotic astronomical systems are indispensable when they looking for transients like grb, supernovae explosions, novae etc, as it's impossible in these cases to foresee what you should point you telescope at and when. In work are described prompt GRB observations received on wide-field chambers MASTER-VWF, and also methods of the images analysis and transients classifications applied in real-time data processing in this experiment. For 7 months of operation 6 synchronous observations of gamma-ray burst had been made by MASTER VWF in Kislovodsk and Irkutsk. In all cases a high upper limits have been received (see tabl \ref {tab_grbwf} and fig. \ref {allgrb}).

astro-ph.IM

Master Robotic Net

The main goal of the MASTER-Net project is to produce a unique fast sky survey with all sky observed over a single night down to a limiting magnitude of 19 - 20mag. Such a survey will make it possible to address a number of fundamental problems: search for dark energy via the discovery and photometry of supernovas (including SNIa), search for exoplanets, microlensing effects, discovery of minor bodies in the Solar System and space-junk monitoring. All MASTER telescopes can be guided by alerts, and we plan to observe prompt optical emission from gamma-ray bursts synchronously in several filters and in several polarization planes.

astro-ph.HE