Peer Revenue Now accepting positions

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Friday 6 November

Machine Learning

Online Causal Configuration for Networked Systems via Doubly Robust Steady-State Learning

Measurement exploration reveals how interacting local controllers behave but can alter the steady-state regime a network operator seeks to optimize. Exploratory rewards may therefore fail to identify a configuration's no-exploration value: under full exploration, identical logged distributions can conceal different target values. Identification requires accounting for both action-law mismatch and shifts in the steady-state context distribution. We introduce CAUSAL-UCB, which selects configurations using optimistic bounds on target causal values. Its interference-aware clipped doubly robust evaluator produces predecision certificates separating statistical variation from calibrated identification, transport, and temporal-dependence errors. For any finite horizon and predetermined schedule of measurement-exploration rates $\{\eta_t\}$, we prove lower bounds of $\Omega((1+\sum_t\eta_t)^{-1/2})$ on minimax inference error and $\Omega(\sum_t\eta_t)$ on measurement-induced deployment loss in a stationary, potentially slow-mixing family. We bound regret under valid certificates and selected-information growth, and establish an anytime finite-sample certificate with a shared radius for estimation, selection, and reporting in a restricted known-local-interference model. In a high-mismatch benchmark with 24 paired seeds and 200 rounds, CAUSAL-UCB attains target regret of $1.732$ versus $6.326$ for certified IPS-UCB, with deployment gaps of $30.607$ and $23.217$, respectively. Independent-audit coverage tests and trace-driven semi-synthetic studies further assess certificate coverage and deployment trade-offs.
Read the full abstract

Computer Vision

Dual Architecture Fusion Vehicle Lidar 3D Target Detection

In this paper, a 3D backbone network (SpconvTransformer) based on the fusion of convolutional architecture branch and Transformer architecture branch is proposed. The convolution branch uses 3D sparse convolution and submanifold convolution to learn local voxel features and semantic information, and the Transformer branch uses the self-attention mechanism to model the remote relationship between voxels, uses the broad receptive field to capture rich context information, and complementing the advantages of the two architectures by fusing the local features extracted from the two branches and the global features solves the problem of limited receptive fields of 3D convolutional neural networks. The experimental results show that the average accuracy of SpconvTransformer in 3D object detection and bird's-eye view detection tasks reaches 81.45% and 88.09%, respectively, and the average directional similarity reaches 91.10%, which is significantly better than other existing algorithms.
Read the full abstract

Atmospheric and Oceanic Physics

RainFlow: Flow Matching for Infrared-Only Quantitative Precipitation Estimation

Geostationary infrared imagers observe precipitating systems every 10 to 15 minutes over large areas, but they sense cloud tops rather than the rain beneath. Their brightness temperatures constrain surface rain only weakly, so retrievals trained by regression return a smooth estimate that misses heavy rain and carries no measure of uncertainty. We treat infrared-only retrieval as conditional generation and introduce RainFlow, a flow-matching model that generates ensembles of rain fields from MSG/SEVIRI infrared observations, in a direct and a residual variant. Evaluated against radar over metropolitan France for a full year, the generated members are realistic rain fields, with the observed dry areas, heavy rain and spatial structure, and the ensemble mean is as accurate as a deterministic baseline. Used as probabilities, the ensembles locate heavy rain at scales where the baseline has no skill, and their spread captures most of the retrieval error, with only slight underdispersion. Trained with a time-sampling density that favours the noise end of the generative trajectory, the two variants reach similar skill. The direct variant depends strongly on this choice of density, whereas the residual variant is nearly insensitive to it. Evaluating the generated rain as a function of brightness temperature shows that the ensembles reproduce how rain depends on it over most of the range. It also isolates the remaining gap, an underestimate of both the amount and the variability of rain under the coldest cloud tops, which scores computed over all pixels do not reveal.
Read the full abstract

Computation and Language

How Much Conversation History Does an AI Agent Need?

How does using less conversational history change reader-token use and benchmark scores? We examine this question on 1,100 BEAM questions. We held the retrieval ranking and reader constant across five fixed passage budgets, and mean assigned scores rose as the passage budget grew. The score gain per additional token became smaller at the upper tested budgets. Answerable questions generally received higher scores with more context. Pooled abstention scores sometimes rose as the passage budget shrank. We also tested message retention in a controlled task with explicit conversational-state targets and compared retained user messages with token-matched recency. Qwen matched the full state more often for direct requirements when user messages were retained. Its full-state matching declined when answers depended on references to earlier offers. Mistral produced near-floor results across the retention conditions. A scoring audit leaves the correctness of BEAM answers unresolved. These experiments characterize the token and score consequences of the tested memory budgets. Reliable budget selection depends on retaining the evidence each question requires and validating the measure used to assess answer quality.
Read the full abstract

