Publications

2026

• Generic neural network model for estimating exposure levels in industrial environments
  
  • Plets David
  • Apostolidis Christos
  • Wang Shanshan
  • Valič Blaž
  • Martens Luc
  • Samaras Theodoros
  • Gajšek Peter
  Journal of Radiological Protection, IOP Publishing, 2026, 46 (2), pp.021518 (1-14). Abstract This study describes a neural network-based method for estimating exposure levels in industrial environments, without requiring detailed technical inputs, allowing usage of the model by layman people or by workers active in these areas. A pipeline based on Blender environments and MATLAB ray-tracing simulations is created and after defining a set of 11 candidate input parameters for the model, more than 20 000 different wireless configurations are simulated, varying the different environmental and wireless input parameters. A correlation analysis shows that main inputs influencing the exposure levels in the industrial area are the transmit power of the antennas, the density of clutter in the area, the density of transmitters in the area, and the height and location of the transmitters. A multi-layer fully connected neural network regression model is developed to predict median ( E 50 ) and 95th percentile ( E 95 ) exposure levels in industrial areas. Testing the obtained model on an unseen dataset of environments with E 50 values between 0 and 3.25 V m −1 and E 95 values between 0 and 7 V m −1 , demonstrates the good prediction performance of the model: root-mean-square error values below 0.173 V m −1 and R 2 values above 95% are obtained. Subsequently, the model is validated with measurement data collected in three distinct realistic industrial environments. The average absolute deviation of the model predictions with respect to the measurements is limited to 20.4%. This novel and broadly accessible approach demonstrates that it is possible to reliably estimate exposure levels in realistic environments without having to rely on external experts or on dedicated complex software. (10.1088/1361-6498/ae6c32)
  DOI : 10.1088/1361-6498/ae6c32
• A Decade of Software Reproducibility in the Nix Package Ecosystem
  
  • Malka Julien
  • Zacchiroli Stefano
  • Zimmermann Théo
  , 2026. <div><p>We report a large-scale empirical study of two aspects of software reproducibility-rebuildability and bitwise reproducibility-in the Nix package ecosystem. Using 29 evenly spaced historical snapshots over a decade of history of the nixpkgs repository (2015-2024) we attempted to rebuild and bitwise-compare the build outputs of tens of thousands of packages per snapshot. Our experiment produced a dataset of build metadata and logs for 1 321 000 package builds and preserved 166 523 diffoscopes for unreproducible outputs.</p><p>We find that functional package management enables extremely high rebuildability over time (near-universal ability to reconstitute historical build environments and rebuild software packages), while bitwise reproducibility has steadily improved and reaches a high point in recent years (up to 93% in 2024). Early years show substantially lower bitwise reproducibility, indicating that functional package management alone does not guarantee bitwiseidentical outputs, and that the observed high level of bitwise reproducibility is not solely due to the package management approach. Common causes of unreproducibility, both in the rebuildability and bitwise reproducibility dimensions, include management of dates in build and test processes; we quantify their prevalence and other common causes using manual analysis of logs of rebuild failures and automated analysis of diffoscopes.</p></div>
• Energy efficiency of quantum computers
  
  • Carrasco-Codina Miquel
  • Escofet Pau
  • Hilaire Paul
  • Soret Ariane
  • Nerenberg Sam
  • Champain Victor
  • Milburn Gerard
  • Theophilo Klara
  • Li Sophie
  • Bautista Irais
  • Gómez Andrés
  • Miralles Jose
  • Abadal Sergi
  • Almudéver Carmen
  • Alarcón Eduard
  • Yehia Raja
  , 2026. How much energy does a quantum computer consume? Are they more efficient than their classical counterparts? In this work, we make a step towards answering these questions. We define the energy efficiency of a quantum computer as the ratio of the number of algorithms it can perform during a given time over the energy consumed by the hardware during this time. We analyze the most representative physical platforms currently envisioned to be used as building blocks of quantum computers: superconducting qubits, silicon spin qubits, trapped ions, neutral atoms and photonic qubits. Including insights from experts in all these technologies and taking into account algorithm compilation constraints, we discuss the advantages and inconveniences of each platform from an energy standpoint. Beyond providing concrete values of the energy consumption of current quantum computers, we lay the foundation of a framework to benchmark the energy efficiency of any future quantum computing architecture. (10.48550/arXiv.2605.15090)
  DOI : 10.48550/arXiv.2605.15090
