Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Combinatorics

Conditions for traceability under a bound on the size of even-distance sets

We make partial progress towards a proof of Conjecture 189 of Written on the Wall II by showing that a connected graph $G$ satisfying $\max\{\mathrm{dist_{even}}(v):v\in V(G)\}\le d_2+1$, where $\mathrm{dist_{even}}(v)$ is the number of vertices at an even distance from $v$ and $d_2$ is the second smallest degree of $G$, is traceable whenever at least one of four conditions holds. These conditions involve the vertex-connectivity, order, and diameter of $G$.
Read the full abstract

Differential Geometry

The Rigidity of the closed three dimensional regular Landsberg metrics

The Landsberg Berwald conjecture asks whether every regular Landsberg metric is Berwald. We settle this conjecture for closed three-dimensional manifolds: every smooth strongly convex regular Landsberg metric on such a manifold is Berwald, without any reversibility assumption. Equivalently, there are no regular Landsberg "unicorns" on closed three-manifolds; this is a reformulation of the same conjecture, rather than a second independent conjecture.The proof combines a vanishing theorem for commuting Codazzi cubic tensors on closed surfaces, a rigidity theorem for three dimensional Minkowski norms with constant curvature indicatrices, and a rank one argument for the nonlinear curvature. The remaining R-quadratic case is settled by compactness along the geodesic flow. The fibrewise constant curvature theorem is an ingredient in this argument and does not assert the full Laugwitz conjecture.
Read the full abstract

Computer Vision

MC-DeTra: Motion-Consistent Joint Object Detection and Socially-Aware Trajectory Forecasting in Bird's-Eye-View Images

Unified models for object detection and trajectory forecasting aim to merge perception and prediction for autonomous driving, refining actor trajectories directly over shared bird's-eye-view (BEV) images rasterized from LiDAR and high-definition maps. Their accuracy on dynamic, moving actors, however, remains the hardest part of the task, and the strongest such model, DeTra, has no public implementation. We contribute an openly released DeTra reimplementation with documented approximations, and on top of it MC-DeTra: a family of motion-consistency mechanisms that add supervision through two annotation-derived auxiliary signals – each actor's observed past motion and the occupancy of the surrounding traffic that forms its social context – and one inter-output consistency constraint that aligns an actor's predicted heading with its predicted direction of motion. Every proposed loss is train-only and inference-safe: it shapes the shared BEV representation during training and is removed at test time, adding no inference latency. On the Waymo Open Dataset, evaluated under a strict, detection-conditioned forecasting protocol, MC-DeTra improves dynamic, socially-situated trajectory forecasting while preserving or improving detection accuracy; a gradient-based loss-calibration analysis exposes how the auxiliary objectives compete at the shared backbone, and our ablation identifies which signals contribute most. We release code, configurations, and evaluation tooling at https://github.com/diuzhevVlad/MC-DeTra.
Read the full abstract

Machine Learning

Why Does Post-Training Quantization Work?

Post-training quantization compresses large language models (LLMs) by storing their weights at reduced precision, and each quantized weight introduces an error into the hidden states. Naively, these errors should accumulate with depth and corrupt next-token prediction; randomly initialized models accumulate these discrepancies rapidly, whereas quantized pretrained models accumulate much less hidden-state error and largely maintain downstream task performance, even though they were never trained with quantization noise. This raises the question we address: why does post-training quantization work? Comparing full-precision and quantized forward passes, we identify two mechanisms that characterize pretrained quantization robustness. First, the error a layer newly introduces tends to oppose the error it inherits from the layer's input. The two cancel partially such that the discrepancy between full-precision and quantized passes grows slowly. This counteracting residual interaction develops during pretraining. Our quantitative analysis identifies it as a major factor slowing hidden-error growth. Second, LM-head geometry preferentially preserves the scores and probabilities of high-ranked tokens, which typically represent the model's most confident predictions. Together, these mechanisms explain why quantization error that passes through numerous layers can still produce only small output changes, and we verify the findings across models and quantization settings.
Read the full abstract

All authors Yuxiang Chen, Michael Beyer, Jun Zhu, Jianfei Chen

Populations and Evolution

Competition drives excessive recruitment in collective search