Computer Vision

Video2Asset: Online Construction of Persistent 3D Street-Scene Assets

Online 3D street-scene asset construction turns multi-view video into a continually updated scene of independently editable objects. The central challenge is to accumulate partial, intermittent observations under motion and occlusion without fragmenting identities or mixing evidence across objects. To address this challenge, we propose Video2Asset, an online framework for constructing persistent 3D assets from multi-view video. Using occupancy as an intermediate representation, we construct identity-aware observations with Historical Carrier Guidance for instance decoding and an identity encoder fusing instance-aligned 3D features with multi-view appearance. Accumulated-Evidence Association compares current observations with identity, geometric, and appearance evidence accumulated within asset records to determine identity inheritance and update world-coordinate states. We instantiate meshes from an asset library using these states and combine them with an occupancy-derived static background to support scene visualization, mesh replacement, object deletion, and trajectory editing. Experiments on several datasets demonstrate improvements in temporal identity consistency and asset quality across multiple occupancy models, including a 15.4% reduction in asset fragmentation on nuScenes with SGE.
Read the full abstract

All authors Zihan Zheng, Chunlei Cai, Zhenlong Wu, Linjun Li, Yichen Gong, Xiaoyun Zhang, Qiang Hu

Fluid Dynamics

Radiation-driven melting and porous flow in the near-surface layer of an ice sheet