• SPOT: An Annotated French Corpus and Benchmark for Detecting Critical Interventions in Online Conversations
  
  • Berriche Manon
  • Nouri Célia
  • Clavel Chloé
  • Cointet Jean-Philippe
  , 2026. We introduce SPOT (Stopping Points in Online Threads), the first annotated corpus translating the sociological concept of stopping point into a reproducible NLP task. Stopping points are ordinary critical interventions that pause or redirect online discussions through a range of forms (irony, subtle doubt or fragmentary arguments) that frameworks like counterspeech or social correction often overlook. We operationalize this concept as a binary classification task and provide reliable annotation guidelines. The corpus contains 43,305 manually annotated French Facebook comments linked to URLs flagged as false information by social media users, enriched with contextual metadata (article, post, parent comment, page or group, and source). We benchmark fine-tuned encoder models (CamemBERT) and instruction-tuned LLMs under various prompting strategies. Results show that fine-tuned encoders outperform prompted LLMs in F1 score by more than 10 percentage points, confirming the importance of supervised learning for emerging non-English social media tasks. Incorporating contextual metadata further improves encoder models F1 scores from 0.75 to 0.78. We release the anonymized dataset, along with the annotation guidelines and code in our code repository, to foster transparency and reproducible research.
• Analysing Lightweight Large Language Models for Biomedical Named Entity Recognition on Diverse Ouput Formats
  
  • Epron Pierre
  • Coulet Adrien
  • Alam Mehwish
  , 2026, pp.1-13. Despite their strong linguistic capabilities, Large Language Models (LLMs) are computationally demanding and require substantial resources for fine-tuning, which is unadapted to privacy and budget constraints of many healthcare settings. To address this, we present an experimental analysis focused on Biomedical Named Entity Recognition using lightweight LLMs, we evaluate the impact of different output formats on model performance. The results reveal that lightweight LLMs can achieve competitive performance compared to the larger models, highlighting their potential as lightweight yet effective alternatives for biomedical information extraction. Our analysis shows that instruction tuning over many distinct formats does not improve performance, but identifies several format consistently associated with better performance.
• ENEIDE: A High Quality Silver Standard Dataset for Named Entity Recognition and Linking in Historical Italian
  
  • Santini Cristian
  • Barzaghi Sebastian
  • Sernani Paolo
  • Frontoni Emanuele
  • Melosi Laura
  • Alam Mehwish
  , 2026. This paper introduces ENEIDE (Extracting Named Entities from Italian Digital Editions), a silver standard dataset for Named Entity Recognition and Linking (NERL) in historical Italian texts. The corpus comprises 2,111 documents with over 8,000 entity annotations semi-automatically extracted from two scholarly digital editions: Digital Zibaldone, the philosophical diary of the Italian poet Giacomo Leopardi (1798-1837), and Aldo Moro Digitale, the complete works of the Italian politician Aldo Moro (1916-1978). Annotations cover multiple entity types (person, location, organization, literary work) linked to Wikidata identifiers, including NIL entities that cannot be mapped to the knowledge graph. To the best of our knowledge, ENEIDE represents the first multi-domain, publicly available NERL dataset for historical Italian with training, development, and test splits. We present a methodology for semi-automatic annotations extraction from manually curated scholarly digital editions, including quality control and annotation enhancement procedures. Baseline experiments using state-of-the-art models demonstrate the dataset's challenge for NERL and the gap between zero-shot approaches and fine-tuned models. The dataset's diachronic coverage spanning two centuries makes it particularly suitable for temporal entity disambiguation and cross-domain evaluation.
• POT Python Optimal Transport
  
  • Flamary Rémi
  • Vincent-Cuaz Cédric
  • Courty Nicolas
  • Gramfort Alexandre
  • Kachaiev Oleksii
  • Quang Tran Huy
  • David Laurène
  • Bonet Clément
  • Cassereau Nathan
  • Gnassounou Theo
  • Tanguy Eloi
  • Delon Julie
  • Collas Antoine
  • Mazelet Sonia
  • Chapel Laetitia
  • Kerdoncuff Tanguy
  • Yu Xizheng
  • Feickert Matthew
  • Krzakala Paul
  • Liu Tianlin
  • Fernandes Montesuma Eduardo
  , 2026. (10.5281/ZENODO.17161062)
  DOI : 10.5281/ZENODO.17161062