Groups that search collectively often exploit what they find by recruiting: one member directs others to a site it has found. Recruitment raises the number of members foraging at a known site, but the return per forager may fall as that number grows, so there is an intermediate optimal recruitment rate. In addition, a site may be used by more than one group. Here we analyze a model of two groups that forage from a single site whose return declines with the total number of foragers present. The two groups interact only through this shared return. The long-run outcome is either coexistence at the foraging site or monopoly by one group, and we analyze the boundary between these two outcomes. A group's best response to its rival is not monotone: it increases its own recruitment rate with the rival's recruitment rate in an attempt to preserve a monopoly, and then its recruitment rate drops discontinuously when it is no longer optimal to preserve a monopoly. We analyze how model parameters govern this shift: a group relinquishes monopoly when the site saturates at few foragers and when the rival group is small. When the two groups have comparable size there are multiple Nash equilibria, so either group may end up with the larger share. And when two equally matched groups compete, both recruit above the rate that maximizes their common return, so that each individual ends with less than it would in a single undivided group of the same total size.
Read the full abstract

Nuclear Theory

Nuclear-physics-guided Gaussian Processes

Gaussian Process Regression is a powerful nonparametric Bayesian method that provides both predictions and principled uncertainty estimates in closed form. The majority of past applications have relied on agnostic priors, but physics knowledge can be systematically encoded into Gaussian Processes through physically-motivated mean functions and kernels. We exploit this capability in the context of nuclear physics, applying physics-guided Gaussian Process Regression to three problems: nucleon-nucleon scattering phase shifts, mass excesses, and the finite-temperature equation of state of dense matter. In each case, we demonstrate that encoding known theoretical structures yields substantial and systematic improvements in interpolation accuracy, uncertainty calibration, and extrapolation reliability over agnostic baselines. Our results highlight that the design of the prior, and in particular the mean function, is key for obtaining a reliable and well-calibrated Gaussian Process Regression.
Read the full abstract

All authors Javier Rozalén Sarmiento, Hristijan Kochankovski, Arnau Rios, Àngels Ramos

Emerging Technologies

A Time-Based Readout for Vector-Matrix Multiplication in Fully Analog Memristive SNNs

Artificial neural networks rely on vector-matrix multiplications (VMMs), whose implementation in von Neumann architectures is dominated by costly data movement between memory and processing units. Spiking neural networks (SNNs) mitigate this bottleneck by performing in-memory, analog VMMs using memristive crossbar arrays. However, conventional current-mode readout circuits incur significant area and power overhead. This work proposes a fully analog readout architecture based on voltage-to-time conversion of the VMM output. By sensing the column voltage, the proposed approach avoids current-mode summing and scaling circuitry, improving area and energy efficiency. Post-layout simulations of a 10x1 SNN implemented in a 130 nm CMOS technology validate the proposed architecture, while application to a trained 64x10 SNN for digit classification further demonstrates its feasibility for SNN inference.
Read the full abstract

All authors Elia Mateu-Barriendos, Álvaro Gómez-Pau, Josep Rius, Daniel Arumí, Rosa Rodríguez-Montañés, Salvador Manich

Machine Learning (Statistics)

Generalization Analysis of Distributed Kernel-based Robust Gradient Descent Algorithms

In this paper, we investigate the generalization performance of distributed gradient descent algorithms in a reproducing kernel Hilbert space under a robust loss function $l_{\sigma}$. By exploiting the spectral characterization of gradient descent together with the intrinsic properties of robust loss functions, we establish optimal learning rates for the distributed kernel-based robust gradient descent (DKRGD) algorithm with an appropriately chosen scale parameter $\sigma$. The proposed parameter choice of $\sigma$ simultaneously alleviates the saturation phenomenon and guarantees statistical robustness. A key technical contribution is a novel error analysis that provides substantially sharper bounds for products of operators, thereby significantly relaxing existing restrictions on the maximum number of local machines while retaining optimal learning rates. Finally, we develop a communication-efficient strategy that further improves the convergence performance of DKRGD.
Read the full abstract

Mesoscale and Nanoscale Physics

Interplay of Kekulé order, flat bands and electron-phonon coupling in graphene

