Hardware Architecture
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 8 November
Modern systems-on-chip place real-time clients, processor cores and bulk data engines on the same AXI4 interconnect, where they contend for shared slaves. AXI4 fixes the ordering rules and carries a 4-bit quality of service (QoS) field, but leaves the service policy to the implementer, and that policy determines how long each master waits and how much bandwidth it receives once a slave saturates. We propose a QoS-aware deficit round robin (DRR) architecture that charges each grant in beats, and benchmark it against two architectures built behind the same port list: round robin, and QoS priority with anti-starvation aging. Charging in beats recovers bandwidth fairness while leaving every burst whole, so the address phase is issued once and locality for memory access is preserved. All three are driven by the same deterministic traffic generator and taken from RTL to GDSII on the ASAP7 7-nm predictive PDK. Under a 1:16 burst-length mismatch, the round robin and QoS architectures both hold the beat ratio between the two competing masters at 1:16, while our design brings it to 1:1 at full load. Mean read latency for the priority master falls from 95 cycles under round robin to 67 with QoS and 37 with QoS-aware DRR. At 500 MHz this serves the priority master in 74 ns against 190 ns. The measurements give a per-policy price and a traffic-based guide for choosing among the three.
Computer Vision
Trajectory-Regularized Distribution Distillation for One-Step Generation
Distilling flow matching models for one-step generation generally follows two paradigms. Trajectory alignment supervises the student with the teacher's probability flow ODE, but its performance degrades under very small sampling budgets. Distribution matching directly optimizes the generated distribution, but estimating its reverse Kullback-Leibler gradient typically requires a separate network to track the evolving student score. We propose trajectory-regularized distribution distillation (TRD), which combines distribution-level and trajectory-level supervision through a momentum-mixture policy predicted in a single student forward pass. This policy serves simultaneously as a one-step generator, an estimator of the student's marginal velocity that removes the need for a second trainable network in distribution matching, and a closed-form time-dependent velocity field supervised along the teacher ODE trajectory. Experiments on SANA-1.6B and Stable Diffusion 3.5 show that TRD outperforms representative consistency and distribution matching baselines in generation quality and training efficiency for both one-step and few-step generation, with a trade-off in sample diversity.
Read the full abstract
Computer Vision
Selective Surgical Action-Center Localization:Retaining Localization Gains through Supervised Scoring
Surgical action-center localization requires both an accurate reference point and a decision about whether to report it. When frames with and without a reportable center are mixed, the benefit of improved localization depends on which correct candidates survive selection. We present a selective localization pipeline combining heatmap and coordinate supervision with a logistic-regression scorer. The scorer learns to identify predictions with a reportable center and a localization error within a specified tolerance. The internal evaluation uses 5,000 frames from 50 surgical sources, five source-grouped folds and two random seeds. Matched locator and scoring comparisons track correct candidates and their rejection. At an 80% acceptance quota per source and a tolerance of 0.10 times the image diagonal, our method retains 46.08 correct outputs per 100 inputs. The baseline locator with the same scoring approach retains 44.20. The gain is 1.88 (descriptive 95% source-paired bootstrap interval, 0.94 to 2.79). Under entropy-based selection, increased rejection of correct predictions offsets the higher supply of correct predictions on average. For the coordinate-supervised locator, supervised scoring reduces these rejections from 6.15 to 2.99 per 100 inputs. Evaluating retained correct outputs reveals whether a selection rule preserves or erodes an improvement in localization.
Read the full abstract
Computer Vision
Partition, Refine, and Detect: Preserving Novel Category Capacity in Open-Vocabulary Object Detection
Open-vocabulary object detection (OVD) expects the model trained on base classes to recognize both base and novel classes at inference. Typical methods rely on CLIP-style vision-language embeddings, yet the learned space is often biased toward base categories, with limited effective capacity preserved for novel concepts. Such a base-dominated representation can compress novel semantics, leading to semantic collapse and mis-calibrated confidence at inference. To address this issue, we present PR-OVD, a partition-and-refine framework that explicitly reserves capacity for novel categories and strengthens category separation, while being seamlessly integrated into different detector architectures. Specifically, PR-OVD first performs coarse partitioning to build global divisions for base, novel, and an explicit background partition in both visual and textual modalities, preventing object-irrelevant embeddings from leaking into category-specific representations. It then applies category-level refinement within each partition to sharpen decision boundaries and alleviate the lack of fine-grained region-level pretraining in CLIP. To further provide reliable visual anchors for novel categories, we design a cognitively inspired Structure Prompt (SP) that encodes both egocentric attributes and allocentric context, facilitating stable partition-and-refine learning. Extensive experiments on two OVD benchmarks show that PR-OVD delivers an average 6.5% proportional improvement on novel categories over the state-of-the-art methods. Notably, PR-OVD also benefits other open-vocabulary tasks, including segmentation and classification, further confirming its effectiveness and generality.
Read the full abstract
Computer Vision
Attribute-Evidence Learning with Multimodal Prompt for Generalized Category Discovery
Generalized category discovery (GCD) aims to discover novel categories from unlabeled data by leveraging limited labeled samples from old classes. Existing methods that rely solely on visual cues often neglect the multimodal nature of human perception, prompting recent approaches to incorporate textual information such as category tags and attributes. However, these approaches typically entangle global tags and local attributes within a shared global image representation, rendering attributes unreliable and potentially providing misleading cues that can drive the model toward incorrect predictions. To this end, we propose AptM-GCD, a novel multimodal framework that exploits apt textual guidance through attribute evidence learning and multimodal prompt reasoning. Specifically, we design an Attribute-Evidence Learning (AEL) mechanism that treats attributes as localized visual evidence rather than global category descriptors. By interacting attribute embeddings with patch-level visual tokens, AEL identifies reliable attribute-related regions and extracts discriminative local evidence, thereby reducing the impact of noisy or irrelevant attribute cues. Building upon the extracted evidence, we further develop a Multimodal Prompt Learning (MPL) mechanism to bridge local attribute semantics and global visual understanding. MPL converts fine-grained textual evidence into visual prompts and injects them into a multimodal prompt transformer, enabling attribute information to enhance category discrimination through contextual reasoning without enforcing direct global alignment between modalities. Extensive experiments on six datasets demonstrate that AptM-GCD consistently achieves SoTA performance across both fine-grained and generic benchmarks. Moreover, the proposed framework exhibits strong generalization ability, delivering consistent gains under unimodal and class-imbalanced GCD settings.
Read the full abstract
Machine Learning
StatPrompt-LLM: A Lightweight Statistical Refinement for Foundation-Style Time-Series Forecasting
Time-series forecasting has recently seen a paradigm shift with the introduction of foundation-style models that adapt large pretrained language architectures to sequential data. However, effectively exposing fundamental temporal structures, such as trend, scale, and temporal dependence, to these models remains an open challenge, particularly when the available observations are limited. In this paper, we conduct an exploratory empirical study across different generations of forecasting architectures and propose StatPrompt-LLM, a lightweight statistical refinement of Time-LLM. StatPrompt-LLM augments the existing Time-LLM prompting mechanism with dataset-level statistical information and introduces a zero-initialised autoregressive bypass as a complementary linear forecasting pathway. We evaluate our framework on electricity and meteorological time-series benchmarks, including ETTh1, ETTh2, and Weather, under full-prefix and reduced-prefix configurations. Under the 10% reduced-prefix configuration, StatPrompt-LLM achieved lower in-sample prediction errors than Time-LLM, with unweighted average relative reductions across datasets of 40.2% in MSE and 21.4% in MAE. Full-prefix results were more dataset-dependent. Ablation analyses revealed relatively modest and dataset-dependent changes when selected additional statistical descriptor groups were masked within the combined architecture. Computational profiling indicated additional model parameters and runtime overhead relative to Time-LLM.
Read the full abstract
Functional Analysis
Eccentricity in mutual strong Birkhoff-James orthographs of C*-algebras
We determine the eccentricity of every vertex in the orthograph of mutual strong Birkhoff-James orthogonality for arbitrary finite-dimensional C*-algebras and for the algebra K(H) of compact operators on an infinite-dimensional separable Hilbert space. This gives a more detailed description of the orthograph introduced by Arambašić et al. (Banach J. Math. Anal. 14 (2020), 1751-1772). As an application, we characterize scalar multiples of unitary elements among invertible elements of finite-dimensional C*-algebras in terms of eccentricity alone. We also show that M_3(C) is the only finite-dimensional C*-algebra whose orthograph has a non-trivial connected component of radius 3.
Read the full abstract
Materials Science
Hydrogen Thermodiffusion in Tungsten: Trapped Hydrogen Distorts Heat of Transport Estimation from Total Concentration Profiles
We investigate hydrogen diffusion in tungsten under thermal gradients in the presence of trapping sites using multiscale simulations. Using molecular dynamics simulations, we find that the heat of transport, which quantifies the coupling between temperature gradients and hydrogen transport, for hydrogen in tungsten is positive (thermophobic) at lower temperatures but changes sign near $1000$ K. We investigate the origin of the heat of transport and find that harmonic transition state theory with elastic thermal-expansion corrections is insufficient to explain the observed behaviour, consistent with either a breakdown of local thermodynamic equilibrium or non-negligible anharmonic contributions. We further extend previous studies of hydrogen thermodiffusion by including the effect of trapping sites in both simulations and analytical models. We show that when trapped hydrogen accounts for a significant fraction of the total hydrogen concentration, the heat of transport inferred from measurements of the total concentration is dominated by the temperature dependence of the trapped hydrogen population and no longer reflects the gradient in the mobile hydrogen concentration. Consequently, experimentally measured heats of transport cannot in general be used directly in continuum-scale models that explicitly account for trapping and detrapping. In such models, the heat of transport should be based on mobile hydrogen concentrations only to avoid incorporating trapping effects twice.
Read the full abstract
Cryptography and Security
Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy $k$-$\mathsf{LIN}$ Over Expanders
We give a public key encryption scheme that is provably secure against poly-size adversaries, assuming $n^{\log^\alpha n}$ hardness of the standard planted clique conjecture, for any $\alpha \in (0,1)$, and a relatively mild hardness conjecture about noisy $k\mbox{-}\mathsf{LIN}$ over expanders that is not known to imply public-key encryption on its own. Both of our conjectures correspond to natural average-case variants of NP-complete problems and have been studied for multiple decades, with unconditional lower bounds supporting them in a variety of restricted models of computation. Our encryption scheme answers an open question in a seminal work by Applebaum, Barak, and Wigderson [STOC'10].
Read the full abstract
Classical Analysis and ODEs
Random Configurations and Fourier Decoupling
We use tools from high dimensional probability to analyze random configurations of balls in the context of Fourier decoupling and we answer a question on the structure of superlevel sets in the setting of decoupling due to Guth.
Quantum Algebra
Frobenius and ozone automorphism groups of root of unity quantum cluster algebras
Many important families of algebras $R$ in the areas of quantum groups, quantum topology and noncommutative algebra are root of unity quantum algebras, equipped with Frobenius centers $Z_{\mathrm{Fr}}(R) \subseteq Z(R)$ and quantum Frobenius maps ${\mathrm{Fr}} : R_{\mathrm{class}} \stackrel{\cong}{\longrightarrow} Z_{\mathrm{Fr}}(R)$. We explicitly classify the Frobenius automorphism groups ${\mathrm{Aut}}(R/Z_{\mathrm{Fr}}(R))$ and the ozone groups ${\mathrm{Oz}}(R):= {\mathrm{Aut}}(R/Z(R))$, and prove that all endomorphisms of $R$ fixing its Frobenius center $Z_{\mathrm{Fr}}(R)$ are automorphisms for all algebras $R$ that come from partial root of unity quantum cluster and upper quantum cluster algebras (which have been proved to encompass a vast majority of known quantum algebras). We prove three main theorems that give the above classification results from three different standpoints. As applications, we classify the Frobenius and ozone automorphism groups of all quantum function algebras of simple algebraic groups $G$ not of type $F_4$ or $E_8$ and all quantum unipotent cells at roots of unity for arbitrary symmetrizable Kac–Moody algebras.
Read the full abstract
Robotics
Compute Regeneration through Re-Productization: Reorganizing Retired Edge AI Silicon into a Delivered Multilingual Service Robot
Useful edge hardware can lose product support while retaining substantial computation. We treat this as systems design: compute regeneration here means re-productization, retaining the compute module while redesigning the surrounding product organization. Our case is GEdgeBot, a multilingual service robot built around a retired 32 GB Jetson AGX Xavier. A source-grounded inventory shows the box alone supplies inference, while the combined system exposes five on-device AI services, a seven-language speech chain, three sensing domains, and one deterministic seven-byte control boundary. AI and orchestration stay on the Xavier; finite motor-pulse generation on an STM32F407. Audits cover the six-mode control state machine, readiness barriers and sound orientation. Historical single-prototype measurements report 1,782 MB GPU memory with YOLO, Whisper-small, and NLLB-200 resident, a direct-control p99 deviation rising from 0.24 to 49.93 ms under concurrent AI load, and six of six trigger-to-follow demonstrations at 4.35 s mean latency, with conversational voice unavailable. A November campaign restores an isolated inference stack, re-measures AI workloads, and repeats control-frame runs. Driving two execution organisations with the same 6,000 measured 50 ms frame intervals shows the finite-pulse boundary removes host jitter from the pulse train but not the command start phase; its stopping bound is host-enforced, while the MCU 16-bit pulse field is unclamped. A six-check static audit exposes a host–MCU queue mismatch, and a 14-scenario replay executes the audited main() dispatcher across six modes with zero physical device opens and 54 contract-checked frames. Results support an existence claim and a reproducible architectural hypothesis, not fleet-level reliability. The 208 direct-control ratio remains unreplicated; MCU waveform capture and on-site fault injection remain open.
Read the full abstract
Computer Vision
SurgTAP-3D: A Large-Scale Cross-Surgery Video Dataset with Contact-Aware 3D Motion Tracking
Understanding 3D scene dynamics in minimally invasive surgery (MIS) is a fundamental step toward physically intelligent and autonomous surgical systems. However, existing public datasets offer limited scalability and diversity in real-world clinical scenarios. Moreover, annotations typically focus on either tissue or instruments alone, overlooking tool-tissue interactions. This gap limits applications such as augmented reality guidance and autonomous surgery driven by vision-language-action (VLA) models or world models, which demand large-scale, high-quality 3D supervision. In this work, we construct SurgTAP-3D, a large-scale in-vivo pseudo-3D surgical motion tracking dataset and benchmark, comprising 520K frames, 4,549 action clips, and 1.4M 2D/3D point trajectories from diverse robotic and manual procedures under unified action categories. To make annotation scalable, we design a unified framework for surgical 3D point tracking that converts uncalibrated monocular surgical videos into structured 4D annotations through contact-region prompting, active-tool segmentation, dynamic bundle adjustment, and global 4D refinement. This pipeline adapts foundation priors to surgical videos and produces temporally consistent trajectories, pseudo-scale geometry, camera poses, and instrument masks. The dataset captures realistic challenges inherent to surgical environments, including occlusions, smoke, bleeding, and rapid instrument motion. We establish a comprehensive benchmark on SurgPose, SurgT, and STIR, covering both instrument and tissue tracking. We demonstrate instrument displacement estimation, deformable surface reconstruction, and foundation-model fine-tuning. Extensive experiments and analysis demonstrate the effectiveness of our dataset and annotation framework for 3D surgical point tracking, reconstruction, and surgical action understanding. Homepage: https://wrld.github.io/surgtap-3d/
Read the full abstract
Machine Learning
Direct GPU Energy Measurements of Batch-Level Sharing in Mixture-of-Experts and Recurrent Models
Energy claims for efficient neural networks are often inferred from operation counts. We report direct GPU energy measurements on two workloads that batch very differently, recurrent policies in GPU-vectorised multi-agent reinforcement learning (MARL) and mixture-of-experts (MoE) language models, and ask one question of both: can the rows of a batch be made to share computation, across the batch and over time, at a measured saving? On recurrent policies the answer so far is no. Shared activity patterns exist but rarely last one step, masking a frozen policy fails, and trained-in masks succeed only because a fixed mask is equivalent to a narrow GRU, at 11x the energy of a small dense policy in our implementation. Test-time steering adds nothing beyond re-picking on either workload. On MoE models the answer is yes, and granularity decides how much: on Qwen3-30B-A3B, batch-aware routing reads 25-31% fewer expert weights within KL 0.05, with benchmark changes within noise at 500 items, and uses 12-18% less energy per token on a fused forward. We also introduce persistence-aware OEA, a one-parameter rule that keeps the batch-aware cut with about 40% fewer new experts per step than native routing at batch 32-64, though its energy has not yet been measured. These are pilot measurements on one GPU type, and we state their limits.
Read the full abstract
Computation and Language
Language model capabilities fail in a shared, predictable order under compression and perturbation
Compression can preserve a language model's average accuracy while selectively degrading individual capabilities. Whether these losses follow method-specific patterns or a transferable order is unclear. We applied seven perturbation and compression methods to eight instruction-tuned models, scoring 16 tasks in four answer formats against preregistered predictions. Short-answer capabilities failed in nearly the same order under four random perturbations with different mechanisms (median correlation 0.90) and, within each model, under pruning and quantization (0.875). Intact answer margin, answer frequency and answer format predicted this order. Fragility profiles measured under random perturbation predicted which tasks and facts compression removes first and, after four-task calibration, held-out task accuracy (median absolute error 0.11-0.12, against 0.20-0.21 for uniform decline); profiles borrowed from other model families did almost as well. The order did not transfer across models under GPTQ quantization or hold for long-form tasks. Within short answers, what compression removes is predictable before deployment.
Read the full abstract
High Energy Physics (Phenomenology)
Nanohertz gravitational waves and asymmetric dark matter from a supercooled dark sector phase transition
We study the connection between asymmetric dark matter and nanohertz gravitational waves from a supercooled first-order phase transition in a classically conformal dark sector. The dark sector contains a real scalar, a complex scalar and a Dirac fermion, whose mass arises from radiative symmetry breaking. An additional Affleck–Dine condensate generates a fermion asymmetry and heats the dark bath before nucleation. The conserved dark charge fixes the asymmetry between fermions and antifermions, while entropy production during delayed visible-sector reheating dilutes the relic and determines the redshift of the gravitational-wave spectrum. We calculate the thermal nucleation rate in a three-dimensional effective theory with finite-density corrections, next-to-leading-order contributions and fluctuation determinants (NLOdet). We follow the coupled thermal evolution of the dark and visible sectors. For a benchmark chosen to match the observed dark-matter abundance, the transition completes at MeV-scale temperatures and produces a nanohertz signal under the adopted dynamical and thermal assumptions. We compare the predicted collision-dominated gravitational-wave spectra with free-spectrum posteriors from pulsar timing arrays. For a benchmark point and variations of the dark-sector parameters, the gravitational-wave spectra and dark matter relic abundances are compared, and compatibility with Big Bang nucleosynthesis is assessed.
Read the full abstract
Game Theory
Homological Barriers to Stable Learning of First-Order Nash Equilibria
We identify a homological barrier to stable learning of local Nash equilibria, also known as first-order Nash equilibria (FONE), in constrained non-concave differentiable games. We consider continuous deterministic learning dynamics that fix every FONE point and aim to attract all initial conditions to the full FONE set. We show that this convergence guarantee is impossible when the target set has nontrivial positive-degree cohomology, such as that arising from a loop, and the state space is compact and contractible. We exhibit this barrier in a simple non-concave quadratic zero-sum game on a box whose exact FONE set consists of a diagonal six-edge loop and an isolated point. Consequently, no such dynamics can make the full FONE set a stable global attractor. We further show that degree two is the minimal polynomial degree at which this barrier can arise and extend the construction to obtain nontrivial homology in arbitrarily high degrees. Finally, we establish that the barrier persists for sufficiently small approximate-FONE targets under small perturbations, yielding an open, positive-volume family of quadratic zero-sum games with the same homological barrier.
Read the full abstract
Computer Vision
LocateAnyMesh: Grounding 3D Mesh Queries in 2D Images with Vision-Language Models
Textured 3D meshes specify object geometry and appearance, making them a natural query for finding a particular asset in an image. We introduce LocateAnyMesh, a vision-language model that uses the mesh itself as part of its prompt. A frozen 3D encoder maps colored surface points to a compact token sequence, which a learned connector places alongside image and instruction tokens. We evaluate two grounding models with PPAT mesh tokens: LAM-Select selects image-region proposals, while LAM-Direct predicts coordinates directly. Neither requires rendered query views or view-template matching. New objects require a single encoder pass and no object-specific fine-tuning. LAM-Select improves localization on the reported real-image suites and the official BOP YCB-V evaluation. Secondary experiments compare mesh encoders, and a LAM-Direct study isolates surface color. A single-seed LAM-Select continuation supplies pointing and mesh-only description evidence without replacing the reported localization model. The results support mesh tokens as a query representation, with remaining limitations in presence decisions, identity binding, proposal coverage, and descriptive fidelity.
Read the full abstract
Machine Learning
Resolvent Ellipsoid for Minty Set Inclusions
We study Minty set inclusion on a compact convex set $\mathcal{X} \subseteq \mathbb{R}^d$ with a set-valued operator $A : \mathcal{X} \rightrightarrows \mathbb{R}^d$. Under the Minty promise, the goal is to compute $x \in \mathcal{X}$ and $u \in A(x)$ such that $\sup_{y \in \mathcal{X}} \langle u, x - y \rangle \le \varepsilon$. Our approach is geometric and we work in the fixed-scale constrained-resolvent oracle model, where a query at anchor $a$ is assumed to return a resolvent point $x^+$ together with the Yosida vector $g_{\eta}(a) = (a - x^+)/\eta$. We prove that each oracle response yields a sharp dichotomy: either the returned point provides an $\varepsilon$-SVI certificate, or the Yosida vector defines a strict separating normal for the Minty set. Thus, a single black-box resolvent query supplies either a certified candidate solution or a valid geometric cut. Combining this separation principle with the ellipsoid method, we obtain RESOLVENT-ELLIPSOID, an algorithm that computes an $\varepsilon$-SVI in $\mathcal{O}\!\left(\operatorname{poly}(d, \log(1/\varepsilon))\right)$ black-box oracle calls to the fixed-scale constrained resolvent. For monotone inclusions, our algorithm gives, to our knowledge, the first $\mathcal{O}\!\left(\mathrm{poly}(d, \log(1/\varepsilon))\right)$ black-box guarantee in the fixed-scale resolvent model.
Read the full abstract
Robotics
A Physical Testbed for Self-Driving Laboratories: Comparing Bayesian and Agentic Optimization in a Minimal Closed-Loop Color Formulation Task
Self-driving laboratories (SDLs) integrate laboratory robotics and automation with AI-driven decision-making to close the design-build-test-learn (DBTL) cycle. However, physical testbeds that combine off-the-shelf hardware and AI into a functioning closed-loop workflow remain in early stages of development, and their integration with commercial laboratory automation is comparatively less developed. In this work, we develop a physical testbed that assembles and integrates commercially available laboratory automation instruments and demonstrate continuous, closed-loop, autonomous operation over 24 cumulative hours of unattended experimentation. We validate this platform on a minimal closed-loop discovery task in which the system autonomously formulates aqueous dye mixtures to match a target absorbance spectrum. The system completed six independent campaigns, each consisting of 48 closed-loop iterations over approximately four hours. In every campaign, the system autonomously selected, dispensed, and measured each mixture, with an AI-driven decision-making algorithm determining subsequent formulations without human intervention. Using this testbed, we compared the performance of two AI-driven decision-making algorithms, traditional Bayesian optimization (BO) and an agentic approach, in selecting mixtures under a fixed total-volume constraint. The agentic optimizer matched target absorbance spectra using fewer iterations than BO, with reductions up to 52%, and converged on a solution for one target that BO failed to match within 48 iterations. These results demonstrate a reference physical platform for SDLs that can evaluate both established and emerging AI strategies, including large language model (LLM)-directed optimization, before their deployment in real-world applications where experiments may be costly and time-consuming to prepare.
Read the full abstract
Logic in Computer Science
Declarative DNS - Resolving Recursive Resolution
DNS zone configuration errors are a frequent source of outages and frustration, particularly in combination with DNSSEC. Research has attempted to address the problem of zone configuration errors using formal methods, but existing proposals (i) only verify the absence of specific, known configuration errors, and (ii) do not consider DNSSEC. We present a new formal model of the DNS that covers most of DNSSEC, making it one of the most complete DNS models to date. In addition, we present a new tool, DecDNS, that performs a resolvability change-impact analysis of zone configuration updates using our model. We show that such a change-impact analysis can identify configuration errors without explicitly searching for them. We evaluate DecDNS both formally and empirically. We prove that DecDNS is sound and complete and show that its results agree with widely used DNS software. Finally, we explain how our approach can be integrated into operational practice, helping guide zone management in the real world.
Read the full abstract
Robotics
Streaming Failure Forecasting: VLA Failure Monitors That Keep Learning After Deployment
Failure monitors for vision-language-action (VLA) policies are trained offline and then frozen. After deployment, lighting, objects and cameras drift, and the policy itself is updated or moved to new tasks. On recorded real-robot runs, after a switch of task or policy version, a frozen monitor fit on the old task ranks failures little better than chance. We present Streaming Failure Forecasting (SFF), a monitor that keeps learning from the one label every episode provides: whether it succeeded. SFF keeps the offline monitor's network fixed and refits only its last linear layer after each episode, at 2.18 ms per policy call on a Jetson CPU core. Its alarm threshold moves only after successes, which in simulation kept false alarms near target except when two drifts came at once. With every setting locked before testing, SFF ranks failures better than the same monitor kept frozen on 4 of 5 simulated test suites under unannounced drift, and above resetting on detected drift on every suite. Carried with its locked learner settings to 434 recorded runs of four VLAs on real SO-101 arms, replayed across unannounced switches of task or policy version, it ranks failures better than the frozen monitor for every VLA and, in an exploratory comparison, above a full reset at the true switch. A deployed failure monitor need not stay frozen: refitting its readout from outcomes is cheap and helps after the changes we tested.
Read the full abstract
High Energy Physics (Theory)
Decoupling Across Dimensions
We present a prescription for identifying decoupled sectors of 4d SCFTs obtained from compactifications of branes. Central to our analysis is the comparison of anomaly polynomials obtained via field-theoretic reduction versus anomaly inflow. Our flagship examples are the 4d $\mathcal{N}=1$ SCFTs obtained by compactifying the 6d $(1,0)$ theory from M5-branes probing a $\mathbb{C}^2/\mathbb{Z}_2$ orbifold singularity on a torus with flux. The anomaly polynomial of the interacting fixed point is known to decompose into the $T^2$ reduction of the 6d anomaly polynomial, plus a contribution from flip fields introduced to remove operators from the spectrum. Adopting the inflow perspective, the contribution from the flipped sector is obtained as the difference between inflow anomaly polynomials in the singular and resolved geometries, which we efficiently compute using equivariant localization. Helpfully, the 4d SCFTs admit two dual quiver gauge theory descriptions: $Y^{p,q}$ quiver gauge theories, and class $\mathcal{S}_2$ necklace quivers obtained from trinions. We study the interacting and decoupled sectors on both sides of the duality and construct an explicit map between their chiral rings, identifying a range of parameter space for which the quivers flow to apparently different interacting fixed points. Each chiral ring generator is furthermore matched to an M2-brane wrapping a 2-cycle in the resolved M-theory geometry.
Read the full abstract
General Relativity and Quantum Cosmology
Nonlinear Scalarization of Reissner-Nordström Black Holes in Scalar-Torsion-Maxwell Teleparallel Gravity
We investigate the nonlinear scalarization of Reissner-Nordström black holes in scalar-torsion-Maxwell teleparallel gravity, in which the scalar field is nonminimally coupled to the Weitzenböck invariant. We consider polynomial coupling functions that avoid tachyonic instabilities at the linear level, thereby exploring a scalarization mechanism driven by nonlinear effects. In the decoupling limit, we study the nonlinear evolution of finite-amplitude scalar perturbations and show that the inclusion of a sixth-order coupling term allows the scalar field to dynamically evolve toward nontrivial stationary configurations. This behavior can be understood in terms of the effective potential, which develops nontrivial local minima that provide a mechanism for nonlinear saturation. By numerically solving the fully coupled field equations, we construct asymptotically flat charged black hole solutions endowed with scalar hair. We classify these solutions according to the number of nodes in the scalar field profile, identifying multiple branches whose structure and multiplicity depend on the coupling parameters. We further show that the higher-order coupling progressively suppresses higher-node branches and characterize the scalar backreaction through deviations of the metric functions and the torsion scalar from the Reissner-Nordström background.
Read the full abstract
Geometric Topology
Rational knots, quivers, and tails of colored HOMFLY-PT polynomials
We use the knots-quivers correspondence to prove that the colored HOMFLY-PT polynomial of a rational knot has a tail and give an explicit formula for calculating the tail in terms of the quiver.
Read the full abstract
Artificial Intelligence
Self-Indexing Latent Memories for Access-Aware Continual Instruction Tuning of LLMs
Continual instruction tuning often preserves old skills with task-private modules. Inference still requires selecting the right module from the prompt alone. We introduce Task-Isolated Latent Adapter Continual Training (TILA-CT), a replay-free method that makes each task module self-indexing. Each task receives a latent memory and adapter bank in a frozen LLM. During adaptation, the memory gathers causal-prefix information and injects task-conditioned context. For access, its persistent state provides the routing prototype used by a shared prompt-only router. On the 8-task CT-Pipeline stream, TILA-CT achieves 65.19 acquisition and 63.98 final macro score, with 1.38 points of average forgetting. A middle-reversed order gives 65.38 acquisition and 64.17 final macro score. Across 6 backbones, final scores remain within 1.5 points of acquisition. Ablations support memory-derived routing keys and causal gathering. Final macro routing accuracy is 93.9%, and oracle routing recovers 1.21 final macro points. These results separate preserved task computation from learned access to it.
Read the full abstract
Mathematical Physics
Transformations of Hilbert Module Reference Frames
In this paper, we provide a functorial characterization of Hilbert module classical and quantum reference frames. Using the functorial characterization, we construct a category for equivariant couplings and Hilbert module reference frames. We prove the construction of the reference frame system from the equivariant coupling data yields a functor. We also deduce a “unitary" groupoid as frame transformations for Hilbert module reference frames of a fixed Hilbert module dynamical system. We provide some examples of these frame transformations in the case of the indistinguishable classical two state switch and in the case of Hilbert spaces.
Read the full abstract
Distributed Computing
A Decentralized Quantum-Resistant Notary Scheme for Blockchain Interoperability with a Novel Dynamic Trust Model
Blockchain interoperability is essential for enabling secure and reliable interactions across heterogeneous networks. However, existing notary schemes face two key issues: quantum vulnerability and rigid trust management. To address the first issue, this paper proposes a decentralized, quantum-resistant framework integrating post-quantum primitives ML-KEM and ML-DSA alongside AES-256, optimizing performance by using asymmetric cryptography for authentication and non-repudiation, and delegating bulk encryption to symmetric schemes. Under parallel loads of up to 270 transactions per second, this hybrid design reduces the end-to-end performance gap between the post-quantum and elliptic-curve approaches to under 6% on average, converging to within 0.2% at peak load. The second issue is handled by a dynamic trust model that uses Popoviciu's inequality to derive an adaptive discount factor $\alpha$ based on variance in a Verifier's behavior, removing the need for fixed thresholds or multi-stage configuration, while a tunable dynamicity factor $k$ enables control over system sensitivity. We evaluated the trust model over 200 epochs under adversarial conditions, where the proposed model detects and responds to misbehavior that the baseline model fails to penalize adequately. These results demonstrate that quantum-resistant blockchain interoperability is practically achievable, with the proposed trust mechanism offering greater adaptability and resilience than existing approaches.
Read the full abstract
Geophysics
A Sequential Monte Carlo Method for Data Assimilation in Subsurface Flow Systems with Hierarchical Uncertainty
Subsurface flow systems often involve hierarchical geological uncertainty, meaning both higher-level metaparameters and cell-by-cell properties are uncertain. This leads to challenges for data assimilation because both sets of parameters must be estimated. In this work we develop an adaptive-tempered sequential Monte Carlo (SMC) procedure for joint Bayesian estimation of these quantities. The method uses noncentered geological parameterizations, with geomodel realizations represented by metaparameters and Gaussian latent variables that are independent under the prior. Adaptive likelihood tempering, importance weighting, resampling, and blockwise Markov chain Monte Carlo (MCMC) mutation are applied at each iteration. Flow surrogates are used for all function evaluations. The hierarchical SMC procedure is further extended to treat successive data assimilation. In this case, existing posterior particles are updated in a manner that accounts for correlations in surrogate model errors across observation batches. We consider two distinct 3D systems with hierarchical uncertainty. The first is a faulted carbon storage system containing three stacked aquifers and two extensive faults. Principal component analysis is used to represent target-aquifer heterogeneity, while geological metaparameters characterize uncertain aquifer and fault properties. The second is a channelized oil-water system containing three facies with uncertain properties. A latent diffusion model represents variability in channel geometry and facies realizations. For the four synthetic true models considered, SMC posterior metaparameter distributions and flow predictions agree closely with reference MCMC results. SMC, however, requires fewer function evaluations and provides speedups of 2.5–7.0 for single-stage data assimilation. Even greater speedups are achieved with multiple GPUs.
Read the full abstract
Machine Learning
A Theoretical Reduction From Membership Inference to Reconstruction Attacks Against Learners
We study reconstruction attacks, which recover training data from a learned model. In our adversarial model, the adversary designs a hard instance, drawn from a parameterized family of data distributions, and is given the parameter used to generate it. Our main contribution is a general reduction showing that, in this model, membership inference (determining whether a given datapoint was used for training) implies reconstruction: for a training set of size $n$, a membership test with recall at least $q(n)$ and false-positive rate $O(\delta^2/n^2)$ yields a reconstruction algorithm that, with probability $1 - O(\delta)$, outputs only training points, and recovers $\Omega(n \cdot q(n))$ of them in expectation. This reduction applies to any learning algorithm. For stochastic convex optimization (SCO), we make the reduction computationally efficient over exponentially large domains via structured distributions whose support is partitioned into polynomially many categories of exponentially many elements each, so that reconstruction iterates over categories rather than the full support. Combining this with an existing membership inference result for SCO, we prove that any learning algorithm achieving low excess risk over all distributions admits a polynomial-time reconstruction attack recovering $\Omega(n)$ training points, even when the underlying distribution has exponentially large support.