Systems and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
By focusing on algorithmic stability as a means of establishing out-of-sample bounds, we provide a system-theoretic interpretation of generalization in learning-enabled dynamical systems arising in data-driven optimization and feedback control approximation. Given two neighboring datasets, we specifically model sample replacement as an exogenous disturbance acting on a sensitivity system, while the incremental behavior of the data-dependent operator is encoded through an integral quadratic constraint. By relying on dissipativity arguments, we establish a matrix inequality-based certificate and a uniform stability bound that separates the one-sample sensitivity of the learned operator, and an algorithm-dependent dynamical gain. The latter can then be optimized, offering a tractable tool for certifying and comparing generalization capabilities of learning dynamics. We show that our results recover classical ones for gradient descent, apply naturally to momentum-based methods such as heavy-ball and Nesterov acceleration, and extend to data-driven control.
Medical Physics
Imaging cellular-level brain microstructure with diffusion MRI
Noninvasive live-cell imaging in deep human tissues is crucial for exploring the cellular biological and pathogenic processes, but remains a significant unmet challenge. Diffusion magnetic resonance imaging (dMRI) promises to narrow this gap by noninvasively providing cellular-level microstructural information. Within a single crowded voxel containing millions of living cells, the intricate cellular-level microstructures create numerous microcompartments, each characterized by a specific diffusivity. However, conventional dMRI methods relying on voxel-averaged macroscopic parameters, merely reflect aggregate microstructural properties and fail to quantify this distribution of microcompartment-specific diffusivity within a voxel, thereby obscuring microstructural details. Here, we propose an intravoxel diffusivity probability distribution (IDPD) model to resolve a wealth of essential microstructural information via quantifying microcompartment-specific diffusivity distribution, thereby enabling direct cellular-level characterization. This exceptional capability is realized through a multi-tiered analytical workflow spanning targeted single-voxel or region of interest (ROI) analysis to global visualization using dynamic videos and statistic parametric maps. Ultimately, the IDPD model enables noninvasive cellular-level microstructure imaging, offering a promising avenue to evaluate living cell functions in vivo.
Read the full abstract
Artificial Intelligence
EvoSkill Injection: Red-Teaming Autonomous Skill Generation and Evolution in Self-Evolving Agents
LLM-based agent systems increasingly adopt skill-based architectures to reduce repetitive reasoning costs and improve stable, efficient task execution. Recent studies propose self-evolving agents that autonomously generate, refine, and reuse skills from past experiences to enable continuous capability evolution. However, autonomous skill evolution introduces a new attack surface in which malicious capabilities are generated, stored, and reused as legitimate skills. In this paper, we define EvoSkill Injection as a threat model targeting the autonomous skill generation and evolution pipeline of self-evolving agents. We further propose SARGE (Red-teaming Autonomous Skill Generation and Evolution in self-evolving agents), a red-teaming framework for evaluating this threat model through iterative generation, escalation, and reinforcement interactions. To support our framework, we construct EvoSkillBench, a benchmark dataset of malicious interaction trajectories for inducing malicious skill formation in self-evolving agents, and introduce EvoSkillSafetyBench, a post-attack benchmark for evaluating whether injected malicious skills are subsequently retrieved and activated as harmful behaviors. Our evaluation shows that SARGE induces malicious skill formation and that injected skills are persistently stored and repeatedly activated, highlighting the risk of persistent capability corruption.
Read the full abstract
Computation and Language
Lies We Can See: Joint Verbal and Non-Verbal Deception by VLM Agents in Embodied Social Interactions
Strategic deception by LLM and VLM agents has emerged as a central AI alignment and safety concern. Social-deduction games (where each player holds a hidden role and communicates with others to deduce identities) serve as the canonical testbed, particularly in multi-agent settings. Existing testbeds, however, are text-only and run on a single fixed agent configuration, missing the non-verbal sensorimotor channels treated as core by deception taxonomies and leaving it ambiguous whether an observed behavior reflects the underlying model or the surrounding harness. We introduce MineAmongUs, a 3D multimodal Among Us sandbox where imposter agents must deceive crewmates through joint verbal and non-verbal action. We also propose ARIA, a configurable VLM-agent harness that exposes five cognitive-component ablation axes; and an atom- and arc-level annotation scheme grounded in deception taxonomies and operationalized at scale by an LLM-as-a-Judge reaching near-human atom-labeling agreement. Empirical results show that VLM agents pursue imposter wins through joint verbal and non-verbal deception, with non-verbal channels emerging as the more decisive winning contributors across both harness ablation and cross-VLM evaluation. Taken together, our work opens a new path for embodied VLM-agent alignment research.
Read the full abstract
Computation and Language
Ceiling-Clipped Acceptance Histograms Indicate Stranded Speed-up in Block-Diffusion Speculative Decoding
Speculative decoding speeds up generation with an efficient draft model (drafter) that proposes tokens for a target model to verify in one pass, preserving the target's output distribution. High-acceptance block-diffusion drafters such as DFlash and DFlare fill an entire block in one parallel pass. In many cycles, the target accepts the whole block, so the drafter exhausts its trained block horizon before verification fails. We call this unrealized acceptance stranded speed-up. A mean committed length, per prompt or per cycle, hides it, whereas the acceptance histogram exposes it as a spike in the ceiling bin, the fraction of cycles that accept the entire block. We recommend the histogram as a preflight check before spending training compute. Naively widening the block at inference does not recover the speed-up, because once the block outgrows its training size, the drafter's bidirectional attention shifts its distribution even at early positions and erodes front-of-block verification. Instead, we post-train the drafter on a longer block with a short curriculum that emphasizes the newly exposed positions, a method we call DBloom. Expanding the pretrained DFlash and DFlare drafters from block size 16 to 24 across Qwen3-8B and Qwen3-4B targets raises the per-prompt committed length on the high-ceiling benchmarks by a median of +0.8 tokens (up to +1.1). Once continuation fine-tuning precedes expansion, the increase reaches 1.37 tokens. The same expansion also lifts committed length on all seven benchmarks for Gemma-4-12B-IT, a different model family, by a median of +0.41 tokens (Arm A), and the full continuation-then-expand pipeline (Arm B) adds +0.29 to +0.98 tokens over the same B16 drafter. In a prompt-matched comparison against JetSpec, a contemporary tree-based drafter not used in our design, DBloom commits more tokens on every benchmark at tree budgets up to 64 nodes.
Read the full abstract
Computation and Language
Learning to Reason and Use Tools through Unsupervised Fine-Tuning in Task-Oriented Dialog Systems
Current dialogue systems struggle with dynamic information retrieval, often leading to hallucinations and lower response accuracy. We address this by adapting the ReAct framework for Task-Oriented Dialogue, enabling Large Language Models (LLMs) to access external knowledge and produce factual responses. Mainly, we propose an unsupervised fine-tuning pipeline that harvests reasoning trajectories via in-context learning inference. High-quality samples are filtered using an LLM-based judge to construct a robust training set. This is enhanced by a unsupervised self-improvement loop, where improved checkpoints generate increasingly better trajectories for subsequent fine-tuning iterations. Experiments on the SIMMC dataset demonstrate that ReAct-based systems outperform baselines due to superior reasoning and tool use. Notably, our fine-tuned 8B model surpasses a 70B in-context system. Finally, we present an error analysis, impact of scene complexity, and cross-domain generalization.
Read the full abstract
Computation and Language
Generative Models Enhanced by Sequence Labelling and Aspect-Code Switching Improve Cross-lingual Aspect-Based Sentiment Analysis
Cross-lingual aspect-based sentiment analysis (ABSA) transfers knowledge from a source language with annotated data to a target language, enabling fine-grained sentiment analysis without annotated target-language data. While monolingual ABSA has seen significant progress, cross-lingual ABSA remains underexplored, especially for complex tasks involving multiple sentiment elements like target-aspect-sentiment detection (TASD). In this paper, we propose a novel SeqLab framework that enhances cross-lingual ABSA using a sequence-to-sequence model with an auxiliary sequence-labelling task performed by the encoder, enhancing aspect term recognition and sentiment predictions. Additionally, we incorporate aspect-code switching (ACS), a translation-based technique that swaps aspect terms between source and translated sentences, generating additional training data to enhance the model's cross-lingual understanding. We evaluate our approach across eleven languages, three domains, and two backbone models, surpassing previous state-of-the-art results for the commonly studied E2E-ABSA task. Unlike most prior work that relies solely on English as the source language, we systematically assess different source-target language pairs and extend our evaluation to the more challenging, yet underexplored TASD task in cross-lingual settings. Finally, we provide a detailed error analysis highlighting key challenges and limitations.
Read the full abstract
Human-Computer Interaction
Towards Cognitive Process-Aware Proactive Writing Support
Large language models can support writing, but existing tools require users to explicitly articulate prompts-particularly burdensome in creative writing, where intentions are often ambiguous. Proactive support that infers users' needs from writing interactions could alleviate this burden, but raises two challenges: determining what support to provide and when to intervene. This work focuses on the former. We hypothesize that Flower and Hayes' cognitive process theory of writing-which characterizes writing through six cognitive processes-offers an interpretable bridge between observable writing behavior and appropriate support types. Through a formative study and literature review, we identify 14 writing support types associated with these cognitive processes, along with characteristic interaction behaviors linked to each process. We then instantiate this framework in AToM CoWriter, which infers support needs from writing interactions and document context. Two within-subjects studies (N = 21) provide initial evidence that this approach improves expressiveness and idea exploration, and that cognitive process inference increases engagement with proactive suggestions. These findings suggest that cognitive processes can provide a promising basis for support selection in proactive writing systems.
Read the full abstract
Computer Vision
ObjectSplat: Improving Mesh Fidelity and Interactivity for 3D Scenes via Object-Level Mesh Splatting
Splatting-based algorithms reconstruct photorealistic, real-time-renderable, and mesh-exportable 3D scenes from regular images, but they represent a scene as a single monolithic field. Therefore, the reconstruction has no object-level structure, leaving it infeasible for downstream editing or interaction. Moreover, regions that are never directly observed in the input scans are contaminated by the surrounding texture and left uncorrected, capping both mesh fidelity and novel-view synthesis. We propose a decompose-before-reconstruct approach: we segment the instances out of every frame, consider the remaining as background and inpaint it, reconstruct each instance and the background independently with mesh splatting, and compose them into a single scene. Our method significantly improves mesh fidelity (over a 5% gain in F-score) and novel-view synthesis, while supporting object-wise modifiability and interactivity. The code will be made publicly available.
Read the full abstract
Logic
The Iterative Conception Reconsidered
We investigate the iterative conception of set in its most general form, allowing urelements without assuming that they form a set. We formulate this conception in two ways, as stage theory and as level theory, and develop a general theory of levels with urelements. Unlike their pure-set counterparts, the resulting stage and level theories are not set-theoretically equivalent; moreover, second-order level theory with urelements is not weakly quasi-categorical. We then consider further principles governing stages and levels, motivated by directedness, unboundedness, and reflection. Some of these principles restore set-theoretic equivalence between the corresponding theories, while their level-theoretic versions yield forms of quasi-categoricity. These principles form strict implication hierarchies, thereby revealing distinct stronger conceptions of set beyond the basic iterative conception.
Read the full abstract
Statistical Mechanics
d'Q = TdS for Infinitesimal Irreversible Processes: On the Differential Form of the Clausius Inequality
Conventionally, the differential form of the Clausius inequality is adopted for infinitesimal irreversible processes. We show that the correct first-order form for infinitesimal quasi-static irreversible processes is the equality d'Q=TdS rather than d'Q < TdS. This provides a purely thermodynamic proof that internal entropy production is second-order or higher and confirms that entropy remains a well-defined state quantity even when quasi-static irreversible processes are included, without resorting to the Boltzmann relation.
Read the full abstract
Computer Vision
Whole-Slide Image Analysis under Realistic Few-Shot Annotation Protocols
Automating the analysis of whole-slide images has high clinical value, since characterizing cancers requires examining them in detail. Such analysis increasingly relies on vision-language models that provide patch-level zero-shot predictions. However, these predictions remain noisy and must be refined with a few annotations. A promising paradigm for this refinement is few-shot transduction. Rather than treating each patch independently, these methods leverage the relations between patches, together with a few annotations, to refine all predictions jointly. However, current transductive methods are evaluated under conditions that overlook key properties of whole-slide images: (i) datasets consist of independent patches extracted from multiple slides, ignoring the complex tissue organization; (ii) datasets are mostly balanced, whereas a single whole-slide image exhibits severe class imbalance, with several classes absent; and (iii) annotations are sampled at random, without reflecting how a pathologist annotates a limited number of regions. To align the transduction paradigm to realistic whole-slide settings, we introduce the following contributions. First, we propose SlideCRF, which adapts conditional random fields for whole-slide images by combining spatial and biological cues while accounting for classes that may be absent from a given slide. Second, we provide a set of realistic annotation protocols, based on spatially localized clicks and scribbles, modeling different pathologist interactions, such as the iterative correction of model errors. Across four datasets, we show that SlideCRF outperforms current transductive methods in macro F1, improving over the zero-shot predictions by +24.2% and +37.5% with one and 16 clicks per present class, respectively.
Read the full abstract
Artificial Intelligence
From Metaheuristics to Exact Methods: A CP-SAT Approach for Multi-Objective Healthcare Workforce Scheduling
Healthcare workforce scheduling is an NP-hard optimization problem requiring simultaneous satisfaction of labor regulations, coverage requirements, employee preferences and cost objectives. Existing approaches (genetic algorithms, integer programming, constraint programming) model 6-12 constraints at shift-level granularity and cannot guarantee regulatory compliance. They also lack support for multi-role, multi-skill heterogeneity, mandatory break scheduling with midpoint control, acuity-weighted workload equity, sub-shift granularity, inter-week stability, and cross-midnight shifts. This paper presents CP-SAT: a Constraint Programming formulation for multi-role, multi-skill healthcare scheduling. CP-SAT enforces 14 hard constraints guaranteeing zero regulatory violations, while optimizing 15 soft objectives via a unified weighted penalty function. Contributions include a shift-window decomposition enabling break scheduling with centrality control, acuity-weighted workload equity, multi-granularity resolution from 15 minutes to 1 day, inter-week stability, and grid-offset preprocessing mapping cross-midnight shifts into a single scheduling day without solver changes. CP-SAT is evaluated on 18 instances: five synthetic hospital units (10-33 nurses), 10 INRC-II benchmarks (5-80 nurses, up to 8-week horizons) and 3 NRP-23 compatible instances (10-25 nurses) with cross-midnight Night shifts. Results: zero hard-constraint violations across all 18 instances by construction; proven optimality on INRC-II n005w4 (objective 118, gap 0.0%, 104s); feasible schedules scaling to 179,800 variables and 351,425 constraints (80 nurses); service quality improved 50-67% over MOGA; and model size scaling near-linearly at approximately 4,400 variables per employee. The formulation enforces 29 total constraints (14 hard, 15 soft), nearly three times the industry average.
Read the full abstract
Signal Processing
Benchmarking External Generalization of SPD Matrix Learning for Resting-State fMRI Connectome Prediction
Resting-state functional magnetic resonance imaging (rs-fMRI) functional connectivity (FC) matrices are widely used for individual-level prediction, but strong performance within one cohort may not generalize to a new cohort. We ask whether within-dataset performance remains when the test data come from an entirely held-out rs-fMRI dataset. Each scan is represented as a regularized symmetric positive definite (SPD) correlation connectome, which allows methods to use the geometry of the SPD manifold. We introduce a reproducible age-prediction benchmark across six rs-fMRI datasets: COBRE, ADNIDOD, Cam-CAN, ABIDE, OASIS-3, and ADNI. The benchmark compares a vectorized correlation baseline, Tangent-Space Ridge, SPDNet, and split-wise Riemannian harmonization under within-dataset GroupKFold, pooled GroupKFold, and leave-one-dataset-out (LODO) evaluation. Within-dataset and pooled GroupKFold results are substantially more favorable than LODO results. When an entire dataset is held out, prediction error increases, differences among methods narrow, and performance is strongly affected by age-range mismatch and cohort heterogeneity. The benchmark provides common inputs, model settings, data splits, and analysis scripts so that future SPD matrix learning methods can be evaluated under the same external-validation protocol.
Read the full abstract
Machine Learning
Inherent Trade-offs when Enforcing Correct Data Symmetries in Multi-head Self-attention
We give a complete characterization of equivariant multi-head self-attention (MHSA): if an MHSA layer is equivariant to a symmetry group $G$, then $G$ can only act by permuting head-clusters, with QK and OV matrices satisfying an equivariance constraint tied to the group action. As a consequence, we prove that any fixed MHSA architecture that achieves exact equivariance by polynomially parameterizing unconstrained MHSA parameters inevitably leads to expressivity loss within the class of equivariant maps: the equivariance locus of unconstrained MHSA forms a union of extremely many Zariski-irreducible components in a reduced parameter space, and any single architecture covers at most one. For $G=D_4$ acting on $C$ copies of the regular representation as the token feature space, we show that there are $\Omega(C^{64})$ components for eight attention heads. We illustrate this with experiments on artificial tasks and show that the predicted head-cluster structures can arise naturally when the attention layer is pressured to become equivariant.
Read the full abstract
Lattice Field Theory
Bias-Corrected Machine-Learning Estimation of Chiral Condensate Cumulants: A Retrospective Lattice QCD Case Study
We present a retrospective case study of bias-corrected machine learning (ML) estimates of traces of the inverse Dirac operator, $\text{Tr}\,M^{-n}$ ($n=1,2,3,4$), using a fixed lattice QCD dataset and examining how the results depend on the relative proportions of the labeled and training sets. Two supervised learning approaches are examined: one using $\text{Tr}\,M^{-1}$ as the input feature, and the other employing gauge observables such as the plaquette and rectangle. Beyond the direct estimation of $\text{Tr}\,M^{-n}$, we further investigate two derived applications of the ML estimations: the evaluation of the cumulants of the chiral condensate within a single ensemble and that obtained through multi-ensemble reweighting across ensembles with different quark masses. Within this fixed dataset, the bias-corrected estimates show close agreement with the full-data reference under the adopted evaluation criteria, while the uncorrected estimates can exhibit amplified deviations after the nonlinear cumulant and reweighting steps. For the approach using $\text{Tr}\,M^{-1}$ as the input feature, nominal solve-count accounting suggests that the Dirac-inversion cost could be reduced to approximately $25.75\%$ of that of the conventional calculation in the present setup. This value is a cost projection rather than an end-to-end benchmark: it assumes comparable costs for successive inversions and excludes model-training and analysis overhead.
Read the full abstract
Algebraic Topology
On generalized complex projective product spaces
Free circle action on manifolds has been explored in several articles. Gonzalez and Velasco considered some free circle actions on the finite product of spheres. In this paper, we introduce generalized complex projective product spaces, extending their definition and the concept of Dold manifolds. This produces infinitely many different classes of new smooth manifolds. First, we study the integral cohomology rings and stable tangent bundles on certain generalized complex-projective product spaces. Then, we discuss the product inequality for strongly equivaraint TC. We exhibit the closeness of the lower and upper bounds for the LS-category and topological complexity of several classes of generalized complex projective product spaces. In many cases, we compute the exact value of the LS-category.
Read the full abstract
Earth and Planetary Astrophysics
Planar Three-Body Problem: theoretical predictions and simulation results
We investigate the statistical properties of the non-hierarchical planar three-body problem, relevant to astrophysical systems with nearly planar dynamics, including protoplanetary disks and AGN disks. Using the Flux-based statistical theory of the three-body problem, previously studied in three dimensions, we derive theoretical predictions for several statistical observables in the planar case. Focusing on ergodic disintegration outcomes, we compare these predictions directly with numerical simulations and contrast the results with the corresponding unconstrained three-dimensional case. Our analysis is based on one million simulations for each of eight distinct mass sets. We examine escape probabilities, properties of marginal escape events, eccentricity distributions, lifetime distributions, and relative prevalence of prograde and retrograde escapes. While several of the theoretical predictions are in good agreement with the simulations, others exhibit unexpected discrepancies. We discuss possible explanations for these deviations.
Read the full abstract
Artificial Intelligence
DERELAB: Probing Defeasible Reasoning and Confirmation Bias in LLMs with a Generative Benchmark
Defeasible reasoning is a type of reasoning where inferences are drawn from plausible current evidence, but can be retracted upon the introduction of newer evidence. Although recent studies have examined language-model behaviors in defeasible reasoning, the datasets have been static and lack wide coverage of non-monotonic reasoning categories. We introduce DeReLab, a generative framework that produces multi-turn belief-updating conversations from parameterized graph structures across default and inheritance reasoning, with formally verified ground truth at every turn, enabling controlled measurement of how models respond to confirming and disconfirming evidence. This controlled generation process creates a testbed for experimental designs that isolate specific reasoning demands. Applying this capability to the study of confirmation bias, we evaluate nine open and proprietary large language models and find that nearly all exhibit a systematic tendency to accept congruent evidence while resisting incongruent updates, with several models correctly identifying a weakening update yet failing to revise their conclusion. We believe our work and findings will facilitate future research on evaluating language models in defeasible reasoning.
Read the full abstract
Statistical Methodology
Power and sample size calculations for causal mediation analysis with a binary mediator in randomized trials
Mediation analyses are increasingly conducted in randomized trials, but a sample size adequate for the total treatment effect may leave the natural indirect effect (NIE) or natural direct effect (NDE) substantially underpowered. Randomization does not extend to the mediator, so precision depends on the conditional mediator distribution and the mediator-outcome association, neither of which enters a total-effect calculation. Planning outside linear structural equation models is largely based on simulation under a fully specified data-generating mechanism rarely available at the design stage. This paper develops analytic power and sample size formulas for the NIE and NDE with a binary mediator and a continuous or binary outcome. Under standard identification assumptions, we focus on the ratio-of-mediator-probability weighting (RMPW) estimator that does not require an outcome model for effect estimation. We decompose the oracle variances of the RMPW estimators into components capturing mediator-probability-ratio variability, outcome variation, and their association, with an additional shared-arm covariance term for the NIE. Under a probit latent-index mediator and a working outcome model, these components are determined by a small number of interpretable design inputs rather than by the full joint distribution of covariates, mediator, and outcome. Simulations show that the analytic sample sizes closely match simulation-based benchmarks, attain the target power, and maintain type I error near the nominal level. An ACTG175 illustration shows how pilot data can calibrate the inputs.
Read the full abstract
Optics
Spatially or temporally resolved phase-based optoretinography with actively-tracked point-scanning optical coherence tomography
Optoretinography is a promising approach to measure visual function but its clinical translation has remained confined to research settings due to demanding hardware requirements. Here, we demonstrate that high-quality phase-based optoretinography can be performed using conventional point-scanning spectral-domain optical coherence tomography. We show that the need for high imaging speed can be circumvented by accurate sampling of phase changes at consistent spatial location. Light-evoked outer-segment expansion could be temporally resolved in B-scan series acquired at a fixed position when filtering off-location B-scans, and spatially resolved in volumes acquired at rates as low as 1~Hz. These results indicate that the technical barrier for phase-based optoretinography is substantially lower than previously assumed and pave the way toward broad clinical translation.
Read the full abstract
Computer Vision
SePArate: Segmenting Patterns from Defects in Wafer Manufacturing Using Weak Supervision
In semiconductor manufacturing, defect analysis is essential, but manual inspection cannot scale. However, existing automated inspection methods remain insufficient for root-cause analysis and process optimization. To this end, we present SePArate, a weakly supervised wafer defect segmentation method. SePArate enables pixel-level separation of patterns by leveraging only image-level annotations. It consists of a three-phase training: encoder pretraining, knowledge transfer to learn spatial cues, and training on synthetic mixed-defect data for accurate segmentation. Experiments demonstrate that SePArate outperforms the baselines.
Read the full abstract
Differential Geometry
Gradient estimates and volume doubling for locally finite weighted graphs with $CD\psi(n,-K)$ condition
We study gradient estimates and volume growth on locally finite weighted graphs satisfying the $CD\psi(n,-K)$ condition with $K\geq0$. We establish a variational inequality for the heat semigroup and derive from it a family of Li-Yau type gradient estimates. Furthermore, under suitable assumptions on $\psi$, we establish a curvature dependent heat retention estimate for metric balls. Combined with a heat kernel Harnack inequality obtained from the established gradient estimate, this yields a curvature dependent exponential volume doubling estimate \begin{equation*} V(x,2r)\leq C e^{c\sqrt{K}r}V(x,r). \end{equation*} When $K=0$, the result reduces to a uniform volume doubling and further implies that the bottom of the spectrum of $-\Delta$ vanishes on infinite graphs.
Read the full abstract
Rings and Algebras
Lie nilpotency index of skew symmetric elements in group algebras
Let $FG$ be the group algebra of a finite $p$-group $G$ over a finite field $F$ of characteristic $p$, where $p$ is an odd prime. Let $*$ be the classical involution of $FG$ and let $FG^-$ be the Lie subalgebra of the skew symmetric elements with respect to $*$. In this paper, we prove that the Lie nilpotency index of $FG$ is determined by its Lie subalgebra $FG^-$, in the case when $G$ is a $p$-group with a commutator subgroup of order $p$. The structure of the terms of the lower Lie central series of $FG^-$ has also been described.
Read the full abstract
Combinatorics
Edge codes constructed from unicyclic graphs
Jaramillo-Velez recently introduced edge codes, a new class of toric evaluation codes constructed from the edges of a (hyper)graph $\mathcal{H}$. In the case that $\mathcal{H}$ is a tree, Jaramillo-Velez computed both the minimum distance and the weight distribution of the associated code. In this paper, we study edge codes associated to unicyclic graphs. Our most striking result is that computing the parameters of these codes is subtle in the case that the induced cycle has an even length because these values will depend on certain conditions regarding the length of the cycle and the size of the base field.
Read the full abstract
Machine Learning
Locally-Guided Actor-Critic: Training a Goal-conditioned Actor with a Subgoal-aware Critic
Goal-conditioned reinforcement learning struggles with long horizons when rewards are sparse. While a planner can provide subgoals to guide a low-level policy, its use at test time may introduce practical subgoal management difficulties. An alternative paradigm utilizes a high-level planner to assist learning, while the policy remains conditioned only on the final goal, enabling planner-free deployment. Among these methods, Reinforcement Learning with Imagined Subgoals (RIS) introduces a regularization term that encourages the policy to take the same actions for the final goal as it does for an intermediate goal. This regularization, however, may lead to goal-chaining issues when intermediate goals are low-dimensional. Potential-based reward shaping (PBRS) translates plans into an additional reward while ensuring that the optimal policy remains unchanged. Yet, it can generate deceptive rewards in terminal states. We study these failure cases and first propose an alternative reward shaping method (RS) that removes these deceptive rewards at the expense of theoretical guarantees of PBRS. Similar to this RS variant, we then propose another method named Locally-Guided Actor Critic (LG-AC) that rewards the agent for reaching intermediate goals. Unlike RS, where intermediate rewards are implicit in the shaping signal, we explicitly condition a value estimator on the full sequence of intermediate goals but represent the value function as a sum of subgoal-conditioned value functions, enabling dense hindsight relabeling. We evaluate all these methods in tasks with challenging goal-chaining requirements and empirically highlight specific cases in which either action regularization or reward shaping yield low performance, while LG-AC achieves the best overall performance across tasks.
Read the full abstract
Artificial Intelligence
Dense Clinical Contrasts Enhance Medical Knowledge Updating in Large Language Models
Medical knowledge changes continually, making large language models vulnerable to relying on outdated yet clinically plausible information. We study whether the format of supervision affects medical knowledge updating under a matched training-budget setting. We introduce SEER-Bench, a temporally anchored oncology-staging benchmark curated from the latest versioned SEER Research Data release, and render identical medical update events from NCCN oncology guidelines into four supervision formats: EMQ, MSQ, FITB, and SAQ. Across SEER-Bench and HealthBench Professional, EMQ gives the most stable external transfer and retention among same-budget SFT variants. With EMQ supervision, the updated 4B model produces competitive results on temporally anchored oncology staging, reaching 64.8% answer accuracy and 59.6% rationale accuracy on SEER-Bench. Diagnostic analyses suggest that EMQ exposes denser clinical contrast signals while preserving discriminative representations with smaller movement from the base model. These results show that medical knowledge updating depends not only on the update algorithm, but also on how knowledge is structured as supervision.
Read the full abstract
Computer Vision
ImageCAS-X: a dataset and benchmark for coronary artery segmentation and centerline extraction in coronary CT angiography
Accurate segmentation of the coronary vessel lumen is a prerequisite for quantitative assessment of atherosclerotic plaque and perivascular adipose tissue in coronary computed tomography angiography (CCTA). Cardiologists rely on semi-automated methods for this task because manual vessel tracing and segmentation are labour-intensive. Although many automated methods have been proposed, their validation remains limited by the lack of large, high-quality publicly available datasets. We provide a new dataset of voxel-wise annotations of the vessel lumen and coronary segments, alongside centerlines, and mesh surfaces for 800 scans from the publicly available ImageCAS dataset. Using this dataset, we benchmark established lumen segmentation methods against inter-observer variability, stratifying performance by disease, image quality, coronary dominance, coronary segment, vessel diameter, and lumen attenuation. These labels allow segmentation accuracy to be described in anatomical and clinical context rather than reported as a single aggregate score. The dataset supports the development and validation of methods for lumen segmentation, plaque and perivascular quantification, and haemodynamic modelling.
Read the full abstract
Cryptography and Security
Why Are LLM Backdoor Defenses Fragmented? A Feature-Level Explanation with Sparse Autoencoders
Backdoor attacks pose a serious threat to large language models (LLMs), but existing defenses remain fragmented, failing to pro?vide unified defense against both dirty-label and clean-label attacks. To investigate why such fragmentation arises, we present the first systematic feature-level mechanistic analysis of LLM backdoors using sparse autoencoders (SAEs). Starting from a 2 x 2 comparison of clean and poisoned models on clean and triggered inputs, we trace backdoor-induced logit shifts to high-contributing SAE features and categorize them into four roles: interac?tion, suppressed, mixed, and weight-modified features. This taxonomy reveals system?atic encoding differences: dirty-label back?doors are dominated by isolated interaction features, whereas clean-label backdoors rely more on heterogeneous mixtures of mixed and weight-modified features. These differ?ences explain why existing defenses remain fragmented across attack paradigms. We val?idate this hypothesis through inference-time feature clamping, which reduces ASR to at most 10.8% in most dirty-label settings and at most 15.4% in the majority of clean-label settings, while preserving benign-task perfor?mance. These results show that SAE-based analysis can explain defense fragmentation and guide interpretable backdoor mitigation.
Read the full abstract
Materials Science
Extending the Pnictide Chemical Space for Photovoltaics
Developing novel and efficient materials that are beyond silicon for photovoltaic (PV) applications is required to meet the upcoming energy needs of our societies. To identify novel candidate materials that can act as PVs, we use first principles calculations to perform a systematic screening of the pnictide chemical space (i.e., nitrides and phosphides). Specifically, we explore three different ternary and quaternary pnictide classes, namely, ABCX$_2$, BB'B"X$_2$, and A$_4$BX$_2$ (A = Li, Na, or K; B, B', B" = Ca, Sr, Mg, or Zn; C = Al, Ga, or In; X = N or P), leading to a set of 104 possible pnictide compositions. Based on our evaluations of ground state structures, 0 K thermodynamic stabilities, electronic structures, carrier effective masses, dynamic stabilities, and intrinsic point defect formation energies, we arrive at three promising candidates, namely, NaCaInN$_2$, NaSrInN$_2$, and K$_4$ZnP$_2$. Notably, all the identified candidates are thermodynamically (meta)stable, exhibit direct (or nearest direct) band gaps that are optimal for PV applications, and are resistant to forming several types of point defects. We hope that our first principles driven workflow and the identified candidates will advance the development of novel PV materials and reinvigorate interest in the exploration of pnictides.