The Kekulé order in graphene is known to coexist with both an extended flat band near the van Hove singularity (VHS) and enhanced electron-phonon coupling. However, the microscopic origin of this interplay is still not fully understood. Here, this behavior is traced to the Kekulé-induced bond distortion and the resulting redistribution of electronic delocalization. In this picture, the conduction band below the VHS is observed to flatten with increasing Kekulé order, extending its intrinsically weakly dispersive region around the saddle point over a broader momentum range. In parallel, the VHS and dimensionless electron-phonon coupling exhibit approximately quadratic upward responses. The resulting enhancement of the electron-phonon coupling is found to be predominantly governed by the increasing density of states, with the effective deformation potential remaining weakly affected by the distortion. As such, the obtained results are consistent with previous theoretical and experimental studies, while also pointing toward the narrowing of the conduction band and a possible departure of the electron-phonon coupling from the conventional adiabatic regime. Altogether, they highlight the potential of controlled Kekulé ordering for engineering emergent correlated quantum phases in graphene.
Read the full abstract

Systems and Control

Mixed-integer optimization for multi-year military aircraft fleet management

While existing strategies for Flight and Maintenance Planning for the defense sector generally address idealized conditions, real-world planning often involve non-nominal initial fleet states and complex inspection schemes. To address these challenges, we propose a multi-year planning strategy that maximizes long-term fleet availability. The formulation incorporates multiple competing objectives capturing the tight coupling between aircraft usage and maintenance, while enforcing cyclic inspection requirements and limited maintenance-dock capacity. To enhance practical applicability, we introduce three complementary strategies: a receding-horizon approach to reduce computational burden, a Bayesian Optimization routine to automatically tune cost-function coefficients, and an aircraft-specific weighting scheme that adapts model priorities based on fleet-condition statistics. Results on three realistic benchmark scenarios demonstrate the effectiveness of the approach.
Read the full abstract

All authors Matteo Vescovi, Raffaele Giuseppe Cestari, Roberto Valdambrini, Andrea Mercurio, Valentina Breschi, Mara Tanelli

Artificial Intelligence

When Agents Disagree: Bayesian Backward Reasoning as a Label-Free Anchor for Multi-Agent Collective Decision-Making

When multiple LLM agents yield conflicting answers, the decision-making process dictates whether agent diversity improves performance or merely compounds shared errors. Existing collective decision-making methods, including voting, electoral rules, and LLM judges, rely on forward reasoning: they map evidence to labels in one direction. Although these methods can combine diverse forward traces, they still aggregate estimates that share this evidence-to-label factorization and can inherit correlated errors within the forward pool. We therefore construct a reverse posterior for each instance through Bayesian backward reasoning from an explicit likelihood. The forward and reverse posteriors provide differently factorized approximations of the underlying posterior. Because estimates from different factorizations may tend to share the same error less often, we use Jensen-Shannon divergence to rank agents by cross-path consistency. This cross-path consistency signal underlies three strategies: hard selection (MinJS), soft reweighting (FwdJS), and log-linear fusion (LogLin). Evaluated on DDXPlus across five LLM backbones, our proposed strategies show consistent improvements: MinJS outperforms random selection across all backbones, FwdJS generally improves over the strongest baseline, and LogLin achieves the best performance among the evaluated methods, with its largest gains on the subset where the agents disagree. Despite its weaker standalone accuracy, the reverse posterior serves as a more useful anchor than forward-only alternatives, providing complementary information for collective decision-making. When labeled data are available, a lightweight two-stage calibration can further refine the reverse anchor and improve aggregation performance.
Read the full abstract

All authors Ken Chen, Wei Wang, Sachith Seneviratne, Hansani Weeratunge, Saman Halgamuge

Computer Vision

Language-Augmented Semantic Priors for B-Spline Surface Fitting

The use of B-splines and Non-Uniform Rational B-Splines surfaces constitutes the mathematical foundation of contemporary computer-aided design (CAD) systems. Despite long-term progress, geometric kernels in traditional CAD still rely heavily on predetermined heuristic initialization for surface fitting and parameterization. Meanwhile, the procedural semantics and design intent encoded in modeling histories are largely ignored during geometry generation. This disconnect creates a gap between high-level design intent and solver-executable geometric configuration, often leading to suboptimal and semantically inconsistent fitting results. To bridge this gap, we introduce LASP, a Language-Augmented Semantic Priors framework that leverages large language models (LLMs) to infer structured, solver-usable B-spline priors from procedural modeling histories. Rather than modifying the geometric kernel itself, LASP operates as a semantic reasoning layer above existing solvers. It first translates modeling histories into rich textual descriptions that capture design intent, geometric context, and functional relationships, and then uses a fine-tuned LLM to predict structured B-spline prior parameters. LASP is trained through a two-stage scheme that combines local geometric regularities with long-range contextual dependencies, producing priors that are both interpretable and semantically coherent. This approach furnishes inductive signals that direct the conventional B-spline fitting process toward solutions that more accurately encapsulate the intended design objectives and demonstrate heightened semantic coherence. Compared to traditional machine learning schemes, the experiments demonstrate that language-driven reasoning can serve as a powerful inductive bias for geometric solving, establishing a new paradigm of language-guided geometric optimization in modern CAD systems.
Read the full abstract