• Kalman Filtering for Sensing Aided Communication to Mobile Users in Large Cellular Networks
  
  • Balakrishnan Ashutosh
  • Soprano-Loto Nahuel
  • Baccelli François
  , 2026. Upcoming 6G networks are expected to have joint sensing and communication capabilities. In this work, we propose a sensing-aided communication (SAC) framework, wherein a cellular network of randomly located base stations (BSs) sequentially estimates the position and channel gain of a user equipment (UE) moving randomly across the network. At the core of this framework lies a state-dependent Kalman filter that extends the classical formulation in two key respects: (i) measurements are acquired from a dynamically selected BS, the selection based on the a-priori estimate of the UE's position and fading channel; and (ii) the measurement noise covariance is modelled as a function of the sensing distance and fading, coupling the temporal evolution of the state with the measurement quality. This coupling gives rise to pronounced estimation error peaks during handovers, which in turn directly govern the design of initial access and handover protocols in stochastic networks. To quantify performance, we introduce a new metric, the stationary mean of the estimation error covariance, and establish its validity through an ergodic theorem, further supported by numerical convergence studies. The sensing-based UE-BS association is evaluated in one-and two-dimensional Gauss-Markov mobility scenarios and benchmarked against two alternatives: an autonomous noise covariance setting and an ideal omniscient controller with perfect position knowledge. The SAC framework is shown to outperform a position-only sensing framework by around 32%. Overall, the results highlight the advantage of the SAC framework in providing protocol-level insights for handover-aware sensing and demonstrate that the proposed filter achieves stable long-run performance.
• RAVE: Rate-Adaptive Visual Encoding for 3D Gaussian Splatting
  
  • Tran Hoang-Nhat
  • Di Sario Francesco
  • Spadaro Gabriele
  • Valenzise Giuseppe
  • Tartaglione Enzo
  , 2026, pp.11727-11731. <div><p>Recent advances in neural scene representations have transformed immersive multimedia, with 3D Gaussian Splatting (3DGS) enabling real-time photorealistic rendering. Despite its efficiency, 3DGS suffers from large memory requirements and costly training procedures, motivating efforts toward compression. Existing approaches, however, operate at fixed rates, limiting adaptability to varying bandwidth and device constraints. In this work, we propose a flexible compression scheme for 3DGS that supports interpolation at any rate between predefined bounds. Our method is computationally lightweight, requires no retraining for any rate, and preserves rendering quality across a broad range of operating points. Experiments demonstrate that the approach achieves efficient, high-quality compression while offering dynamic rate control, making it suitable for practical deployment in immersive applications. The code is available at https://github.com/inspiros/RAVE.</p></div> (10.1109/ICASSP55912.2026.11463333)
  DOI : 10.1109/ICASSP55912.2026.11463333
• S-PRESSO: Ultra Low Bitrate Sound Effect Compression With Diffusion Autoencoders And Offline Quantization
  
  • Lahrichi Zineb
  • Hadjeres Gaëtan
  • Richard Gaël
  • Peeters Geoffroy
  , 2026. <div><p>Neural audio compression models have recently achieved extreme compression rates, enabling efficient latent generative modeling. Conversely, latent generative models have been applied to compression, pushing the limits of continuous and discrete approaches. However, existing methods remain constrained to low-resolution audio and degrade substantially at very low bitrates, where audible artifacts are prominent. In this paper, we present S-PRESSO, a 48kHz sound effect compression model that produces both continuous and discrete embeddings at ultra-low bitrates, down to 0.096 kbps, via offline quantization. Our model relies on a pretrained latent diffusion model to decode compressed audio embeddings learned by a latent encoder. Leveraging the generative priors of the diffusion decoder, we achieve extremely low frame rates, down to 1Hz (750x compression rate), producing convincing and realistic reconstructions at the cost of exact fidelity. Despite operating at high compression rates, we demonstrate that S-PRESSO outperforms both continuous and discrete baselines in audio quality, acoustic similarity and reconstruction metrics.</p></div>
• SIRUP: A DIFFUSION-BASED VIRTUAL UPMIXER OF STEERING VECTORS FOR HIGHLY-DIRECTIVE SPATIALIZATION WITH FIRST-ORDER AMBISONICS
  
  • Picard Emilio
  • Carlo Diego Di
  • Nugraha Aditya Arie
  • Fontaine Mathieu
  • Yoshii Kazuyoshi
  , 2026, pp.14707-14711. <div><p>This paper presents virtual upmixing of steering vectors captured by a fewer-channel spherical microphone array. This challenge has conventionally been addressed by recovering the directions and signals of sound sources from first-order ambisonics (FOA) data, and then rendering the higher-order ambisonics (HOA) data using a physics-based acoustic simulator. This approach, however, struggles to handle the mutual dependency between the spatial directivity of source estimation and the spatial resolution of FOA ambisonics data. Our method, named SIRUP, employs a latent diffusion model architecture. Specifically, a variational autoencoder (VAE) is used to learn a compact encoding of the HOA data in a latent space and a diffusion model is then trained to generate the HOA embeddings, conditioned by the FOA data. Experimental results showed that SIRUP achieved a significant improvement compared to FOA systems for steering vector upmixing, source localization, and speech denoising.</p></div> (10.1109/ICASSP55912.2026.11464234)
  DOI : 10.1109/ICASSP55912.2026.11464234
