Robotics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 3 September
Autonomous navigation in space requires reliable terrain assessment for safe operations, especially in underground environments with limited communication, computing resources, and power budget. This paper presents a lightweight method for real-time vibration-aware traversability mapping using a Light Detecting And Ranging (LiDAR) point cloud and Inertial Measurement Unit (IMU) measurements. An initial vibration proxy is estimated from terrain geometry by applying Random sample consensus (RANSAC) to local point-cloud patches produced by a Simultaneous Localisation And Mapping (SLAM) algorithm. In parallel, the IMU provides local observations of the vibration experienced by the rover during traversal. The point-cloud-based prediction is then corrected online using Recursive Least Squares, allowing the system to adapt the geometric estimate to the measured rover response. The approach is evaluated in a lunar analogue environment, an outdoor field, and an underground mine.
Computation and Language
Opening mind by opening architecture: analysis strategies
In numerical signal processing for electroacoustic composition, the progressive loss of specific development and research environments caused by the increasing use of digital market tools has favoured the dominance of the closed-architecture audio processor model. This model, while powerful, envisions the possibility of describing output data about its perceived characteristics, but at the cost of ignoring its internal process and interacting systems, which become complex, powerful environments but closed in an inscrutable black box, a loss we must consider. Any digital signal processing technique tells a story. Just as the words of a language incorporate social, historical and technical polysemic layers, a signal processor has its own story of implementation, a gradual technological achievement with its inevitable aesthetic consequences. Through the looking-glass of literature, one can access those environments with renewed awareness by reestablishing a scientific method and an attitude to research. In this specific case, starting from the case study of Manfred Schroeder's historical reverbs, we illustrate the process of building analytical evaluation tools, as well as practical implementation, at the basis of a conscious study path.
Read the full abstract
Computational Engineering
What Do CAE Simulation Agents Really Need Beyond a Generic Harness?
Computer-aided engineering (CAE) simulation is among the largest and most demanding areas of engineering, where setting up a solver such as OpenFOAM, FEniCS, or COMSOL takes real expertise. Large language model (LLM) agents promise to turn a natural-language request into a working simulation, and recent CAE agents add simulation-specific machinery: multi-agent decomposition, domain retrieval, and scripted reflection. That machinery suited weak base models; modern harnesses already supply multi-turn reasoning, tool use, and execution feedback. We ask what a CAE simulation agent still needs beyond a generic harness. With information access and repair budget held fixed, a single-agent harness matches or beats multi-agent specialized systems (FoamBench 96.4% vs.\ 88.2%). Ablations trace this to capabilities the harness already provides: execution-feedback repair lifts FoamBench from 71.8% with no repair round to 96.4%, while scripted reflection adds nothing. The one input that still helps is domain knowledge supplied as solver tutorials, our largest measured gain (80.9% to 96.4%).
Read the full abstract
Materials Science
Gd-4f Exchange Splitting and Mo-4d Crystal-Field Redistribution in Gd/W Co-doped La2Mo2O9: A DFT+U Study
La2Mo2O9 (LAMOX) is a promising oxide-ion conductor for intermediate-temperature solid oxide fuel cells, but its practical application is limited by a first-order monoclinic-to-cubic (alpha to beta) phase transition. Here, we investigate the electronic structure of pristine La2Mo2O9 and the Gd/W co-doped composition La1.6Gd0.4Mo1.7W0.3O9 using spin-polarized density functional theory with an on-site Hubbard correction for the localized Gd-4f states. The projected density of states reveals that pristine La2Mo2O9 is an O-2p/Mo-4d charge-transfer oxide in which La contributes negligibly near the band edges. Gd/W co-doping introduces a strongly exchange-split Gd-4f manifold with a majority-minority separation of approximately 1011 eV, substantially redistributes the Mo-4d electronic states through a threefold increase in crystal-field splitting, and reduces the O-2p contribution near the valence-band maximum from 78% to 66%. These electronic signatures are consistent with the experimentally observed lattice contraction, MoO Raman-mode softening, and the non-monotonic evolution of oxide-ion conductivity across the co-doped series. In particular, the pronounced crystal-field splitting and localized Gd magnetism at the highest doping level provide a microscopic electronic explanation for the observed suppression of ionic conductivity. The present results establish an atomistic electronic-structure framework for understanding dopant-induced phase stabilization and oxide- ion transport in Gd/W co-doped LAMOX electrolytes, providing design principles for improved solid oxide fuel cell materials.
Read the full abstract
Artificial Intelligence
Artificial Intelligence for Energy Optimization in Data Centers
Data centers are increasingly optimized by artificial intelligence and, at the same time, increasingly loaded by it. The literature treats these as two unrelated problems: control studies model workload as an exogenous arrival process, while sustainability studies model infrastructure as a fixed multiplier. We screen roughly 194 papers retrieved through a documented protocol, code 63 of them, and report what the coding shows. Of 28 primary control-oriented studies, 18 are validated in simulation alone and 5 reach physical hardware or a production facility; none account for water withdrawal, and none account for embodied carbon. Reported savings intervals across four technique families overlap almost completely, which means the field cannot presently rank its own methods. Ten recurring gaps are scored for consequence and tractability, and we set out CLEAR-DC, a framework coupling a control-policy branch to a workload-demand branch through an explicit elasticity term, reads out net rather than direct benefit, and emits a schema-conformant record covering energy, carbon, water, embodied share and validation venue. The framework is an architectural and methodological proposal, not a trained system; the contribution we defend empirically is the corpus analysis and the reporting schema derived from it. Coding sheet, derived statistics and all result artifacts: https://github.com/Kimalice/AI-for-Energy-Optimization-in-Data-Centers-Closing-the-Optimizer-Load-Loop
Read the full abstract
Robotics
MINERVA: How Small Can a Manipulation Policy Be and Still Solve LIBERO?
Vision-language-action (VLA) models with billions of parameters now dominate the LIBERO manipulation benchmark, but the model capacity actually required by the benchmark remains unclear. We introduce MINERVA (MINimal Efficient Robotic Vision-Action policy), a family of deliberately compact visuomotor policies designed to measure this task-specific capacity floor. A 0.54M-parameter policy achieves 95.1% average success over 2,000 rollouts on the four standard LIBERO suites, only 2.4 points below the reported LeRobot $\pi_{0.5}$ result despite using 7,700$\times$ fewer parameters. Performance saturates near 1M parameters and collapses below 0.25M. Across broad architectural, training, and inference sweeps, only action-chunk length and vision capacity consistently exceed a $\pm$1-point training-seed band. Flow matching provides no detectable advantage over direct L1 regression across three seeds, while regression is up to 3.8$\times$ faster on GPU. A task-ID permutation probe shows that standard LIBERO instruction conditioning primarily selects among memorized tasks: changing only the task-ID mapping reduces success to near chance. The same recipe achieves 94.6% success across 89 LIBERO-90 tasks, while LIBERO-Plus perturbations reduce performance to 46–56%, with near-zero robustness to photometric shifts. The 0.54M policy replans every control step in 5–9 ms per chunk on a laptop CPU, 113$\times$ faster than SmolVLA and 1,400$\times$ faster than $\pi_{0.5}$, without a GPU. These results establish a first empirical estimate of LIBERO's task-specific capacity floor and motivate capacity-aware design and distillation for deployment-efficient robot policies.
Read the full abstract
High Energy Astrophysical Phenomena
The Physics of the Nebular Phase in Black Hole X-ray Binaries: Modelling V404 Cygni
Some of the most extreme galactic black hole transients exhibit a nebular phase at the end of their outbursts. This stage was first identified in the 2015 outburst of V404 Cygni, when it dominated the optical spectrum for ~4 days. It is characterised by exceptionally strong optical emission lines, together with a significant increase in the Balmer decrement. The emission features show broad wings reaching velocities consistent with outflow speeds derived from prominent P-Cygni profiles that preceded the nebular phase. They are thus interpreted as arising from previously launched ejecta that expand and recombine as X-ray irradiation declines. In this work, we modelled this phase using the photoionisation code Cloudy. Adopting simple assumptions for the irradiating continuum and emitting gas, we quantitatively reproduced key observables, such as the Balmer decrement and the H$\alpha$ equivalent width, and qualitatively reproduced the observed spectra. Our simulations show that the Balmer decrement remains roughly stable within the observed range across orders-of-magnitude changes in the density and ionisation parameter, spanning $n_\mathrm{H} \sim 10^{10.5}-10^{12.5}\,\text{cm}^{-3}$ and $-1.5 \lesssim \log\xi \lesssim 1$. This supports the scenario in which the nebular phase can persist through moderate ejecta expansion and cooling, consistent with observations. Finally, we used different approaches to constrain the general properties of the nebular phase, which we propose is produced by clumpy, partially ionised ejecta whose total mass likely exceeds the mass accreted during the outburst.
Read the full abstract
Analysis of PDEs
A SHARP MASS THRESHOLD FOR BOUNDEDNESS IN A CRITICAL QUASILINEAR CHEMOTAXIS MODEL WITH INDIRECT SIGNAL PRODUCTION: THE RADIALLY SYMMETRIC CASE
A critical quasilinear chemotaxis model with indirect signal production in space dimensions higher than two is studied under radial symmetry. Exploiting the variational structure of the system, the existence of a sharp mass threshold M\textsubscr{c} > 0 is established: all solutions with mass below M\textsubscr{c} are global and bounded, while those with mass above M\textsubscr{c} and sufficiently negative energy are global but blow up in infinite time. Moreover, the value of the critical mass M\textsubscr{c} is related to the best constant of a variant of a Hardy-Littlewood-Sobolev inequality.
Read the full abstract
Databases
Aker: Density-Aware Approximate Caching for Vector Search (Extended Version)
Disk-based approximate nearest neighbor search (ANNS) incurs high I/O overhead due to frequent disk accesses during index traversal. Approximate caching, which reuses the results of past queries to serve future similar queries, offers a promising approach to bypass expensive disk searches. However, existing approaches suffer from two key limitations. First, their approximate hit predicates fail to simultaneously achieve high throughput and high accuracy, as they do not adapt to the varying local neighbor density in high-dimensional spaces. Second, they lack an effective refresh mechanism to maintain cache correctness under vector updates. We present Aker, an approximate cache for disk-based ANNS. Aker addresses these limitations through two core design choices. First, we introduce a per-query similarity threshold, where each cache entry maintains its own threshold that is dynamically adjusted based on observed cache hit patterns. This design enables Aker to adapt to neighborhood densities to preserve both efficiency and accuracy. Second, we propose del-consistency, a consistency model for ANNS caches that applies deletions eagerly and insertions lazily. Under this model, Aker implements a low-overhead refresh mechanism that bounds cache staleness and preserves high search accuracy. We integrate Aker into pgvector and evaluate it on representative workloads. Aker improves recall by up to 64 percentage points over prior solutions and increases QPS by up to 3.2x, while using 0.6x the memory of pgvector's shared buffers.
Read the full abstract
Differential Geometry
Chern's Conjecture with Constant Cubic Trace
We prove that the values set of \(S=|A|^2\) attained by closed embedded minimal hypersurfaces in \(\mathbb S^{n+1}(1)\) with constant \(S\) and constant \(f_3=\operatorname{tr}(A^3)\) is locally finite, where \(A\) denotes the shape operator. Neither the topology of the hypersurface nor the value of \(f_3\) is fixed.
Read the full abstract
Solar and Stellar Astrophysics
New scaling relations from MESA models for mass and radius of subgiant stars: application to Kepler targets
The precise determination of the fundamental parameters of stars is crucial for understanding stellar structure and evolution. In this regard, the asteroseismic parameters of solar-like oscillating stars obtained from space telescopes are very useful for determining the mass ($M$) and radius ($R$) of single stars using classical scaling relations. These relations still need to be improved. In this study, we develop alternative scaling relations based on reference frequencies ($\nu_{\rm min}$) due to helium ionization zone glitches, specifically for subgiant (SG) stars. We compile main-sequence and SG {\small{MESA}} models from the literature and derive new scaling relations for stellar $R$ and surface gravity ($g$) of evolved stars. The expressions for $R$ and $g$ are obtained simultaneously as functions of the large frequency separation, $\nu_{\rm min}$, and metallicity. These new relations allow $M$ and $R$ to be reliably determined only from observational parameters, without the need for detailed stellar modelling. The resulting $\nu_{\rm min}$-based relations are applied to a sample of 31 SG stars observed by the Kepler mission, with masses in the range 0.85-1.74 M$_\odot$ and radii between 1.03 and 2.82 R$_\odot$. Using simultaneous solutions, we estimate new mass and radius ranges of 0.89-1.62 M$_\odot$ and 1.04-2.95 R$_\odot$, respectively. The results demonstrate significant improvements in the determination of $M$ and $R$ for evolved Kepler target stars, highlighting the potential of the new scaling relations in asteroseismic analyses.
Read the full abstract
Solar and Stellar Astrophysics
The Role of Preceding CMEs and SIRs in Enhancing Shock Acceleration of Electrons
The role of large-scale pre-existing interplanetary structures, including preceding coronal mass ejections (CMEs) and stream interaction regions (SIRs), in shaping the shock acceleration environment for energetic electrons remains not fully understood. In this study, we investigate nine interplanetary shocks observed by the Solar Terrestrial Relations Observatory (STEREO) that are associated with significant MeV electron enhancements, as such enhancements are rarely observed at interplanetary shocks. We combine remote-sensing observations, drag-based modeling, and in-situ measurements to analyze the shock propagation through pre-existing interplanetary structures. Eight of the nine events are associated with a preceding slow or intermediate-speed CME, while six shocks are in-situ observed propagating within preceding ICMEs, indicating that large-scale upstream trapping structures are a common feature of these events. Further analysis identifies three distinct scenarios associated with enhanced electron acceleration: shocks propagating through preceding ICMEs, shock-SIR interactions, and direct injection of flare-accelerated electrons into SIRs. As a representative shock-in-ICME event, the 2012 January 29 low-$\beta$, quasi-perpendicular shock ($\theta_{Bn}\sim87^\circ$) is further investigated using observations together with one-dimensional Monte Carlo test-particle simulations of a shock propagating into a large-scale upstream magnetic loop. The simulation suggests that the upstream loop prolongs electron residence near the shock and substantially enhances acceleration efficiency. These results demonstrate that large-scale interplanetary structures can precondition the upstream magnetic environment, providing favorable conditions for prolonged electron residence and efficient shock acceleration.
Read the full abstract
Strongly Correlated Electrons
Fermi-Point Topology Determines Emergent Conformal Criticality in Extended Quantum Spin Chains
Quantum criticality in one-dimensional quantum systems is characterized by emergent conformal field theories (CFTs), whose central charge counts independent gapless degrees of freedom. Establishing a microscopic connection between this universal conformal structure and the momentum-space topology of the underlying quasiparticle spectrum remains challenging. Here, we uncover a direct correspondence between Fermi-point topology, conformal criticality, and quantum entanglement in an extended quantum spin chain with competing cluster interactions, exchange anisotropy, and a transverse magnetic field. We show that interaction- and field-driven Lifshitz transitions generate conformal critical phases with effective central charges $c_{\rm eff}=1/2$, $1$, $3/2$, $2$, and $3$, including a multicritical point where Ising and Luttinger-liquid sectors coexist. Importantly, the central charge is not determined simply by the number of lattice gap closings or Fermi points, but by the number and conformal content of independent low-energy continuum sectors after accounting for lattice symmetries, reciprocal-lattice identifications, and mode equivalences. Thus, Lifshitz transitions may leave the conformal anomaly unchanged or modify the central charge depending on whether spectral reconstruction generates new independent continuum sectors. Real- and momentum-space entanglement spectra provide complementary microscopic signatures, revealing both the conformal content and momentum-space organization of critical modes. Our results establish a microscopic framework linking Fermi-point topology to emergent CFTs and show how interaction-driven spectral reconstruction can generate higher-central-charge criticality and unconventional multicritical behavior.
Read the full abstract
Artificial Intelligence
Counterfactual Routing Using Integer Programming with Constraint Generation
We present our submission to the IJCAI 2025 'Counterfactual Routing Competition' (CRC 25). The goal of the competition is to find counterfactual explanations for the shortest path problem. This requires deciding what the minimal changes to a road network would make a route chosen by the user the optimal route. This enables explanations such as "Your suggested route would indeed have been optimal, if road X were not a bicycle path." Our solution models the problem as an integer program, iteratively incorporating constraints until an exact solution is found. In the final evaluation on held-out test instances, our method ranked fourth in solution quality and obtained its solution fastest on every instance, with an average runtime of 9.0 seconds compared to 118.8 seconds for the next-fastest submission.
Read the full abstract
Quantum Physics
Q-Edge: Symmetry-Reduced Quantum Simulation of Structured Extreme Dependence
High-dimensional simulation of multivariate extremes is fundamentally limited by the combinatorial complexity of dependence, often more than by the scarcity of extreme observations. We show that symmetry admits a lossless orbit-space representation that preserves structured extreme dependence while replacing an exponentially large dependence space with a compact set of symmetry classes. Based on this principle, we develop Q-Edge (Quantum Extreme Dependence Engine), a symmetry-reduced quantum framework that operates directly in orbit space, enabling scalable simulation and digital twins of structured extreme systems. By transferring symmetry into the data representation rather than the quantum circuit, Q-Edge allows unconstrained quantum generative models to exploit dramatically reduced state spaces. For a 30-dimensional problem, approximately 1.6 million angular states collapse to 256 orbit states, reducing the required quantum representation from about 21 qubits to 8. Our results establish a general computational principle for scalable quantum simulation of structured extreme dependence.
Read the full abstract
Machine Learning
Federated Causal Discovery via Regression-Directed Cumulants
In this paper we study linear non-Gaussian acyclic models (LiNGAM) when used in federated environments. These causal models allow one to go beyond Markov equivalence. However, in many domains data are scarce, and increasing the sample size by centralising data from different clients is not advisable due to regulations such as the GDPR. The federated environment offers an attractive option to balance privacy and causal discovery accuracy. Unfortunately, the standard centralised estimator in the LiNGAM setting, i.e., DirectLiNGAM, cannot be straightforwardly federated. Higher-order cumulant tensors offer a way around this obstacle: they depend only on the joint distribution of the variables involved and add exactly across independent sample groups, so a single communication round suffices in horizontal, vertical, and hybrid partitions. However, FedISHC, i.e., the current federated method along these lines, breaks down under near-symmetric noise. To overcome the above limitation, we introduce the FedRCD family of causal discovery algorithms, and investigate three variants that trade off communication rounds against algebraic noise; two of them are exact federated counterparts of the centralised high-order cumulant (HC) and HC-LiNGAM algorithms, and the single-round variants further effectively support exact unlearning at any granularity, from a single observation to a whole client. Numerical experiments show that at sample sizes typical of real deployments, the entire cumulant-based federated family does not actually rank variables by the population asymmetry that the scores encode at zero. It ranks them by a variance ladder induced by the DAG along its directed paths, the cumulant counterpart of varsortability. Marginal standardisation collapses every cumulant method to near-random ordering, while scale-invariant DirectLiNGAM, not federable under this protocol, is unaffected.
Read the full abstract
Robotics
Toward an~Integrated Cognitive–Ergonomic Architecture for~Human–Machine Interaction: Combining Cognitive Models with~Human Factors Ergonomics
This paper presents an integrated approach to modeling human competencies by combining the theoretical foundations of cognitive architectures with principles from Human Factors Ergonomics (HFE). Through a comparative analysis of established cognitive models-SOAR, ACT-R, LIDA, and COCOM-we synthesize a tailored architecture designed to address the complexities of human-machine interaction (HMI) in dynamic environments. By contextualizing this model within ergonomic frameworks, we elucidate the mechanisms underlying decision-making, skill acquisition, and adaptive behavior, bridging the gap between cognitive theory and applied system design. Our framework is empirically grounded in industrial robotics applications, where operator expertise, normative knowledge, and real-time feedback loops are critical. The proposed architecture not only enhances the cognitive alignment of HMI systems but also provides a scalable methodology for designing intelligent, human-centered interfaces in high-stakes environments. This work advances both the theoretical understanding of human competencies and the practical implementation of adaptive, ergonomically optimized systems.
Read the full abstract
Quantum Physics
Fractalizing spacetime: Floquet codes with fractonic excitations that are immobile in space and time
We generalize fractalization, a procedure for the construction of fracton models, from space to spacetime. We apply spacetime fractalization to construct fracton floquet codes with syndrome excitations that have limited mobility in space and time. This extends the notion of fracton order to intrinsically dynamical quantum phases of matter that are inequivalent to static fracton phases. We find spacetime type-II fracton floquet codes which have no topological excitations that are mobile in space or time. These codes exhibit an extreme form of quantum discrete time crystal order with response periods that scale exponentially in their linear system sizes. In this context, the no-strings rule that characterizes type-II fractons leads to a superlinear scaling of the floquet code fault-distance with time, potentially lowering the time overhead required for quantum error correction.
Read the full abstract
Artificial Intelligence
Synthetic Semantic Supervision for Contrastive Code Representation Learning in Small Transformers: An Empirical Study
General-purpose code embeddings power tools for code search, classification, and retrieval. Compact transformer encoders for code typically rely on either human-written docstrings (labor-intensive and inconsistent) or mined structural signals such as execution traces (setting-specific and costly to collect). We empirically study an alternative: contrastive pretraining of small encoders with synthetically generated natural-language descriptions emphasizing code functionality and intent, paired with code in a dual-encoder framework at training and discarded at inference. We benchmark this approach against pretraining-based baselines, generalist LLMs, and embedding-specific models on eight retrieval, classification, and generation tasks across C, C++, and Java. Synthetic semantic supervision yields statistically significant gains over pretraining baselines of the same inference-time size on five of eight tasks, with parity on two more; once fine-tuned, it matches or exceeds zero-shot models two orders of magnitude larger on classification, and it stays on par with execution-aware supervision at matched pretraining data, suggesting a scalable, effective alternative to existing code-representation paradigms.
Read the full abstract
Astrophysics of Galaxies
Rapid Growth of Intermediate-Mass Black Holes through Disk-induced Stellar Disruptions
Dense nuclear star clusters provide unique environments for studying the dynamical interactions between stars and massive black holes. When an accretion disk is present, dissipative star–disk interactions can capture surrounding stars, drive their inward migration, and ultimately lead to disk-induced tidal disruption events\,(dTDEs). The long-term feeding rate from this process, however, cannot be inferred from single-orbit migration estimates alone, as it depends on the coupled evolution of disk capture, collisional relaxation, stellar depletion and replenishment, and physical mergers within the star cluster. In this work, we use high-performance direct $N$-body simulations combined with analytic prescriptions for star–disk interactions to follow this coupled evolution for intermediate-mass black holes\,(IMBHs) with accretion disks embedded in dense stellar clusters. The simulations track the formation of the stellar cusp, the capture of stars by repeated disk crossings, their subsequent orbital damping and migration, and their eventual consumption by the central IMBH. We find that dTDEs can sustain stellar mass supply rates of $\sim10^{-3}\,M_\odot \,\mathrm{yr}^{-1}$, which exceeds the Eddington-limited gas accretion rate for IMBHs with $M_\bullet<10^5\,M_\odot$. These results identify dTDEs as an efficient stellar feeding channel for IMBHs in gas-rich dense stellar systems. As one possible application, this mechanism may help transform $\sim10^3\,M_\odot$ IMBHs into more massive black-hole seeds, provided that compact stellar clusters and accretion disks persist for $>30$ Myr.
Read the full abstract
Dynamical Systems
On the Finiteness of Anosov flows on $3$-manifolds via Contact Geometry
In dimension 3, following Eliashberg-Thurston and Mitsumatsu, one can associate a transverse pair of oppositely oriented contact structures to any Anosov flow. We show that when the ambient manifold is hyperbolic, the isotopy classes of these contact structures completely determine the flow up to isotopy orbit equivalence. This then implies that on any closed hyperbolic 3-manifold, the number of Anosov flows modulo isotopy orbit equivalence is finite. This approach also yields an explicit bound on the number of orbit equivalence classes of Anosov flows in terms of the number of universally tight contact structures. In addition, we show finiteness of pseudo-Anosov flows for which the complement of the singular orbits is atoroidal and, in the non- hyperbolic case, we obtain a control on the dynamics of Anosov flows on the hyperbolic pieces of the JSJ-decomposition.
Read the full abstract
Robotics
Predictive Zonotope Reduction: Precise Runtime Monitoring under Uncertainty
Robots operating in physical environments make control decisions based on uncertain sensor measurements, which can lead to unsafe or suboptimal actions. Runtime monitors that check their behavior against safety specifications must represent this uncertainty soundly. Zonotopes are a widely used representation, but continuously incorporating new measurements grows their order unboundedly, so monitors must periodically apply an over-approximating reduction. The choice of the reduction method substantially affects the zonotope's precision, yet existing approaches typically utilize a fixed method throughout the run, even though the optimal choice depends on the current state. This paper presents a Predictive Zonotope Reduction (PZR) approach, which frames reducer selection as an optimal control problem and solves it using beam-search model predictive control. Policy distillation into a small neural policy further provides substantially higher execution speed than model predictive control while maintaining improved performance, enabling uncertainty-aware runtime monitoring on resource-constrained real-time systems. We implement our approach in the RLola runtime monitoring framework and evaluate it on a 5-degree-of-freedom robotic arm simulated in MuJoCo, with sensor uncertainty modeled according to ISO 5725. Experiments on a Raspberry Pi 5 show that dynamic reduction significantly lowers false-positive rates in monitoring compared with static reduction strategies.
Read the full abstract
Systems and Control
Synchronization of directed hypergraphs with heterogeneities via dynamic coupling
Many real-world networks involve interactions among three or more agents that cannot be reduced to pairwise coupling, making hypergraphs a natural modeling framework. In this work, we study complete synchronization in directed hypergraphs of nonlinear agents with parameter mismatches under dynamic diffusive coupling. Although proportional-integral coupling schemes are known to achieve consensus in heterogeneous linear networks, their ability to enforce complete synchronization in nonlinear systems is more limited, generally yielding only bounded synchronization. We show that complete synchronization can be attained only when the effect of parameter mismatches is structurally equivalent, in the transverse dynamics, to a constant disturbance. Under this condition, we derive invariance and local stability conditions for the synchronization manifold and develop a Master Stability Function framework for directed hypergraphs with dynamic coupling. The proposed approach accounts for distinct proportional and integral hypergraph layers and provides spectral criteria for predicting synchronization regions. Numerical simulations on directed hypergraphs of Lorenz oscillators validate the theoretical predictions and show how the integral action can compensate destabilizing effects induced by the proportional layer. We further demonstrate the applicability of the framework to a pinning-control problem in nonlinear opinion dynamics, where dynamic diffusive coupling achieves complete leader-follower consensus in the presence of heterogeneity.
Read the full abstract
Statistics Theory
Symmetries and Causality: Causal Effect Identification Beyond IID Data
We develop theory for the identification of complex causal queries from non-IID data. We propose a formal description of stochastic systems based on symmetries in data leaving causal mechanisms invariant. These symmetries become the source of statistical repetition for identification and mandate knowledge-transfer from observations to queries. The result is an abstract, simple and very general language for causal reasoning. We give descriptions of models and queries, and the formal infrastructure for their mathematically rigorous identification. The proposed structure enables a number of simplifying principles: A shared description of mechanisms and interventions, a duality of observed and queried structure, and the sub-division of the identification task into three steps - extraction, computation and query-expression. Our approach reproduces and matches standard theoretical results on IID data and transport of experimental and non-experimental data. By design, it additionally applies beyond IID data and captures complex causal queries not expressible via do- or soft-interventions.
Read the full abstract
Statistical Methodology
Parametric estimation of Hawkes processes based on ordinary least squares
We develop a parametric estimation framework for self-exciting Hawkes processes whose intensity functions admit a parametric form. The estimation procedure is based on ordinary least squares. To apply the least squares estimation, we restrict to a kernel class that can be expressed as a sum of the product of a parameter and a function. We first establish the central limit theorem for the proposed estimator. We then show the consistency of the asymptotic variance estimator. Finally, we introduce a Wald test statistic and derive its asymptotic distribution. We apply the proposed methodology to trade times from high-frequency financial asset data. Our empirical results provide evidence for three heterogeneous trader types. In particular, we identify two trader types as high-frequency traders and one trader type as fundamental trader.
Read the full abstract
Computer Vision
SignSeek: Learning Transferable Representations for Sign Dictionary Retrieval
Sign language dictionaries are essential resources for sign language learners, yet automatically retrieving a sign from a dictionary, given only a query video, remains a challenging problem due to the natural variability between signers. Existing sign representation learning methods are built for closed-set recognition, producing embeddings that do not generalise to the open-set, signer-independent setting that retrieval demands. SignSeek closes this gap by contrastively learning sign representations with saliency-guided articulator masking. A contrastive objective aligns same-gloss signs across signers, while our Articulator Saliency-Guided Masking (ASGM) pinpoints the single most critical articulator per sign. This drives two complementary objectives, a masked contrastive alignment (MAC) loss that sees the sign through a single articulator and a masked prediction (MAP) loss that reconstructs it in latent space from the surrounding spatio-temporal context. Pretrained on 266K samples ($\sim$5,700 glosses) across multiple sign languages, SignSeek sets a new state-of-the-art performance in cross-corpus retrieval on ASL-Citizen, WLASL, and NMFs-CSL without any downstream fine-tuning. Strikingly, it achieves zero-shot generalisation to an entirely unseen British Sign Language (BSL), surpassing methods explicitly trained on BSL, and transfers seamlessly to isolated sign recognition and subtitle alignment, outperforming prior skeleton-based methods.
Read the full abstract
Computer Vision
Observation-Conditioned Latent Energy Priors for Sparse Implicit Neural Shape Completion
Implicit neural representations (INRs) can model continuous 3D shapes with a shared coordinate decoder and per-instance latent codes. At test time, autodecoder-style models commonly freeze the decoder and optimize a new latent code from sparse off-grid SDF samples. When these samples underconstrain inference, the latent can drift toward regions that fit the observations but decode implausible unobserved geometry. We propose a post-hoc observation-conditioned latent energy prior for frozen INR decoders. The energy scores standardized latents conditioned on a permutation-invariant encoding of the sparse observation set and is used as a residual expert alongside an L2 latent prior selected on validation data. We evaluate on a controlled cell-nucleus SDF dataset and a public MedShapeNet-derived SDF completion dataset. The proposed L2 objective augmented with conditional energy improves consistently over a validation-selected L2 baseline in the sparsest cell-nucleus regimes and, on MedShapeNet, outperforms both L2 and a six-component GMM latent-density prior across all reported readouts. A shuffled-context ablation is consistently weaker than matched context, supporting an observation-specific contribution. These results suggest that lightweight conditional energies can make pretrained INR decoders more observation-aware without retraining.
Read the full abstract
Cryptography and Security
AlcaTRAz - Anchored Tree-Rule Defense Against Jailbreaks
Large language models (LLMs) are vulnerable to jailbreak attacks that bypass safety alignment through carefully crafted prompts. Many existing defenses require access to model weights or internals, making them difficult to apply to black-box deployments. We propose AlcaTRAz (Anchored Tree-Rule defense Against jailbreaks), a prompt-level defense based on rule trees that operates exclusively on the input text and requires no modification or retraining of the target model. The method automatically learns a transferable transformation rule that inserts controlled character-level perturbations at selected positions, thereby disrupting structural regularities exploited by jailbreak attacks while largely preserving the model's utility on benign queries. We evaluate the proposed method across 33 open-weight models, 22 jailbreak attack types, and a benchmark of short, single-turn benign questions, comparing against three representative prompt-level baselines (Llama Guard, RA-LLM, Goal Prioritization). Among the compared defenses, AlcaTRAz achieves the best composite security and functionality score in 73.4 % of model-attack combinations and shifts the aggregate score from a modal value of 10 (maximal-severity response to the malicious request) in the undefended setting to a modal value of 2 (near-refusal) after defense, while keeping the mean benign score within 0.27 points of the undefended baseline (8.35 vs. 8.62 on a 0-10 scale). AlcaTRAz substantially reduces but does not eliminate jailbreak success: a high-severity tail remains, and we do not consider adaptive attackers, so we position it as one layer within a defense-in-depth strategy rather than a standalone guarantee.
Read the full abstract
Signal Processing
AI-Driven Analysis of the Effects of Recreational Activities to Well-Being using Physiological Responses: A survey
Well-being is a broader concept ensuring psychological, social, physical, and cognitive health. Recreational activities are one of the major approaches to facilitate well-being. There are various recreational activities in each of the domains in which well-being can be measured. Although well-being is often assessed using subjective scales, physiological responses such as heart rate, heart rate variability, skin responses and brain activity data provide objective ways to estimate the level of well-being. Research has focused on using these measurable physiological signals to develop AI driven well-being analysis concepts. This study presents a review of previous studies that have considered analyzing well-being. This review summarizes studies on the basis of recreational activities, data collection scenarios, subjective and objective data, data analysis methods and evaluation criteria. Furthermore, this study also proposes a framework to enhance data collection, analysis and visualization setup for the assessment of well-being.
Read the full abstract
Cell Behavior
Modeling Tissue Detachment and Rupture Using an Extended Vertex Model with T2-inverse Transitions
The vertex model is widely used to describe the mechanics of epithelial tissues, but its conventional formulation assumes that all cells remain tightly packed and always share edges with their neighbors, making it difficult to represent local detachment or gap formation. Here, we propose a minimal extension of the vertex model that enables cell detachment by introducing a new topological transformation, T2-inverse, which acts as the inverse of the classical T2 transition. When the imbalance of forces acting on a vertex, quantified by a tension metric $T$, exceeds a threshold, the T2-inverse splits the vertex into multiple vertices and creates a closed polygon that is incorporated as a pseudo-cell. This operation allows the model to represent the emergence and propagation of local detachment events. Using this framework, we simulate the stretching of a cell sheet and show that force-induced local detachments can accumulate to produce macroscopic tissue rupture. These results demonstrate that the proposed model extends the capability of the vertex model to describe tissue-level breakdown processes, including detachment and tearing, and provides a foundation for studying a broader class of epithelial mechanical phenomena.