All authors Yunzhong Lou, Yusheng Luo, Jiahao Li, Yu Song, Xiangdong Zhou

Analysis of PDEs

Limiting Pointwise Decay for the compressible isentropic Navier-Stokes equations

We study the long-time pointwise behavior of small localized perturbations of a constant state for the one-dimensional compressible isentropic Navier-Stokes equations. After subtracting the two Burgers diffusion waves, the convergent sum of all higher-order diffusion waves, and the cross-family viscous corrections, we prove a cone-preserving pointwise estimate for the exact physical remainder and, in particular, \[ |R_i(x,t)|\leq C E_N\log(2+t)\Psi_i(x,t), \qquad \sup_{x\in\mathbb R}\Psi_i(x,t)\leq C(1+t)^{-1}. \] Here \(E_N\) measures the size of the initial data and \(\Psi_i\) is the cone-resolved weight; both are defined precisely in the main theorem below. Thus $\|R_i(t)\|_{L^\infty}\leq C E_N(1+t)^{-1}\log(2+t)$. The key new idea is to apply a familywise Cole–Hopf transformation to the spatial antiderivative of the remainder, which exactly eliminates the critical same-family first-order feedback. We further construct an approximate Green function adapted to the two characteristic families and combine it with Gaussian-mode extraction and a Kawashima-type energy argument. This yields a cone-preserving estimate at the limiting decay rate, up to a logarithmic loss.
Read the full abstract

All authors Rui Li, Xu Song, Guanghui Wang, Lingda Xu

Human-Computer Interaction

Bigger than the EAR BOX: A Theory-Grounded Review of XR Accessibility Research for Deaf and Hard of Hearing Communities

Extended Reality (XR) technologies have received growing attention in accessibility research involving Deaf and Hard of Hearing (DHH) communities. Yet less attention has been given to the assumptions shaping this work. We present a theory-grounded review of XR research involving DHH users. Drawing on Disability Studies, Deaf Studies, and DeafSpace, we develop a theoretical framework with four analytical dimensions: orientation toward access, distribution of responsibility, conceptualization of DHH communities, and spatial and perceptual assumptions. We apply this framework to 53 XR studies involving DHH users, identified through a search and screening of ACM publications from 2015 to 2025. Our analysis shows that XR accessibility is frequently framed as supporting communication within hearing-default environments, while overlooking the diversity of DHH communities. We identify directions for redistributing accessibility labor and reconfiguring space, and offer our framework as a tool for future XR research involving DHH communities.
Read the full abstract

All authors Shuxu Huffman, Michaela Okosi, Jose Merino, Tifanie Bouchara, Abraham Glasser, Christian Vogler, Raja Kushalnagar

Soft Condensed Matter

Impact waves in soft bilayer tissues

In this study, we investigate impact-wave propagation in a pre-stressed compressible hyperelastic bilayer resting on a frictionless rigid substrate within the framework of nonlinear elasticity. Semi-analytical solutions for the transient displacement fields induced by localized surface impulses are derived using the Fourier-Laplace transform, and their long-time asymptotic behavior is obtained through the method of stationary phase. Finite element simulations are further performed to validate the theoretical predictions. The results establish a direct connection between characteristic features of the transient displacement fields and the group velocities of the guided-wave modes, revealing how dispersive propagation and modal contributions shape the observed waveforms. Three representative bilayer models corresponding to human articular cartilage, gingiva, and skin are then considered to examine the effects of variations in layer stiffness and thickness. The results show that structural and material variations can substantially modify the spatial distribution, arrival positions, and characteristic velocities of impact waves. In particular, higher-order modes can make significant contributions to the displacement response in certain parameter regimes, such that the dominant features of the wavefield cannot always be characterized by the fundamental mode alone. These findings demonstrate that transient-wave measurements contain mechanical information beyond that captured by a single characteristic surface-wave velocity and provide a theoretical basis for interpreting transient wavefields in multilayered soft materials and for future non-invasive mechanical characterization.
Read the full abstract