• PHYSICS-INFORMED LEARNING OF NEURAL SCATTERING FIELDS TOWARDS MEASUREMENT-FREE MESH-TO-HRTF ESTIMATION
  
  • Martinez Tancrède
  • Carlo Diego Di
  • Nugraha Aditya Arie
  • Fontaine Mathieu
  • Yoshii Kazuyoshi
  , 2026, pp.22577-22581. <div><p>This paper describes neural simulation of the scattered pressure field from a plane wave around a scattering object in both continuous 2D and 3D domains. This task has typically been treated as a regression problem that aims to train a physicsinformed neural network (PINN) using pressure measurements at discrete positions. This approach, however, needs to train the whole network for each incident wave direction. To address this, we propose a measurement-free simulator based on a PINN purely driven by the Helmholtz equation with the Robin boundary condition and the Sommerfeld radiation condition with the aid of the perfectly matched layer (PML) framework. More specifically, we design a physics-informed scattering hypernetwork (PHISK) that can generalize to incident waves from any direction via low-rank adaptation (LoRA) of a PINN trained for a specific configuration. The experiment shows that the proposed method accurately simulated sound scattering around various objects, adapting to unseen incident wave directions with minimal performance loss, and realized reasonable simulation of head-related transfer functions (HRTFs) from complex mesh data of a human head.</p></div> (10.1109/ICASSP55912.2026.11462698)
  DOI : 10.1109/ICASSP55912.2026.11462698
• Generalization Bounds for Spectral GNNs via Fourier Domain Analysis
  
  • Martirosyan Vahan A
  • Malitesta Daniele
  • Talbot Hugues
  • Giraldo Jhony H
  • Malliaros Fragkiskos D
  , 2026, 300. Spectral graph neural networks learn graph filters, but their behavior with increasing depth and polynomial order is not well understood. We analyze these models in the graph Fourier domain, where each layer becomes an element-wise frequency update, separating the fixed spectrum from trainable parameters and making depth and order explicit. In this setting, we show that Gaussian complexity is invariant under the Graph Fourier Transform, which allows us to derive data-dependent, depth, and order-aware generalization bounds together with stability estimates. In the linear case, our bounds are tighter, and on real graphs, the data-dependent term correlates with the generalization gap across polynomial bases, highlighting practical choices that avoid frequency amplification across layers.
• Robust brain age estimation from structural MRI with contrastive learning
  
  • Barbano Carlo Alberto
  • Dufumier Benoit
  • Duchesnay Edouard
  • Grangetto Marco
  • Gori Pietro
  Pattern Recognition Letters, Elsevier, 2026, 203, pp.78-84. <div><p>Estimating brain age from structural MRI has emerged as a powerful tool for characterizing normative and pathological aging. In this work, we explore contrastive learning as a scalable and robust alternative to L1-supervised approaches for brain age estimation. We introduce a novel contrastive loss function,  exp , and evaluate it across multiple public neuroimaging datasets comprising over 20,000 scans. Our experiments reveal four key findings. First, scaling pre-training on diverse, multi-site data consistently improves generalization performance, cutting external mean absolute error (MAE) nearly in half. Second,  exp is robust to site-related confounds, maintaining low scanner-predictability as training size increases. Third, contrastive models reliably capture accelerated aging in patients with cognitive impairment and Alzheimer's disease, as shown through brain age gap analysis, ROC curves, and longitudinal trends. Lastly, unlike L1-supervised baselines,  exp maintains a strong correlation between brain age accuracy and downstream diagnostic performance, supporting its potential as a foundation model for neuroimaging. These results position contrastive learning as a promising direction for building generalizable and clinically meaningful brain representations.</p></div> (10.1016/j.patrec.2026.02.032)
  DOI : 10.1016/j.patrec.2026.02.032