The ablation area of an ice sheet can undergo melting both directly at the surface and in the metre or so below the surface, due to the penetration and absorption of shortwave radiation. The fate of the meltwater has important implications for the mass balance of the ice sheet; some of it runs off into surface streams and eventually to the ocean, while some is stored in the porous `weathering crust', and can refreeze. We present a fluid-mechanical model to analyse the downward percolation and lateral drainage of the meltwater in the crust, and its influence on porosity, saturation, temperature and melting rate. Previous models have either ignored the possibility for lateral drainage, in which case the crust is always saturated with water, or have made ad-hoc assumptions about where and how the meltwater runs off. Through a series of analytical and numerical solutions to the model, we find that lateral drainage has the effect of controlling the water table within the weathering crust, which separates an unsaturated region near the surface from a saturated aquifer beneath. Under fluctuating weather conditions that induce melting and refreezing, the lateral drainage can result in the near-surface ice being more porous and also colder than is the case without lateral drainage. The model is able to predict the partitioning of the meltwater between surface and subsurface runoff, and refreezing, and has potential to be incorporated within larger-scale models of the ice-sheet mass balance.
Read the full abstract

Quantum Physics

Quantum Integration Software Suite For HPC-Quantum Computing Workflows

In this work, we focus on addressing challenges related to modelling the integration of conventional high-performance computing (HPC) and quantum computing (QC). We introduce the Quantum Assembly Compiler (QASC) for OpenQASM3.0 files. The compiler produces an executable that leverages the high-performance simulator QuEST to simulate quantum programs. Additionally, we introduce a performance modelling tool, QACC-perf, which can estimate the cost of integrating QC in classical HPC workflows, as well as the execution time of the quantum circuits. Finally, we demonstrate the utility of these tools in the context of multiscale quantum chemistry workflows using the ChemShell computational chemistry environment.
Read the full abstract

All authors Mateusz Meller, Joseph C. R. Thacker, Thomas W. Keal, Vendel Szeremi

Cryptography and Security

Differentially Private GraphRAG: Protecting Relation Connectivity and Semantics

Graph Retrieval-Augmented Generation (GraphRAG) connects information across documents through entity relationships to support relational reasoning. However, black-box access to GraphRAG systems can enable adversaries to reconstruct knowledge graphs and recover both structural connectivity between entities and the semantics of their relationships. Existing defenses lack formal privacy guarantees and provide limited protection against such reconstruction attacks. We propose RelGuard, the first differentially private framework for GraphRAG, which provides formal privacy guarantees by mitigating connectivity leakage and protecting relations and their semantic meaning through relation removal. We formalize relation differential privacy (relation-DP), which bounds the distinguishability of mechanism outputs according to the semantic distance between alternative relations while accounting for relation removal. Building on this definition, we develop a four-step defense mechanism that sanitizes source documents before GraphRAG indexing by perturbing relation predicates or removing their associated connectivity using the exponential mechanism. Experiments across three GraphRAG systems and two targeted reconstruction attacks demonstrate that RelGuard provides stronger protection against reconstruction attacks than four existing defense mechanisms while better preserving downstream utility.
Read the full abstract

All authors Jie Fu, Yuan Hong, Yue Ning, Wendy Hui Wang

Earth and Planetary Astrophysics

Advances in High-Precision Astrometry for Exoplanet Detection for Astrometric Missions

High-precision astrometry is a cornerstone for detecting Earth-like exoplanets in the habitable zones of nearby solar-type stars and probing the nature of dark matter in galactic environments. Achieving sub-microarcsecond accuracy requires unprecedented control over detector morphology, optical distortion, and astrometric measurement techniques. This paper reviews recent progress in characterizing large format detector at the micropixel scale level, calibrating optical distortion using reference stars, and refining differential astrometry methods to detect the faint astrometric signatures of Earth-mass exoplanets. We highlight the latest developments in the RETINA project, which aims to advance the TRL of GIGAPYX 220 MP CMOS detectors from Pyxalis which are critical components for future space missions such as ESA's Theia and NASA's Habitable Worlds Observatory (HWO). The project focuses on precise calibration methods, including Young's fringe projection, to monitor pixel geometry and intra-pixel response across gigapixel-scale focal planes. By integrating these advancements, RETINA seeks to enable astrometric detection of Earth-mass exoplanets with a precision of few tens of micropixels on the focal plane. We discuss the technical strategies, laboratory validations, and system-level integration required to achieve these goals, emphasizing the synergy between detector technology, optical calibration, and mission design. These innovations pave the way for next-generation astrometric instruments capable of transforming our understanding of exoplanetary systems and dark matter dynamics.
Read the full abstract

All authors Fabien Malbet, Jerôme Amiaux, Florence Ardellier-Desages, Eric Doumayrou, Pierre-Antoine Frugier, Pierre-Olivier Lagage, Alain Léger, Manon Lizzana, Jérôme Martignac, Julien Michelot, Fabrice Pancher, Thibault Pichon, Samuel Ronayette, Hugo Rousset, Sebastien Soler, Eric Thiébaut

Data Structures and Algorithms

From Function Inversion to Preimage Reporting

Given an arbitrary function $f:[N]\to[M]$, the function inversion problem asks to preprocess $f$ and to be able to, when given some $y\in [M]$, decide whether there exists some $x\in [N]$ such that $f(x)=y$ and if so, to report such an $x$. Recently, Fiat-Naor's solution to this problem has seen significant traction in theoretical computer science, and allowed for several conjectures related to meta-complexity and the 3SUM problem to be broken. In this paper, we consider the natural extension of the function inversion problem that we call preimage reporting. Here, instead of having to report only one $x\in [N]$ such that $f(x)=y$, the whole set $f^{-1}(y)$ must be found. We present a new general method to convert any arbitrary function inversion scheme into an efficient corresponding preimage reporting scheme. In particular, if $\Delta$ is the maximal indegree of $f$, we show that we can perform preimage reporting using space $S$ in time $T$ for any $T$ and $S$ satisfying $TS^2=N^2 \Delta$, matching a variant of a tradeoff obtained by Fiat and Naor for function inversion. This last result implies an improvement over the corresponding function inversion scheme itself, which constitutes the first function inversion scheme whose query time is inversely proportional to $|f^{-1}(y)|$. We derive new simple solutions for the $k$SUM-indexing with reporting and Jumbled indexing with reporting problems.
Read the full abstract

Computer Vision

Decoupled Mode Connectivity for Base-to-Novel Generalization in Vision-Language Models

Prompt learning adapts vision-language models such as CLIP by optimizing a short learnable prompt. The cross-entropy objective pulls this prompt toward base-class specialization, whereas generalization to unseen classes benefits from staying close to CLIP's zero-shot feature space. Because both objectives act on the same prompt, their gradients conflict at convergence, and in our experiments no single-prompt loss design clearly improves on the cosine baseline. We propose Decoupled Mode Connectivity (DMC), which gives each objective its own prompt. Starting from a base-trained prompt, DMC trains a specialization prompt and a generalization prompt, and merges their text features with a fixed coefficient at test time, at the inference cost of a single prompt. A linear mode connectivity (LMC) corridor in text-feature space keeps the classification loss low for every classifier interpolated between the two endpoints, and a Visual Anchor KL term preserves CLIP's zero-shot class-similarity distribution of each image during specialization. We further argue that such regularizers should satisfy class-permutation invariance (CPI), and show via Fano's inequality, in an idealized model, that violating CPI lower-bounds the drop in novel accuracy by a term proportional to the mutual information between the prompt and the base-class labels. Across 11 datasets, DMC improves the average harmonic mean of base and novel accuracy over MergeTune for both CoOp and KgCoOp, and its interpolation curves pass beyond the single-prompt operating point, shifting the base-novel frontier rather than trading along it. Code is available at https://github.com/IemProg/DMC.
Read the full abstract

All authors Imad Eddine Marouf, Khalid Oublal, Enzo Tartaglione, Stéphane Lathuilière

Optics

Multipole Decomposition of Moving Sources

Cartesian multipole moments are widely used to analyze and engineer radiation, but the usual relations for their radiated fields assume a wavevector-independent source frequency. For moving sources, Doppler shifts make the frequency depend on the wavevector, so the radiated fields predicted from the moments generally carry errors proportional to v/c. From charge conservation in the laboratory frame, we derive a multipole decomposition of moving sources that retains the usual moments but evaluates their contributions at Doppler-shifted wavenumbers and adds a convection-current term. Requiring no rest frame, it applies to moving matter and to excitation patterns in synthetic motion through media at rest, including superluminal ones. The decomposition also extends to nonuniform translation and to nonrigid patterns with curved spectral supports. Exact calculations for moving electric, magnetic, and toroidal dipoles confirm the decomposition and attribute the different radiation of a dipole in moving matter and in synthetic motion to the laboratory moments that each kind of motion induces. For an anapole, these moments decide whether it radiates. An anapole carried by uniformly moving matter remains nonradiating, whereas an excitation pattern with the same electric and toroidal dipoles radiates in synthetic motion. The decomposition thus makes multipolar analysis available for moving matter and for excitation patterns in synthetic motion, and it opens the way to designing their radiation.
Read the full abstract

All authors Shuhang Chen, Yutong Li, Xinmeng Wang, Qi Zhu

Quantum Physics

A Phase-Balanced Differential Rydberg-Atom Quantum Receiver for Weak GNSS Signal Detection

This paper proposes a phase-balanced differential Rydberg atomic quantum receiver (DRAQR) for weak-signal recovery, using local-oscillator phase control to reinforce differential signal responses and a shared squeezed-reservoir model to correlate inter-cell quantum projection noise (QPN) and photon shot noise (PSN). An analytical model incorporating QPN, PSN, intrinsic thermal noise (ITN), and inter-cell correlations quantifies signal-to-noise ratio (SNR) gain, outage-constrained minimum detectable power, and bit-error rate (BER) for square $M$-QAM. For the evaluated settings, SNR gain reaches approximately $10$~dB as PSN correlation approaches unity, with BER decreasing as correlation increases. Under Rician fading, at a $0$-dB threshold SNR and maximum outage probability of $0.1$, the minimum detectable power decreases from $-146.95$~dBm at $K=1.155$ to $-159.98$~dBm at $K=2.4$. Analytical results are validated against Monte-Carlo simulations over $150{,}000$ data runs per point for receiver-performance plots.
Read the full abstract

All authors A. K. Mandal, F. Zhang, J. H. Mikkelsen, M. Shen

Computer Vision

Breaking the Privacy Promise: Gradient Inversion Attacks on Federated Low-Rank Adapted Vision Transformers

Parameter-efficient fine-tuning (PEFT) has been increasingly adopted to fine-tune pretrained models with low computational cost and is therefore also preferred in the federated learning paradigm to reduce computational and communication overhead. In this work, we investigate the sparsely explored problem of the risk of private data leakage in LoRA-adapted Vision Transformers (ViTs), where low-rank updates weaken the gradient signal available to a server with access to individual client updates. We show that quality of reconstruction is limited by two coupled ambiguities: reduced information in LoRA gradients and missing spatial cues from frozen positional embeddings. To address this, we propose a spatially anchored generative inversion framework that incorporates server-prescribed trainable positional embeddings into ViT blocks during fine-tuning at clients. The resulting positional gradients act as layer-wise spatial anchors, providing additional positional cues, while the generative prior keeps reconstructions on a realistic image manifold, reducing duplicate-data and patch-permutation artifacts, {which produce similar gradients as those produced when the target client images are used}. Adding our proposed spatial anchoring to GIAS improves PSNR by 10.14 dB, SSIM by 0.45, and LPIPS by 0.098 on CIFAR-10, as well as PSNR gains of 7.83 and 11.74 dB on high-resolution CelebA and CARS datasets, respectively, in the FedSGD setting. Such gains in reconstructed image quality metrics are also maintained at higher batch sizes and in FedAvg settings. These results indicate that LoRA-based PEFT does not, by itself, prevent data leakage in FL, and carefully incorporated positional embeddings can help in exposing private information.
Read the full abstract

All authors Ritik K. Badiya, Siladittya Manna, Ashmit Sinha, M Yashwanth, Anirban Chakraborty

Distributed Computing

Concurrent Use of FP32 and FP64 Computing Units on GPUs and Mixed-Precision Placement in WENO Reconstruction

Scientific computing often requires FP64 arithmetic, although FP64 performance is limited on NVIDIA GPUs. Double-float (DF) emulation, which represents a value using two FP32 values with about 48 bits of significand, outperforms native FP64 where FP64 units are limited. On the other hand, mixed-precision strategies offload to FP32 the operations that do not determine accuracy. In both approaches, the native FP64 units remain idle during FP32 instruction execution. We investigated whether this idle resource can be recovered on A100, GH200, GB200, and RTX PRO 6000 Blackwell Max-Q. A microbenchmark shows that co-resident FP32 and native-FP64 kernels exceed the throughput of the faster kernel alone on A100 but not on GH200 and GB200; on RTX 6000 Blackwell, they do so against FFMA but, against DF emulation, only when the issue density of the DF kernel is reduced. We then tested whether this gain carries over to computing the WENO-Z reconstruction with the nonlinear weights in FP32 and the candidate polynomials in native FP64 (W32P64). We observe substantial overlap on A100, whereas GH200, GB200, and RTX 6000 Blackwell show little overlap. Importantly, the fastest placement does not always preserve the design accuracy of WENO-Z: for a one-dimensional entropy wave problem, W32P64 fails to achieve the design order of accuracy for WENO7 and WENO9. In contrast, DF emulation of the entire reconstruction comes close to it on the grids tested for WENO5, WENO7, and WENO9 while delivering a $2.51-3.94 \times$ speedup over FP64 on RTX 6000 Blackwell. For WENO5 on the two-dimensional Euler vortex problem the W32P64 error at $n=256$ is $1.26 \times$ that of FP64 and 1/104 of that of the all-FP32 reconstruction.
Read the full abstract

All authors Jun Hatayama, Daichi Mukunoki, Yusuke Onishi, Atsushi Sekimoto, Toshinori Kouchi

Software Engineering

TensorMutation: Learning Weight-Space Mutations of Deep Learning Models on Neural Graphs

Mutation testing for deep learning (DL) faces a cost-realism trade-off. The pre-training approach produces realistic but computationally expensive mutants, whereas existing post-training operators modify trained models efficiently but produce mutants that less closely resemble real faults. This study asks whether the trade-off is necessary: can the weight-space effect of a fault-informed pre-training mutation operator be predicted from a trained model, without retraining it? We answer this question with TensorMutation, which represents a trained model as a neural graph and uses a mutation-conditioned graph neural network (GNN) to predict parameter changes. The GNN is trained offline and reused across unseen models so that TensorMutation can generate executable mutants without retraining. We construct a corpus of 25,252 original-mutant pairs from 71 multilayer perceptron (MLP) classifiers using 11 fault-informed pre-training operators, including 25 newly curated subjects. TensorMutation partially reproduces the behavioral effects of pre-training mutations on nine held-out subjects, and direct weight-space supervision significantly improves weight-space fidelity. On 12 real-fault subjects, TensorMutation achieves the highest median behavioral similarity among the evaluated approaches. The improvement over the post-training tool DeepMutation++ is statistically significant (Holm-adjusted p=0.018), whereas the differences from the pre-training tool DeepCrime and the norm-matched random control are not significant. These results show that fault-informed pre-training mutations leave learnable structure in weight space that transfers to unseen models.
Read the full abstract

Data Structures and Algorithms

Parallel Algorithms for Higher-Order Temporal H-Index Computation

Ranking vertices by importance is a fundamental task in network mining. The H-index provides such a ranking by asking how many neighbors are themselves well connected; its higher-order temporal variant recursively applies this idea over time-respecting neighborhoods in temporal networks. Scaling its computation is difficult because the existing streaming algorithm intertwines temporal processing with H-index order, incurring maximum-degree-dependent costs and exposing little parallelism. We show that the temporal dependencies can instead be resolved once: each edge's time-dependent lookup is mapped to a fixed successor position, turning every H-index order into a parallel gather followed by a segmented suffix-H computation. Based on this reformulation, we derive a linear-work suffix-H algorithm, a parallel multicore CPU implementation, degree-adaptive GPU kernels, and a multi-GPU scheme that exchanges only distinct remotely queried states. Experiments on synthetic and real-world temporal graphs show that the reformulation alone is substantially faster than the streaming algorithm, and that GPUs add order-round speedups exceeding an order of magnitude over our multicore implementation on synthetic inputs with up to one billion temporal edges. On a 636M-edge Reddit network, eight GPUs compute 128 orders in 3.6 s of round time, whereas the streaming algorithm does not finish within an hour even at order 8.
Read the full abstract

High Energy Physics (Theory)

The instanton sum in two-dimensional self-dual models

This paper considers the self-dual $CP^{N-1}$ model in two dimensions, which is defined by restricting the path integral of the ordinary two-dimensional $CP^{N-1}$ model to holomorphic configurations. We find that the instanton measure is one-loop exact and agrees with the one-loop instanton measure in the ordinary model. For the $N=2$ case, the instanton gas admits a description in terms of free massive Dirac fermions. Nevertheless, we find that the self-dual model is gapless. We also comment on the $\theta$ dependence.
Read the full abstract

Neurons and Cognition

Path-dependent triage: Early judgments lead conversational AI chatbots to miss mental-health emergencies

People increasingly bring mental-health concerns to consumer AI chatbots. In these conversations, clinically relevant information rarely arrives all at once. Instead, it unfolds over multiple turns, often in response to the questions the chatbot asks. Recognizing risk therefore depends on how a chatbot integrates newly disclosed information (inference) and on the questions it asks on each turn to elicit this information (context-seeking). Here we evaluated the conversational triage performance of 13 frontier AI chatbots tasked with engaging in 10-turn conversations with simulated users. Simulated users were grounded in one of 112 structured mental-health case files, each with an associated clinician-validated urgency level, from routine care to emergency. Chatbots failed to recognize one in five mental-health emergencies (20.3%), nearly four times the failure rate when all relevant clinical details were presented in a single message (5.6%). This gap was not explained by missing information: by the final turn, decisive facts had almost always been disclosed, and simply re-presenting those same facts as a single message reduced emergency under-triage to 12.1%. The problem lay instead in how the conversation unfolded, a phenomenon we refer to as path dependence. Early triage dispositions increasingly anchored later ones, such that emergencies missed early were rarely recovered as evidence accumulated. Context-seeking narrowed onto a small number of stereotyped questioning trajectories, with chatbots perseverating more than human clinicians given the same transcripts. Because the chatbot's running judgment shaped what it asked next, these two biases were plausibly coupled across turns. These dynamics are invisible to single-turn benchmarks but measurable in multi-turn evaluation, and point to concrete mitigations for safer conversational triage in consumer health AI.
Read the full abstract

All authors Veith Weilnhammer, Raymond Dolan, Lennart Luettgau, Virginia Corno, Elise Wilkinson, Viknesh Sounderajah, Hannah Richardson, Christopher Kelly, Matthew M Nour

Distributed Computing

Fast and Actionable Classification of HPC I/O Time Series

Input/output (I/O) is a major bottleneck for highperformance computing (HPC) performance. One of the challenges is the contention between jobs when sharing the parallel file system. However, tackling this issue depends on knowing the temporal behavior of jobs. In this paper, we propose a clusteringbased approach to characterize jobs' temporal I/O behavior. We propose SAGE, a lightweight method that cuts I/O traces into short windows and learns an alphabet from them. The trace then becomes a sequence of symbols, which we call ”genome”, and we use clustering to separate them into classes. We evaluate SAGE and its two-stage variant SAGE-2 on 819,771 real traces from 2 HPC systems. We compare them against other techniques from the state of the art on three metrics, including one we propose. Compared to K-shape, the best baseline available, SAGE-2 lowers the median intra-cluster metrics by 9.1% on average, and achieves this in 2 minutes of clustering time versus 3.8 hours, a 109x speedup. More importantly, clusters created by SAGE and SAGE-2 carry enough information to act on: we evaluate the use of the cluster centroids for I/O scheduling, and show that our approach can decrease I/O stretch by up to 24% compared to the state of the art (round-robin placement).
Read the full abstract

All authors Maxime Gonthier, Luan Teylo, Francesco Antici, Mihail Popov, Francieli Boito

Quantum Physics

Slices for normal forms in quantum information and a Riccati-type equation

It is known that the normal space to an orbit of a compact group linear action meets each orbit. We show that this yields known normal forms for quantum states. We compute the gradient flow converging to the normal form and find it gives a Riccati type matrix-valued ODE.

Multiagent Systems

A Separation Principle for Cooperative Multi-Agent Reinforcement Learning

We study cooperative multi-agent reinforcement learning (MARL) problems in which agents evolve under decoupled noisy dynamics but share a population objective. A canonical example is a mobility operator that orchestrates a fleet of vehicles to meet customer demand. The stochastic and time-varying nature of these problems calls for learning approaches, yet existing MARL algorithms do not scale: learning assignment and routing jointly over the full state-action space becomes prohibitive as the number of agents grows. Formulating the problem over the space of probability measures, we prove a separation principle: the population cost-to-go function is upper bounded by an optimal transport problem whose transportation cost is the target-conditioned single-agent cost-to-go function. This simplifies the multi-agent problem to learning a single-agent policy and coordinating the agents via optimal transport. Building on this principle, we introduce SALT (Separation-based Assignment and Learning via optimal Transport), a family of algorithms that learn a target-conditioned single-agent policy using any standard reinforcement learning algorithm, and then coordinate the agents via optimal transport. Since learning occurs at the single-agent level, SALT scales to fleet sizes where MARL baselines become intractable and transfers without retraining to fleet sizes unseen during training. In a vehicle-delivery experiment on the southern Manhattan road network, where MARL baselines are computationally prohibitive, SALT improves travel time by 15-21% over a shortest-path routing heuristic. In stochastic grid worlds, SALT reduces average travel times by 23-61% relative to MARL baselines and scales to population sizes where these methods fail.
Read the full abstract

All authors Lucia Pezzetti, Nicolas Lanzetti, Antonio Terpin, Florian Dörfler, Giorgia Ramponi

Nuclear Theory

On the collective flow puzzle in ultra-central heavy-ion collisions

Using UCC-DiffHIC, an AI-accelerated event-by-event hydrodynamic model validated against hybrid simula- tions, we study flow in ultracentral Pb-Pb collisions. For suitable initial conditions, the calculated v2{2}/v3{2} approaches unity in the most central collisions, consistent with experiment. An exact response decomposition shows that residual fluctuations suppress the ratio through P3/P2 < 1, where P2 and P3 are Pearson response correlations for elliptic and triangular flow, respectively. This resolves the apparent flow hierarchy without requiring a breakdown of linear response or additional effects such as nuclear deformation.
Read the full abstract

Audio and Speech Processing

NAVE: A Normalized, Adaptive Conformer for Antarctic Whale Vocalization Detection

Antarctic whale vocalization detection requires temporally localizing call boundaries in long underwater recordings and classifying them into predefined call types. Training reliable machine learning models for this task is difficult due to the variability and sparsity of whale calls in passive acoustic monitoring datasets. These difficulties are further amplified by time-varying noise that can mask whale calls and by site-specific ambient sound characteristics to which a trained model may not generalize. In this work, we present NAVE, a Conformer-based detector that improves whale-call detection via three components. First, its input representation combines per-bin complex mean subtraction, which suppresses constant site-specific ambient sound characteristics, with an additional per-channel energy normalization (PCEN) channel that adapts to temporal variations in the noise floor. Second, a frequency-dynamic stem processes these noise-aware representations with convolutions that adapt across the characteristic frequency bands of the target call types. Third, we use a Conformer backbone with a convolution kernel matched to the duration of the target calls that adds an inductive bias and improves temporal localization. We evaluate NAVE on BioDCASE 2026 Task 2 using leave-one-site-out cross-validation across the validation sites, which approximates deployment on unseen recording sites. A single NAVE model with a tuned per-class threshold exceeds the stronger WhaleVAD-BPN baseline, using no boundary-proposal network and no search over post-processing parameters. A controlled ablation study shows that the normalized front-end and a duration-matched convolutional kernel each contribute substantially to recovering the D downsweep, the hardest class for previous detectors, with the wide kernel giving the largest aggregate gain.
Read the full abstract

Quantum Physics

Efficient One-Shot Simulation of Network Instruments and Multi-party Purity Distillation

We undertake an information theoretic study of instrument compression problems (ICPs) in {multiple network} configurations, wherein the goal is to design and analyze protocols that simulate specific quantum classical (QC) correlation amidst distributed parties - some holding components of the quantum state and the rest holding classical registers - with minimum communication. We present a unified framework of protocols based on likelihood instruments whose analysis yields new inner bounds in the one-shot and asymptotic regimes for the different network configurations we study. Our framework comprises of a common template for designing the instrument simulation protocol and analyzing its information theoretic performance. We also address a related problem of multi-party purity distillation wherein three distributed parties have to distil pure states efficiently via local operations and minimal communication. In regards to the tools, in addition to one-shot purity concentration protocol of \cite{202203arXiv_ChaPadSen} and one-shot quantum simultaneous decoder of Sen \cite{202102SAD_Sen}, we leverage Sen's fully smooth multi-partite covering \cite{202504arXiv_Sen} for all of our covering bounds.
Read the full abstract

Robotics

LACART: Lookahead-Augmented Collision Avoidance and Reference Tracking Strategies for Safety-Critical Robots

Autonomous racing provides a demanding testbed for collision avoidance under tight geometric and computational constraints. Building on a recent conference contribution and a master's dissertation, LACART combines lookahead-based control barrier functions (CBFs), a relaxed control Lyapunov function (CLF), and quadratic programming (QP) to modify nominal vehicle commands for obstacle avoidance and reference tracking. The method handles circular obstacles and track boundaries in a common optimisation layer. Comparative simulation results against Huang et al. \cite{r9} show similar full-track paths and lower median computation times: 0.31 versus 0.33 ms per step and 0.023 versus 0.025 ms per QP solve. The dissertation further demonstrates a 1:43-scale vehicle with camera-based estimation and wireless actuation at a reported 25 Hz control rate. We identify the conditions linking lookahead-point clearance to body clearance, illustrate hardware limitations, and propose a recorded demonstration of safety intervention and recovery. The contribution targets ground-robot collision avoidance and real-time safety monitoring.
Read the full abstract

Plasma Physics

Are the tearing and the Weibel instabilities the same?

The tearing instability, which extracts free energy from a magnetic field gradient, and the Weibel instability, which draws free energy from temperature anisotropies, appear at first glance to be fundamentally distinct. However, the magnetic field gradient in the tearing instability requires a current, and the resulting plasma drift leads to an effective temperature anisotropy, so that the plasma is hotter along the direction of the current flow. This anisotropy can play an essential role in driving the instability. We demonstrate, using semi-implicit particle-in-cell simulations, a smooth transition between the tearing regime for thick current sheets, where the anisotropy has little influence, and a thin-current-sheet regime better described by Weibel physics. We find that for current sheet thicknesses less than the ion Larmor radius, where standard assumptions of the tearing instability break down, the growth rate of the mode commonly identified as the tearing instability agrees remarkably well with the growth rate predicted by ion-cyclotron theory, which is essentially the magnetized counterpart of the Weibel instability.
Read the full abstract

All authors K. M. Schoeffler, H. Aravindakshan, F. Pucci, M. E. Innocenti

Combinatorics

Macdonald intersections and the $N!/k$ conjecture

We prove the Frobenius characteristic formula for the intersection of Garsia–Haiman modules predicted in the Science Fiction of Bergeron and Garsia. As a consequence, we resolve the $N!/k$ conjecture. The proof uses the geometry of the Hilbert scheme of points in the plane developed by Haiman.
Read the full abstract

All authors Peter L. Guo, Mingyang Kang, Changjian Su, Rui Xiong

Chemical Physics

Propagating the Hierarchical Equations of Motion using the Multi-Layer Multi-Configurational Time-Dependent Hartree method

The hierarchical equations of motion (HEOM) are a powerful, numerically exact approach for simulating the time evolution of open quantum systems. Recently, several tensor-train- and tensor-network-based approaches have been suggested and realized to extend the range of applicability of the HEOM approach to larger and more realistic systems. In this paper, we build upon the existing twin-space formulation of the HEOM and present a novel approach to propagate the fermionic HEOM efficiently using the multi-configurational time-dependent Hartree method (MCTDH). We benchmark the resulting HEOM+MCTDH method with electron transport calculations for a Holstein-type nanojunction model. Furthermore, we demonstrate the capabilities of the HEOM+MCTDH method by applying it to a more complex vibronic coupling nanojunction model with strong molecule-electrode coupling for which fully quantum simulations have not been feasible previously.
Read the full abstract

All authors Robin L. Grether, Samuel L. Rudge, Martin Mäck, Riley J. Preston, Uwe Manthe, Michael Thoss

Information Theory

Capacity of Generic Symmetric Distributed Linear Computation: The Geometry of Relations

In distributed linear computation, $K$ users observe linear functions of common finite-field data and send separate messages to a server that wants another linear function. We characterize the generic capacity $C$, the minimum total number of field symbols sent per computed instance, when all observations and the demand have dimension $\nu$, the data have dimension $\mu$, and the coefficients of these linear functions are drawn independently and uniformly from the field and stay fixed during coding, with the field size growing through arbitrary prime powers. For fixed $K$, $C/\nu$ depends only on $\tau=\mu/\nu$: the curve has finitely many linear pieces for at most three users, infinitely many pieces approaching one value of $\tau$ for four users, and a rational part between two sequences of linear pieces for five or more users. The geometry of the relation space, formed by the linear relations among the observations and the demand, determines three things: the shape of the curve, which relations the coding scheme aligns, and the entropy inequalities used in the converse. Generically, the user subspaces of this space are either balanced, where the capacity lies on a single rational curve, or split into two balanced components, a sparse and a dense one, which produces the linear pieces. Achievability uses asymptotic set alignment, in which monomial precoders confine the combined observation differences to a small set. The converse uses the same geometry to lower-bound the sum of the users' remaining observation entropies in terms of the remaining data entropy.
Read the full abstract