All authors Zhenwei Liu, Yang Liu, Michel Destrade, Yue-Sheng Wang

Dynamical Systems

ACIM instability of piecewise expanding maps through the lens of metastability

Motivated by Keller's W-shaped maps and its variants, we introduce a general class of families of expanding maps such that the perturbed maps have a shrinking almost invariant neighborhood about a fixed point of the limit map. The unique absolutely continuous invariant measures (ACIM) of the perturbed maps can converge to limit measures of various types. A local quantity is identified which determines if the limit is absolutely continuous, singular, or a non-trivial convex combination of these. Furthermore, for the case of a nontrivial convex combination, we prove that the dynamics of the perturbed system, when viewed on an appropriate slow time scale, converges to a jump Markov process, a convergence that extends to the diffusion coefficients for observables of bounded variation. Compared to analogous results on expanding maps with metastable behavior, a new feature of our setting is the emergence of a localized state of the Markov process which corresponds to the shrinking almost invariant interval about the fixed point. Our approach provides a general framework which, in particular, accommodates, to the best of our knowledge, all previously studied families that limit to Keller's W-shaped map.
Read the full abstract

Computer Vision

Spectral Adapters for Segment Anything Model-based Segmentation of Colorectal Liver Metastases in Computed Tomography

Accurate segmentation of colorectal liver metastases (CRLM) in contrast-enhanced computed tomography (CT) is important for response assessment, surgical planning, and follow-up. We propose two parameter-efficient spectral adapters for the Segment Anything Model (SAM): the Directional Spectral Adapter (DiSECT) and Spectral Instance-Guided Adapter (SiGA). DiSECT uses singular value decomposition of frozen weights to constrain residual updates to leading spectral directions, while SiGA adds global and input-conditioned gating through a multilayer perceptron. We evaluate these methods on 446 contrast-enhanced CT volumes (355 training, 91 testing) and compare them with LoRA, QLoRA, convolutional adapters (CAD), and a 3D nnU-Net baseline. Experiments consider single-point, three-point, bounding-box, and no-prompt regimes. SiGA achieves the best single-point performance with a Dice score of 0.77, IoU of 0.69, and HD95 of 35.39 mm. Under no-prompt inference, SiGA reaches 0.76 Dice, 0.68 IoU, and 46.76 mm HD95, comparable to the nnU-Net baseline (0.758 Dice). DiSECT uses only 0.14 million trainable parameters. These results show that spectral adapters can efficiently adapt SAM for CRLM segmentation while retaining strong accuracy with limited trainable parameters.
Read the full abstract

All authors Ramtin Mojtahedi, Mohammad Hamghalam, Jacob J. Peoples, Natalie Gangai, Mithat Gonen, Yun Shin Chun, HyunSeon Christine Kang, Richard K. G. Do, Amber L. Simpson

Differential Geometry

Rigidity and flexibility under positive isotropic curvature

For every $n\ge4$ and $L>0$, we construct a smooth $4$-PIC metric on $S^n$ with Urysohn $1$-width at least $L$ and an embedded stable minimal disk of intrinsic inradius at least $L$. These examples disprove the proposed width and stable-disk radius bounds under a positive lower bound for isotropic curvature. On closed even-dimensional manifolds, we prove the sharp estimate $\lambda_1^{(2)}\ge(n-1)\sigma/2$ under $\sigma$-PIC and show that equality forces roundness if a closed eigenform attaining the bound has rank at least four at some point.
Read the full abstract

Signal Processing

$hp$-adaptive trees for graph signal approximation

Tree-encoded partitionings of graphs are fundamental tools for the decomposition and approximation of graph signals. For the efficient approximation of such graph signals, we develop strategies based on $hp$-refinement by combining domain decomposition with an improved local approximation using polynomials of higher degree. In this way, from a given graph partitioning tree, a more efficient subtree is extracted in which the cost of the signal approximation is considerably reduced by still maintaining the same total error. To this end, we interpret the refinement process as a binary knapsack problem to determine an enhanced partitioning tree. We further study an a-posteriori strategy which prunes the partitioning tree by optimizing the polynomial degrees over the subdomains. To make polynomial basis systems accessible for general graphs or high-dimensional data, we propose local embeddings of graphs into low dimensional Euclidean spaces. We underpin the efficiency of our algorithms with extensive numerical tests which carefully assess the impact of the applied refinements and optimization strategies.
Read the full abstract