• TaxoSurv: A Comprehensive Survey of Taxonomy Construction, Expansion, Completion, and Refinement
  
  • Ghamlouch Zeinab
  • Alam Mehwish
  , 2026. <div><p>Taxonomies are fundamental structures for organizing knowledge in the form of a hierarchy, supporting applications such as information retrieval, knowledge graphs, and semantic reasoning. However, many real-world taxonomies suffer from limited coverage, outdated concepts, and structural inconsistencies, motivating research on computational methods for constructing and refining hierarchical structures from heterogeneous data sources. This survey provides a systematic overview of taxonomy learning across its main tasks: construction, expansion, completion, and refinement. We introduce a structured categorization that organizes existing approaches along two dimensions, the nature of the downstream task and the methodology, including nonneural, neural, and LLM-based methods, and further analyze the benchmark datasets and evaluation protocols used across prior work. Our goal is to consolidate the state-of-the-art and propose a coherent taxonomy of methods that clarifies terminology and supports future research.</p></div>
• Two-Indexed Schatten Quasi-Norms with Applications to Quantum Information Theory
  
  • Kochanowski Jan
  • Fawzi Omar
  • Rouzé Cambyse
  , 2026. We define 2-indexed $(q,p)$-Schatten quasi-norms for any $q,p &gt; 0$ on operators on a tensor product of Hilbert spaces, naturally extending the norms defined by Pisier's theory of operator-valued Schatten spaces. We establish several desirable properties of these quasi-norms, such as relational consistency and the behavior on block diagonal operators, assuming that $|\frac{1}{q} - \frac{1}{p}| \leq 1$. In fact, we show that this condition is essentially necessary for natural properties to hold. Furthermore, for linear maps between spaces of such quasi-norms, we introduce completely bounded quasi-norms and co-quasi-norms. We prove that the $q \to p$ completely bounded co-quasi-norm is super-multiplicative for tensor products of quantum channels for $q \geq p&gt;0$, extending an influential result of [Devetak, Junge, King, Ruskai, 2006]. Our proofs rely on elementary matrix analysis and operator convexity tools and do not require operator space theory. On the applications side, we demonstrate that these quasi-norms can be used to express relevant quantum information measures such as Rényi conditional entropies for $α\geq \frac{1}{2}$ or the Sandwiched Rényi Umlaut information for $α&lt; 1$. Our multiplicativity results imply a tensorizing notion of reverse hypercontractivity, additivity of the completely bounded minimum output Rényi-$α$-entropy for $α\geq\frac{1}{2}$ extending another important result of [Devetak, Junge, King, Ruskai, 2006], and additivity of the maximum output Rényi-$α$ entropy for $α\geq \frac{1}{2}$. (10.48550/arXiv.2604.14055)
  DOI : 10.48550/arXiv.2604.14055
• FlowC2S: Flowing from Current to Succeeding Frames for Fast and Memory-Efficient Video Continuation
  
  • Margaryan Hovhannes
  • Bammey Quentin
  • Sandor Christian
  , 2026. This paper introduces a novel methodology for generating fast and memory-efficient video continuations. Our method, dubbed FlowC2S, fine-tunes a pre-trained text-to-video flow model to learn a vector field between the current and succeeding video chunks. Two design choices are key. First, we introduce inherent optimal couplings, utilizing temporally adjacent video chunks during training as a practical proxy for true optimal couplings, resulting in straighter flows. Second, we incorporate target inversion, injecting the inverted latent of the target chunk into the input representation to strengthen correspondences and improve visual fidelity. By flowing directly from current to succeeding frames, instead of the common combination of current frames with noise to generate a video continuation, we reduce the dimensionality of the model input by a factor of two. The proposed method, fine-tuned from LTXV and Wan, surpasses the state-of-the-art scores across quantitative evaluations with FID and FVD, with as few as five neural function evaluations.
• Simulating Thermal Properties of Bose-Hubbard Models on a Quantum Computer
  
  • Becker Simon
  • Rouzé Cambyse
  • Salzmann Robert
  , 2026. While recent advances have established efficient quantum algorithms for preparing Gibbs states of finite-dimensional systems, comparable complexity results for bosonic and other infinite-dimensional models remain unexplored. We introduce the first general rigorous Gibbs sampling framework for bosonic many-body systems, showing that physically relevant bosonic models admit gapped dissipative generators, enabling efficient preparation of thermal states. Although our results hold for broad classes of models, we illustrate them using Bose-Hubbard Hamiltonians, both within and beyond the mean-field regime. In both cases, we show that the associated dissipative generators maintain a positive spectral gap, thereby implying exponential convergence to the thermal state. Our argument in the multi-mode case is based on a finite-rank reduction of the dissipative dynamics, which allows us to control the generator via compact perturbations and deduce the discreteness of the spectrum and the stability of the gap. We apply our results to provide efficient preparation of the corresponding Gibbs state on qubit hardware, and by that a quantum algorithm to compute thermal properties of the associated model. This provides the first mathematically controlled route to Gibbs sampling in infinite-dimensional systems, with implications for quantum simulation, thermalization, and many-body complexity, where quantum advantages may arise. (10.48550/arXiv.2604.06077)
  DOI : 10.48550/arXiv.2604.06077