High Energy Physics (Phenomenology)

NLO corrections to the NEik DIS structure functions

We summarize the next-to-leading order (NLO) corrections to next-to-eikonal (NEik) quark background contributions to DIS structure functions. At NEik accuracy, in addition to corrections arising from the gluon background field of the target, DIS structure functions receive contributions from the $t$-channel quark exchanges, represented by insertions of the quark background field of the target. The latter provide the lowest order contributions in $\alpha_s$ at NEik accuracy. We show that the NLO corrections to the longitudinal NEik structure functions are finite, whereas those to the transverse NEik structure functions exhibit rapidity and ultraviolet (UV) divergences. We analyze these divergences and extract the finite contributions.
Read the full abstract

All authors Tolga Altinoluk, Guillaume Beuf, Jules Favrel, Michael Fucilla

Computation and Language

Negative Self-Distillation: Learning to Reason by Avoiding Flaws

On-Policy Self-Distillation (OPSD) has emerged as a popular paradigm for large language model (LLM) self-improvement, allowing models to act as their own teachers by leveraging privileged information such as ground-truth solutions. However, recent findings indicate that OPSD can severely degrade the performance of LLMs on complex reasoning tasks: By forcing the student to imitate an artificially confident reasoning trace conditioned on privileged information, OPSD inadvertently suppresses expressions of uncertainty and penalizes the exploratory, self-corrective behaviors required to solve challenging problems. To address this, we introduce Negative Self-Distillation (NSD), a new framework that optimizes LLMs by diverging from flawed reasoning rather than imitating privileged solutions. Instead of relying on ground-truth answers or external supervision, NSD uses the model itself to generate a question-specific negative condition (eg, acting as a “careless reasoner”) and pushes the student's distribution away from this self-generated negative teacher. Naively applying unlearning objectives to achieve this divergence is problematic, as flawed reasoning tokens are confounded with basic linguistic tokens; indiscriminately penalizing both risks catastrophically degrading the model's foundational language capabilities. We resolve this by designing a dynamic gating mechanism that automatically identifies and isolates reasoning-critical tokens, ensuring gradient updates target only behavioral flaws while preserving the model's linguistic priors. Empirically, NSD consistently outperforms OPSD and other label-free, self-bootstrapping reinforcement learning (RL) baselines.
Read the full abstract

All authors Rongcan Pei, Zhepei Wei, Shuyao Xu, Xinyu Zhu, Wei-Lin Chen, Yu Meng

Robotics

Aerodynamic Prior-Free Coordinated Trajectory Generation and Tracking Control for a Tail-Sitter UAV

This paper presents a coordinated trajectory generation and tracking control framework for a tail-sitter unmanned aerial vehicle (UAV), which does not require aerodynamic priors identified for a specific airframe while addressing the challenge of flight control under highly nonlinear aerodynamics across the full flight envelope. The core innovation lies in employing phase-specific aerodynamic modeling strategies for planning and tracking, tailored to their distinct functional characteristics, without requiring airframe-specific aerodynamic priors. Specifically, the phi-theory model under coordinated flight is employed to derive an analytic differential flatness mapping, and a simplified but locally accurate model is established for predictive control to enable real-time aerodynamic parameter estimation. The proposed framework is evaluated extensively through both simulation and challenging real-world flight tests under mild wind conditions, showing high-precision tracking and adaptability across the tested aerodynamic conditions. To the best of our knowledge, this is the first real-world demonstration of accurate trajectory tracking over tested flight regimes spanning the full envelope of a tail-sitter UAV without relying on aerodynamic identification campaigns. The source code of our framework is available at: https://github.com/SYSU-HILAB/AP-PnC.
Read the full abstract

All authors Erchao Rong, Zihao Liu, Junning Liang, Jianguo Wang, Xiao Jie, Haoran Fu, Ziliang Chen, Ximin Lyu

Robotics

ActSafeGuard: Differentiable and Training-Aligned Constraint Enforcement for Flow-Matching Policies

Vision-Language-Action (VLA) and World-Action Models (WAMs) have demonstrated strong capabilities in general-purpose robotic manipulation, yet their generated actions may violate hard physical constraints and therefore be unsafe or infeasible for deployment. Existing safety approaches either optimize statistical safety objectives without deterministic per-step guarantees or correct unsafe actions only during inference, creating a mismatch between policy training and execution. We introduce ActSafeGuard, a differentiable and training-aligned safeguard layer for flow-matching based policies. ActSafeGuard integrates hard action feasibility into policy learning, not merely treating safety as an inference-time external component. Through an analytical ray-scaling operator design, ActSafeGuard enables boundary-aware gradients to guide the model to naturally learn constrained manifolds. Extensive experiments on multiple standard foundation backbones ($\pi_{0.5}$ and Fast-WAM) across various tasks demonstrate that ActSafeGuard consistently achieves a $100\%$ step safety rate while fully preserving or even boosting task success rates, providing a scalable and minimally invasive solution for safe embodied AI deployment.
Read the full abstract

All authors Jianming Ma, Rongjun Jin, Xiaxi Si, Yang Zhang, Yiheng Li, Yue Gao

Computational Physics

Stress-Testing Dynamical and Generative Downscaling Using Subseasonal Extreme Precipitation Forecasts

Coarse spatial resolution limits the ability of subseasonal prediction models to resolve extreme precipitation. Downscaling with either dynamical or deep generative models can overcome this issue, but the comparative performance of these models for extremes across different atmospheric regimes remains poorly understood. In this work, we evaluate the Weather Research and Forecasting (WRF) model against a diffusion-based generative model by downscaling two physically distinct, extreme precipitation events up to lead times of 3 weeks. For a fair comparison with WRF, which can downscale boundary conditions from different driving models without model-specific training, the diffusion model is trained in an unpaired fashion. Both approaches improve upon the raw European Centre for Medium-Range Weather Forecasts forecasts, in comparison to fused rain gauge-radar observations in Switzerland (CombiPrecip), but exhibit regime-dependent strengths. WRF achieves the highest probabilistic skill for a multicell, non-stationary event. Conversely, the diffusion model is more consistent across different performance metrics for the two events, outperforming WRF in a more stationary supercell event. These results demonstrate that explicit dynamical modeling can add value for specific precipitation events for subseasonal lead times, and that generative downscaling adds value more broadly in different situations.
Read the full abstract

All authors Mauricio Lima, Marika Koukoula, Romain Pilon, Monika Feldmann, Erwan Koch, Daniela I.V. Domeisen, Tom Beucler

Networking

Electroencephalography Signal Analysis for Human Activities Classification: A Solution Based on Machine Learning and Motor Imagery

Electroencephalography (EEG) is a fundamental tool for understanding the brain's electrical activity related to human motor activities. Brain-Computer Interface (BCI) uses such electrical activity to develop assistive technologies, especially those directed at people with physical disabilities. However, extracting signal features and patterns is still complex, sometimes delegated to machine learning (ML) algorithms. Therefore, this work aims to develop a ML based on the Random Forest algorithm to classify EEG signals from subjects performing real and imagery motor activities. The interpretation and correct classification of EEG signals allow the development of tools controlled by cognitive processes. We evaluated our ML Random Forest algorithm using a consumer and a research-grade EEG system. Random Forest efficiently distinguishes imagery and real activities and defines the related body part, even with consumer-grade EEG. However, interpersonal variability of the EEG signals negatively affects the classification process.
Read the full abstract

All authors Tarciana C de Brito Guerra, Taline Nóbrega, Edgard Morya, Allan de M. Martins, Vicente A de Sousa Jr

Analysis of PDEs

Numerical Study of Reported Multiple Solutions to a Cauchy Problem for the 2d Incompressible Euler Equations

Bressan and Shen (2021) jointly with Bressan and Murray (2020) proposed a simple example of a Cauchy problem on $\mathbb{R}^2$, characterized by two key parameters, intended to yield nonunique weak solutions of the incompressible Euler equations. They suggest that a limiting process applied to two specific approximations of their example initial data yields two distinct solutions. Here we provide evidence coming from a carefully designed numerical procedure to support if, or when, this intriguing claim is valid. Some of the numerical challenges encountered in the present study are: (i) the proposed initial data is unbounded in a neighborhood of the origin, (ii) the proposed problem is posed on all of $\mathbb{R}^2$, (iii) several essential symmetries present in the true solution must be captured, (iv) the proposed example depends on two parameters which may be critically linked. We demonstrate that an extremely large computational domain is mathematically necessary to capture the core symmetries of the exact free-space problem. Accordingly we implement a nested-grid strategy specifically designed for its particular suitability and efficacy for the problem at hand. Our strategy also allows us to achieve extreme grid refinement in the region where solution accuracy is most critical. Within our nested-grid framework, we design an underlying discretization scheme that is high-order, robust, and fast. We consider a broad collection of allowable parameter pairs, but among all of them we find only one that may satisfy the suggested claim.
Read the full abstract