• Quantum Gibbs Sampling in Infinite Dimensions: Generation, Mixing Times and Circuit Implementation
  
  • Becker Simon
  • Rouzé Cambyse
  • Salzmann Robert
  , 2026. We develop a rigorous and implementable framework for Gibbs sampling of infinite-dimensional quantum systems governed by unbounded Hamiltonians. Extending dissipative Gibbs samplers beyond finite dimensions raises fundamental obstacles, including ill-defined generators, the absence of spectral gaps on natural Banach spaces, and tensions between implementability and convergence guarantees. We overcome these issues by constructing KMS-symmetric quantum Markov semigroups on separable Hilbert spaces that are both well-posed and efficiently implementable on qubit hardware. Our generation theory is based on the abstract framework of Dirichlet forms, adapted here to the case of algebras of bounded operators over separable Hilbert spaces. Leveraging the spectral properties of our self-adjoint generators, we establish quantitative convergence results in trace distance, including regimes of fast thermalization. In contrast, we also identify Hamiltonians for which a naive choice of generators guaranteeing implementability generally comes at the cost of losing convergence of the associated evolutions, thereby establishing a strong trade-off between implementability and convergence. Our framework applies to a wide class of models, including Schrödinger operators, Gaussian systems, and Bose-Hubbard Hamiltonians, and provides a unified approach linking rigorous infinite-dimensional analysis with algorithmic Gibbs state preparation. (10.48550/arXiv.2604.01192)
  DOI : 10.48550/arXiv.2604.01192
• Distortion-aware STAP adaptive beamforming for robust GNSS anti-jamming in high-dynamics environments
  
  • Lagarde Elise
  • Leborgne Fabien
  • Abedrrabba Sarra
  • Dubroca Norbert
  • Leonardon Mathieu
  • Roblin Christophe
  • Cousin Jean-Christophe
  • Gomes Joan
  • Oriol Stephane
  , 2026. he combination of Spatio-Temporal Adaptive Processing (STAP) and Controlled Reception Pattern Antennas (CRPAs) enhances the robustness of Global Navigation Satellite System (GNSS) anti-jamming receivers, particularly for autonomous launcher navigation where continuous Position, Velocity, and Time (PVT) availability is critical. In this architecture, STAP acts as a spatio-temporal filtering stage on array signals, while adaptive beamforming (ABF) algorithms compute and steer the filter weights to shape the antenna pattern and place spatial nulls under high-dynamics conditions involving strong carrier accelerations. Common techniques used to drive the STAP weights include Minimum Variance Distortionless Response (MVDR), Minimum Mean Square Error (MMSE), and Linearly Constrained Minimum Variance (LCMV). This paper demonstrates that, despite their theoretical optimality, such ABF-driven STAP approaches may struggle in complex real-world conditions, particularly in the presence of significant launcher dynamics, including rapid attitude variations and high acceleration profiles. To illustrate these limitations, two complementary sets of results are presented. The first is based on simulated data generated using open-source tools such as gnss-sdr-sim, allowing controlled emulation of dynamic interference and motion scenarios. The second relies on testbed experiments conducted in a controlled, conducted environment at the European Commission’s Joint Research Centre (JRC). The results show that variations in interference power, waveform type, and direction of arrival, combined with changes in GNSS signal geometry and carrier dynamics, introduce biases of varying magnitude. Significant nonlinear effects and distortions of the cross-correlation functions are observed, which degrade acquisition and tracking performance and may ultimately lead to PVT degradation or loss. These impairments are primarily induced by the conducted Radio Frequency (RF) chain, including front-end nonlinearities and gain increases introduced by the Low Noise Amplifier (LNA) and Automatic Gain Control (AGC), initially designed to improve GNSS signal detectability. Under such conditions, while adaptive beamforming algorithms may still compute STAP filter weights, the resulting interference cancellation may be insufficient to guarantee robust PVT tracking across all scenario configurations. More generally, classical adaptive beamforming approaches are sensitive to steering vector mismatch and covariance estimation errors induced by RF nonlinearities, high jammer-to-signal ratios (JSR), AGC saturation, and quantization effects. Compensating for these effects often requires increasing the number or complexity of constraints or regularization mechanisms, which in turn raises computational complexity, particularly in high-dynamics scenarios requiring frequent weight updates and highlights the need for accurate distortion modeling to properly dimension ABF constraints. This work highlights the need to revisit traditional ABF algorithms used to drive STAP filter weights to explicitly account for nonlinear and distortion effects, particularly in high-dynamics scenarios where robust PVT tracking is required. It also opens the way toward hybrid approaches combining classical digital signal processing with lightweight machine learning–based techniques, in which computationally frugal data-driven models assist in robust covariance estimation, distortion-aware constraint adaptation, and tracking of dynamic interference conditions, thereby improving robustness and maintaining reliable GNSS-based autonomy in RF contested environments.
• Computing the free energy of quantum Coulomb gases and molecules via quantum Gibbs sampling
  
  • Becker Simon
  • Rouzé Cambyse
  • Salzmann Robert
  , 2026. We develop a quantum algorithm for estimating the free energy as well as the total Gibbs state of interacting quantum Coulomb gases and molecular systems in dimensions $d \in \{2,3\}$ at finite temperature. These systems lie beyond the reach of existing methods due to their singular interactions and infinite-dimensional Hilbert space structure. First, we show that the free energy of the full many-body Hamiltonian can be approximated by that of the same Hamiltonian with a finite-rank low-energy truncation of the interaction, with an explicit error bound polynomial in the particle number. This reduces the problem to a controlled finite-rank perturbation problem. Second, we introduce a quantum Gibbs sampling scheme tailored to this truncated system, based on a class of quantum Markov semigroups. Our main analytical result establishes that the associated generator has a strictly positive spectral gap for every truncation, implying exponential convergence to the target Gibbs state. This provides, to our knowledge, the first rigorous mixing-time guarantee for Gibbs sampling in a Coulomb interacting continuous-variable quantum system. Finally, we give an explicit quantum circuit implementation of the dynamics and derive an end-to-end complexity bound for approximating the free energy and the Gibbs state itself. Our results provide a mathematically rigorous route to quantum algorithms for free energy estimation in interacting quantum systems, without relying on classical approximations such as the Born-Oppenheimer reduction. (10.48550/arXiv.2604.15263)
  DOI : 10.48550/arXiv.2604.15263
• Balanced Latent Semantics and Signal Fidelity for EEG Representation Learning
  
  • Nguyen Van-Chien
  • Tran Trung-Hieu
  • Doan Tuan-Kiet
  • Pham Quang Hung
  • Vu Ngoc-Son
  • Le Duc Han
  • Phan Huy
  • Le Nguyen Phi
  • Simidjievski Nikola
  • Tardieu Samuel
  • Nguyen Van-Tam
  , 2026. <div><p>Electroencephalography (EEG) is critical for neurological diagnosis but suffers from low SNR and subject variability. Current foundation models relying on raw signal reconstruction often overfit to local noise. We propose STELAR, a foundation model with a dual-space objective combining patch-level masked latent prediction for semantic stability with masked reconstruction for raw signal fidelity. To balance these objectives, we introduce MTPE-GB, a validation-driven gradient balancer that adaptively weights tasks without manual tuning or computational overhead. STELAR achieves state-of-the-art linear probing performance across diverse EEG benchmarks, demonstrating robust generalization.</p></div>
• The ALERT Dataset: Benchmarking Anomaly Detection of Non-Stationary Vibrational Signals
  
  • Emelchenkov Anton
  • Fontaine Mathieu
  • Mahé Hervé
  • Roueff François
  , 2026. In recent years, automatic audio anomaly detection has gained considerable attention. However, most existing methods and benchmarks assume stationary or periodic signals, limiting their applicability to industrial environments characterized by non-stationary operating regimes such as speed ramps and transient load variations. We introduce the ALERT Dataset, a large-scale collection of non-stationary vibration recordings from electric powertrains acquired on an industrial end-of-line test bench. Each recording captures ramp-up and ramp-down phases with continuously varying rotational speed and includes synchronized speed measurements to enable explicit conditioning on operational dynamics. The dataset comprises 224 healthy training recordings and 80 healthy test recordings, along with an additional 80-sample hold-out set reserved for anomaly generation. From this hold-out set, multiple anomalous test suites (80 samples each) are constructed via expert-designed amplitude-based degradations and structured noise perturbations at varying signal-to-noise ratios, simulating realistic fault scenarios. Models are evaluated by discriminating these anomalies from the 80 healthy test recordings under a one-class learning paradigm. The benchmark further supports diverse protocols, including zero-shot cross-phase testing. To our knowledge, the ALERT Dataset is the first large-scale collection of non-stationary industrial vibration signals with synchronized speed references, addressing a critical gap in existing benchmarks. The dataset is publicly available on Zenodo. (10.5281/zenodo.18759681)
  DOI : 10.5281/zenodo.18759681