Discrete Mathematics

An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval

We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.
Read the full abstract

All authors Hao Lu, Yuan Yuan, Xingwu Liu, Xin Han, Yong Zhou

High Energy Physics (Phenomenology)

Hunting the Unseen: Deep Learning Analysis for Semi-Visible Jet Tagging

Semi-Visible Jets (SVJs) constitute a distinctive collider signature of strongly interacting dark sectors, embedding Dark Matter candidates, wherein jets contain both visible Standard Model objects and invisible dark hadrons, giving rise to correlated jet activity and missing transverse momentum. In this work, we investigate SVJs produced through a heavy Z' mediator and perform an study over a representative set of benchmark scenarios spanning different mediator masses and dark sector parameters in the context of so-called Hidden Valley Models. To characterise the signal, we combine global event kinematics with jet substructure observables, including the primary Lund Jet Plane (LJP), the two-point energy correlation, angularity, and charged hadron multiplicity. These representations are used to train five Deep Learning classifiers for SVJ vs standard jet discrimination: a Vision Transformer operating on LJP images, a JetLOV network based on a hierarchical clustering tree, a Multi-Layer Perceptron using high level observables, and two multimodal networks that combine the image-based or hierarchical representations of the radiation pattern with the high jet-level observables. This enables a direct combination of global kinematics, radiation patterns, and jet clustering structure. We find that global kinematic observables outperform the LJP and hierarchical jet representations, with the latter providing stronger discrimination than LJP images. Combining these complementary representations with global kinematics yields the best overall performance. More broadly, this study shows that unlocking the full discovery potential of SVJs would benefit from going beyond global kinematics to exploit the rich information encoded in their internal structure, providing a benchmark for future searches at the Large Hadron Collider.
Read the full abstract

All authors Miguel A. Avendaño-Bernal, Srinandan Dasmahapatra, Ahmed Hammad, Stefano Moretti, Mihoko Nojiri, Michael H. Seymour, Claire Shepherd-Themistocleous

Combinatorics

Asymptotic $q,t$-Fuss–Catalan numbers for type $B$

Let $W=W(B_n)$ act diagonally on $\mathfrak{h}\oplus\mathfrak{h}^*$, let $S=\mathbb{C}[\mathfrak{h}\oplus\mathfrak{h}^*]$, let $J\subset S$ be the ideal generated by the $W$-alternating polynomials and $\mathfrak{m}_S$ is the maximal ideal of the origin. For sufficiently large $m$ we compute $q,t$-Fuss-Catalan polynomial $Cat^{(m)}(B_n;q,t):=Hilb(\frac{J^m}{\mathfrak{m}_S J^m})_{det-part}$ and imply $Cat^{(m)}(B_n;1,1)=\binom{n(m+1)}{n}$. For proofs, we work with the $\Gamma$-equivariant Hilbert scheme $Y_n=n\Gamma$-$Hilb(\mathbb{C}^2)$, $\Gamma=\mu_2$ and Haiman-type Koszul complex that defines the punctual locus of $Y_n$. Our formula for $Cat^{(m)}(B_n;q,t)$ is derived from a localization computaion for the Haiman-type Koszul complex.
Read the full abstract

Probability

On the maximum visibility in a ball through the vacant set of Poissonian obstacles

We study the maximum visibility in a ball inside the vacant set of three obstacle models in $\mathbb R^d$ with slow decay of spatial correlations and disparate obstacle geometries: Poisson Boolean models with general i.i.d. radii distributions, Poisson cylinders and Brownian interlacements. Let $M_r$ be the maximum distance between points $x$ and $y$ in the ball $B(r)$ such that $x$ is visible from $y$. We prove that $M_r$ divided by $q_r$ converges in probability to an explicit model dependent constant, where $q_r=\log r$, except for the Brownian interlacements in dimension $d=3$, where $q_r = \log r\log\log r$.
Read the full abstract