• INSTANT: COMPRESSING GRADIENTS AND ACTIVATIONS FOR RESOURCE-EFFICIENT TRAINING
  
  • Doan Tuan-Kiet
  • Tran Trung-Hieu
  • Tartaglione Enzo
  • Simidjievski Nikola
  • Nguyen Van-Tam
  , 2026. <div><p>Deep learning has advanced at an unprecedented pace. This progress has led to a significant increase in its complexity. However, despite extensive research on accelerating inference, training deep models directly within a resource-constrained budget remains a considerable challenge due to its high computational and memory requirements. In this paper, we introduce INSTANT (compressIng gradieNtS and acTivAtions for resource-efficieNt Training), a method designed to address both the computational and the memory bottlenecks when training. INSTANT reduces resource demands during backpropagation by projecting gradients and activations into a low-rank subspace and performing computation within that compressed representation. Experimental results demonstrate that INSTANT achieves a 15× reduction in computational cost and 32× reduction in activation memory with negligible impact on model performance. The code is available at INSTANT. * Equal contribution.</p><p>• We introduce a low-cost calibration technique to generate calibrated orthonormal bases for tensor projection, enabling significant reductions in memory and computations (Sec. 3.2). • We project activation tensors and gradients onto these orthonormal bases. To our knowledge, this is the first work to exploit the low-rank structure of activation gradients for all types of data distribution. We provide an error analysis of our gradient compression, illustrating that a high compression ratio is achievable with limited performance degradation (Sec. 3.3). • We evaluate INSTANT across multiple datasets and model architectures, consistently demonstrating good performance, achieving up to 32× memory savings and 15× computational cost reduction with only a 1% trade-off in accuracy compared to vanilla fine-tuning (Sec. 4).</p></div> <div>RELATED WORK<p>Activation compression. Activation compression is a recently emerging research direction that addresses the memory challenges during training. This approach offers several key advantages based on the following observations: (i) model weights remain uncompressed during training, thereby preserving their expressive capacity; (ii) activations are often large and exhibit significant redundancy, making them suitable for compression (Sakr &amp; Khailany, 2024; Miles et al., 2024). (Nguyen et al., 2024) applies SVD to compress activations to reduce huge memory usage for activations. However, this approach raises substantial computational overhead due to the high cost of performing SVD in each training iteration. (Sakr &amp; Khailany, 2024) (ESPACE) tackles SVD computational expense by using calibrated subspaces, which are periodically updated, to compress activations. They enable activation compression in the forward pass, reducing computational overhead in both the forward and backward phases. However, ESPACE is prone to error accumulation, as it relies on the universal fixed subspace across varying activations.</p><p>Optimizer state compression. Weight gradients are inherently low-rank (Yang et al., 2023a). Previous studies (Bernstein et al., 2018; Vogels et al., 2019) have leveraged this characteristic to address communication bottlenecks in distributed learning by reducing inter-device data transmission. GaLore (Zhao et al., 2024) and its variances (Muhamed et al., 2024; Shamshoum et al., 2025) leverage the low-rank property of weight gradients for compressing them to reduce memory usage in the optimizer state significantly. CompAct Shamshoum et al. ( 2025) further reduces the memory overhead</p></div>
• NeuroSnitch: Exploiting Inter-Spike Interval Statistics for Timing Side-Channel Attacks on Noisy Neuromorphic Systems
  
  • Khan Mahreen
  • Mushtaq Maria
  • Apvrille Ludovic
  , 2026. <div><p>Neuromorphic computing promises energy-efficient solutions for embedded and edge systems, but introduces unique security challenges and a new attack surface. This paper presents NeuroSnitch, a first-ever timing side-channel attack to leverage subtle statistical variations in Inter-Spike Intervals (ISIs) on Spiking Neural Networks (SNNs) to extract secret information. We show that secret data, when modulating a neuron's input current, can be profiled through higher-order ISI statistics-mean, variance, skewness, and kurtosis-even under realistic noise sources, including observation noise, current fluctuation, and voltage jitter. Using the Leaky Integrateand-Fire (LIF) neuron model, we demonstrate that a Random Forest classifier can achieve 98.41% character-level classification accuracy on noisy ISI traces, enabling complete recovery of a 33-character secret string. This work exposes a previously underexplored and robust timing leakage vector in SNNs, underscoring the urgent need for tailored security measures in this emerging computing paradigm, particularly for sensitive embedded and IoT applications.</p></div> (10.1145/YYYYYYY.YYYYYYY)
  DOI : 10.1145/YYYYYYY.YYYYYYY