Machine Learning
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 4 September
Due to resource constraints or external and internal uncertainties, clients in real-world federated learning systems are often intermittently available edge devices. In highly dynamic environments, the parameter server lacks prior real-time knowledge of clients' availability, making it challenging to adapt traditional federated learning algorithms to be resilient to uncertainties in client availability. If not carefully addressed, complex client availability can introduce significant bias, potentially harming the performance of the trained model. Most prior work either fails to account for non-stationary client availability dynamics or demands significant memory and computational overhead. This paper aims to develop efficient federated learning algorithms that are provably resilient to heterogeneous and non-stationary stochastic client availability. We propose FedSWE, which admits novel algorithmic structures to (i) compensate for missed computations, (ii) stabilize and diffuse the global updates over rounds, and (iii) evenly mix the local updates through implicit gossiping, despite being agnostic to non-stationary dynamics. Compared with the standard FedAvg, FedSWE introduces light additional memory and computation overhead. We show that FedSWE converges to a stationary point of non-convex objectives while achieving the desired linear speedup property in certain special cases. We corroborate our analysis with numerical experiments over diversified client unavailability dynamics on real-world data sets.
Systems and Control
On the differential of the exponential map
We study the time derivative of the matrix exponential $B(t)=\mathrm{exp}(A(t))$, where $A(t)$ is a time-parametrized curve in $\mathrm{Mat}(n)$. Starting from the Taylor series expansion, we derive a nested summation formula, which is then reformulated into a double summation. This expression is converted into an integral representation using Euler's beta function, and further expressed in terms of Lie brackets and the adjoint representation. Later, we extend this to a family of problems and verify a well-known result. Finally, we establish connections to the Gateaux and Fréchet derivatives, proving the latter's existence. These results offer a unified and explicit framework for understanding the derivative of the exponential map.
Read the full abstract
High Energy Physics (Phenomenology)
Flavor Tomography of Long-Lived Neutrino-Mass Mediators: Probing the Neutrino Mass Ordering at the HL-LHC
The neutrino mass ordering remains unresolved because long-baseline oscillation measurements are entangled with the unknown CP phase $\delta_{CP}$; a collider probe free of this degeneracy would provide a qualitatively different, complementary test. We show that when the long-lived charged particle producing a displaced-lepton signal at the High-Luminosity LHC is also the mediator responsible for Majorana neutrino masses—the shared-coupling condition—the Casas–Ibarra parametrization determines the lepton flavor ratio $N_e/N_\mu$ of time-delayed leptons in terms of Pontecorvo–Maki–Nakagawa–Sakata (PMNS) mixing parameters alone. Within the resulting shared-coupling class of models the ratio is fixed by oscillation data, independent of all beyond-Standard-Model mass and coupling parameters up to calculable corrections bounded by charged-lepton-flavor-violation data, yielding $N_e/N_\mu = 0.140$ for the Normal and $2.11$ for the Inverted Hierarchy—a separation of more than an order of magnitude between the two predictions. This prediction holds identically across the Scotogenic model, the Type-III seesaw, the inverse and linear seesaw, and lepton-portal dark matter, and is stable against oscillation-parameter uncertainties and detector-efficiency variations, which cancel in the ratio. A single efficiency-corrected decision criterion identifies the hierarchy, and explicit signal-yield estimates combined with an exact Poisson test show that $\mathcal{O}(25)$ displaced-lepton events suffice for a $3\sigma$ discrimination with the timing infrastructure already under construction at CMS and ATLAS—so that a positive long-lived-particle signal would simultaneously resolve the mass ordering, with no dependence on $\delta_{CP}$.
Read the full abstract
Algebraic Geometry
Relative Brauer groups and Kummer Sequence without characteristic constraint in $fppf$-topology
Let $f: X\rightarrow S$ be a faithful affine map. In this article we construct a group homomorphism $\theta_{{fppf}}: \text{Br}(f) \longrightarrow H^1_{{fppf}}\!\left(S, (f_*\mathcal{O}_X^\times / \mathcal{O}_S^\times)_{{fppf}}\right)$, extending the formerly defined morphism over an étale site $\theta_{et}$. In doing so, we eliminate the characteristic constraint previously found in the relative version of Kummer's exact sequence. Furthermore, given a finite subintegral extension of noetherian rings $A \hookrightarrow B$, we show that all the $fppf$ cohomology groups, $H^i_{fppf}(Spec(A),\mu^f_n); \;\forall i\geq 0$ vanish whenever $n$ does not divide the characteristic of $A$.
Read the full abstract
Robotics
Dressing in Motion: A Human Motion-Aware Diffusion Policy for Robot-Assisted Dressing
Robotic dressing assistance is a promising solution for supporting older adults with physical impairments in daily living. However, dressing under human motion remains challenging, as complex garment–human contact and occlusions make it difficult to generate actions aligned with arm movements. In this letter, we propose a visuomotor policy that learns dressing skills from static expert demonstrations and generalizes to dynamic user-motion scenarios. A diffusion policy tailored to garment–human interaction geometry learns from partially observed point clouds with varied arm postures. We then introduce an object-centric representation based on PDE diffusion to capture the axial distribution of the arm. By sampling motion-relevant regions and registering them across consecutive observations, the proposed method approximates arm motion and reactively adapts the executed trajectory. We evaluate our method in simulation and a real-world human study involving nine participants, three garment types, and six arm-motion patterns. Results show that our method outperforms baselines in dressing progress, freedom of movement, and user comfort. The project website is https://anonymous.4open.science/w/dressing-in-motion.
Read the full abstract
Nuclear Theory
Rotational Feshbach resonances in the deformed halo nucleus $^{31}$Ne
Background: The deformed halo nucleus $^{31}$Ne exhibits unique structural properties arising from the interplay between its halo neutron and the deformation of the $^{30}$Ne core. While previous studies have established the nature of its weakly-bound ground state through reaction cross sections and inclusive breakup measurements, the structure of its excited states in the low-energy continuum, which are expected to appear as resonances, remains largely unexplored. Purpose: We investigate the structure of these resonant states and clarify their rotational nature and formation mechanism. Method: The structure of $^{31}$Ne is described using the particle rotor model (PRM), which explicitly treats the coupling between core excitation and single-particle motion in both bound and continuum states. Results: The calculations predict the emergence of unbound rotational states in the low-energy continuum of $^{31}$Ne, which form a rotational sequence built on the weakly-bound Nilsson [321 3/2] configuration. As the total angular momentum increases along the rotational band, the intrinsic Nilsson structure is largely preserved, whereas the dominant core-spin component shifts to higher spins. These resonances are stabilized through the combined effects of coupling to higher-lying closed core-excited channels and reduced effective neutron relative energies, and can therefore be interpreted as rotational Feshbach resonances. Conclusion: The present study elucidates the formation mechanism of rotational Feshbach resonances in $^{31}$Ne. This mechanism is expected to be a general feature of weakly-bound deformed nuclei. Exclusive breakup measurements with coincident detection of $\gamma$ rays from the de-exciting core will provide crucial tests of the proposed formation mechanism of rotational Feshbach resonances.
Read the full abstract
Group Theory
Ordering, Artin–Tits group, Garside structure
A Dehornoy structure is a tool used to obtain a left order in the Garside group~$G$. Arcis and Paris introduced two conditions, known as Condition~$A$ and Condition~$B$. When they are both satisfied, they ensure that~$G$ possesses a Dehornoy structure. These two conditions describes how the product in the corresponding monoid behaves with an alternating decomposition. Here, we consider the case of a spherical type Artin group~$G$. We prove that Condition A almost always holds, but Condition~$B$ is rarely satisfied.
Read the full abstract
Signal Processing
What Selects, What Reconstructs: Repairing Exemplar-Based Complex-Spectrum Separation
Exemplar methods separate a mixture by picking one learned spectrum per source and deforming it until it explains the observation, making one deformation class both reconstructor and selector. We show that the second role is empty as soon as the class can interpolate: the rule then ranks candidates on its regulariser, a choice made before the data, and the estimates sum back to the mixture whichever candidate wins. The condition is a parameter count, so the diagnosis runs before any experiment. On free per-bin deformation of complex spectra it explains the observed pathologies at once: a criterion that ranks candidates by their loudness, and half an output that is a mask on the mixture rather than an exemplar. The same theorem prescribes the repair, a selection class poorer than the reconstruction class: one complex gain and one pure delay rank the candidates, and a local combination of the best-aligned atoms, fitted jointly in closed form, rebuilds them. On MUSDB18 against the exact ceiling of the masking class, the distance between the criterion and an oracle inside its own candidate pool falls under the rigid selector from 6.2-7.7 to 0.5-2.8 dB, though only 0.9-1.2 dB of that reaches the output, and the per-frame latency of the deployed rule by a factor of 47 to 806. One lock remains, quantified: atoms are scored against the mixture, so the score carries a term for the other source that absorbs the capacity the reconstruction class gains, leaving the output 10.0 dB under the ceiling. Ranking hypotheses by the residual of a fit free enough to interpolate ranks them on the regulariser alone.
Read the full abstract
Computation and Language
Vectorizing Classical Tamil: Representation Learning for Verse-Commentary Pairs
We construct a corpus of 1,262 verse–commentary (urai) pairs from five Classical Tamil source sections, ranging from technical grammatical prose to modern paraphrase, and ask what information representation learning can recover. We train recurrent and Transformer encoders, a Siamese-style pair-matching network, an mBART-style encoder–decoder, and a decoder-only language model. Each analysis is interpreted against an appropriate control on the same data. TF-IDF provides a strong no-training lexical retrieval baseline, alongside representation analyses and generation controls for the learned models. A fixed string containing the 25 most frequent commentary words scores higher on generation overlap than the decoder-only model. Canonical correlation reaches 1.000 on Gaussian noise at these sample sizes, token-F1 spans only about 0.02–0.20 on this corpus, and the encoder–decoder continues to lower training loss for sixteen epochs after validation loss has begun to rise. One narrow result remains: the decoder-only model prefers authentic word order in 107 of 112 minimal-pair comparisons (95.5%), but does not reproduce held-out commentary content. We release the extraction and evaluation protocol; redistribution of the source commentaries remains subject to permission.
Read the full abstract
Machine Learning
A Fairness Audit of the Duckworth-Lewis-Stern Method: Format-Specific and Gender-Differential Bias, with an Interpretable Calibration Layer for Cricket Target Revision
The Duckworth-Lewis-Stern (DLS) method has been the international standard for revising target scores in rain-interrupted limited-overs cricket since 1999. Despite over two decades of operational use, no large-scale empirical audit of its prediction bias has been published. We conduct such an audit on 8,150 international matches (3,095 ODIs, 5,055 T20Is) from Cricsheet, generating 233,550 synthetic interruption scenarios with temporal splits. We document two structured biases. First, DLS prediction error spans a 137-run range across (overs-remaining, wickets-lost) match-state buckets. Second, DLS exhibits a gender-differential bias on ODIs that has not previously been quantified: on the training split, mean over-prediction is +1.51 runs for men but +7.63 runs for women, a gap of +6.13 runs (F = 195.16, p < 10^-43). We benchmark DLS against five modern alternatives: Bi-LSTM, XGBoost, an enriched XGBoost variant, a deep context-aware model, and a stacking ensemble, and propose DLS-Cal, a lightweight interpretable calibration layer (27K parameters) outputting a state-conditioned correction added to DLS. DLS-Cal reduces absolute bias by 31% on ODI and 19% on T20I, and a gender-aware variant reduces women's ODI residual bias from +6.19 to +0.65 runs while leaving men's calibration unchanged. We release code, models, and data.
Read the full abstract
Computation and Language
Beneath the Surface of Chains-of-Thought: A Mechanistic Interpretation of Reasoning Operations in LLMs
Reasoning in large language models unfolds through diverse functional operations, such as problem formulation, goal decomposition, and deduction. Although these operations are explicitly distinguished in text, little is known about how they are geometrically organized in representation spaces. To this end, we investigate whether distinct reasoning operations exhibit corresponding geometric structure in hidden representations. We find that operations are separable in held-out representations, with separability peaking in middle layers, and verify that this structure is not explained by lexical or positional confounds. Across layers, token-wise operation-alignment becomes more distributed over spans, while identical surface tokens are represented differently depending on the operation of its surrounding chunk. Attention-masking interventions further show that operation-aligned representations at chunk onset depend on preceding reasoning context. Consequently, our work demonstrates that language models maintain representational correspondence between linguistic reasoning expressions and their internal geometric structures. Code and project materials are available at https://github.com/naver-ai/beneath-cot.
Read the full abstract
Functional Analysis
The Skew Commutators of Toeplitz and Hankel operators in vector-valued Hardy Space
In this article, we characterize when a Toeplitz operator and a Hankel operator on the vector-valued Hardy space are skew commutators of each other, and determine necessary and sufficient conditions under which their product is self-adjoint. These characterizations extend the results in \cite{LZD}. In addition, we completely classify the skew commutators of the unilateral shift $S$, its adjoint $S^*$ and $S\oplus S^*.$ We also characterize the class of bounded linear operators that have $S$, $S^*$ and $S\oplus S^*$ as skew-commutators.
Read the full abstract
Computer Vision
SeamFlow: Structure-Aware Flow Matching on Edge Probabilities for Artist-Like UV Unwrapping
3D surface cutting and UV unwrapping are fundamental problems in computer graphics. Traditional geometric optimization methods mainly focus on reducing parameterization distortion, but they often overlook visual semantic coherence in seam layouts. Recent autoregressive generative methods improve semantic coherence, yet limited perception of mesh topology often causes inaccurate local cuts. To address these limitations, we introduce SeamFlow, a novel generative framework for 3D surface cutting. We reformulate the discrete mesh-cutting problem as continuous flow matching in a high-dimensional edge-probability space. Through continuous relaxation, SeamFlow learns a deterministic mapping from a Gaussian prior to a target seam-probability distribution. An evolution network couples local topological tokens with global shape priors and guides smooth probability flow through Ordinary Differential Equation solving. Compared with existing autoregressive generative frameworks, SeamFlow improves topology awareness through edge tokenization while eliminating both 3D spatial projection errors and artificial sequential-order bias. Extensive experiments demonstrate that SeamFlow achieves exceptional semantic coherence and remarkably low parameterization distortion. The project page is https://meshy-dev.github.io/seamflow.
Read the full abstract
Computers and Society
Controversy and Group Certainty Jointly Shape Everyday Moral Judgments
Everyday moral life rarely resembles a trolley problem. It involves disputes about families, relationships, work, money, and care, situations in which people often encounter the judgments of others. We examined how judgments about nuanced interpersonal dilemmas respond to social information that conveys collective opinion without revealing the arguments behind it. Specifically, we studied two signals: controversy, the extent to which community judgments are divided between two opposing verdicts; and group certainty, the confidence expressed by each side. We derived these signals from 54,827 judgments on 135 dilemmas posted to Reddit's r/AmItheAsshole and presented them separately or together in a preregistered randomized experiment (N = 2,159). Relative to the control condition, all three treatments increased both weakening, a changed verdict or reduced confidence, and strengthening, increased confidence without a verdict change. Thus, aggregated social information can reshape moral judgments even without arguments. Controversy alone tripled the weakening rate, from 5.3% to 15.9%. Shown alone, certainty on either side was associated with movement toward that side. Shown alongside controversy, only like-minded certainty remained clearly associated with less weakening. This asymmetry of influence is double-edged: the confidence of like-minded others may help minorities resist majority pressure, but it may also insulate mistaken judgments from correction.
Read the full abstract
Artificial Intelligence
DCFA: Dual-view Causal-inspired Attribution for Failure Reasoning in LLM-based Multi-agent Systems
Large language model (LLM)-based multi-agent systems have experienced rapid growth in recent years. Despite their promise, such systems remain fragile, frequently exhibiting reasoning and coordination errors that can lead to system-level failures. Failure attribution in such systems relies on tracing natural language interactions among agents to identify the decisive error, which refers to the earliest action whose correction can reverse system failure. There are two key challenges: 1) Shallow attribution: Existing methods often capture only minor deviations, such as incomplete retrievals or formatting errors, which verification mechanisms can correct, while missing the decisive cause of system failure. 2) Contextual degradation: As the length of the system traces increases, the model's reasoning ability rapidly deteriorates. To address these challenges, we propose DCFA, a training-free framework for failure attribution. DCFA integrates a global module that constructs structured causal-inspired dependency graphs from system traces to identify the initial decisive error, and a local module that applies local counterfactual-inspired reasoning to refine causal-inspired attribution. Experiments on the Who&When benchmark across six LLMs show that DCFA improves step-level accuracy by up to 8.27% over state-of-the-art baselines.
Read the full abstract
Software Engineering
Same Request, Different Answer: Quantization Amplifies Cache-Induced Divergence in LLM Serving
Major open-source serving stacks reuse the key-value tensors of a shared prefix by default. We measure what this prefix reuse costs in reproducibility. Holding model, decoding, seed and request order fixed at batch size one, we ran an eighty-episode multi-turn agentic tool-use workload with prefix reuse on and off across two engines and four weight formats. Without prefix reuse, repeated runs reproduced every token and log-probability in all ten configurations. With it, cache-hit and recompute paths diverged on both engines. On llama.cpp with GGUF weights this path divergence rises with quantization: for Qwen2.5-7B over ten independent server histories, it reached 37.4 percent of episodes at 16-bit and 82.5 percent at four-bit. Near-tie decisions became only about 1.2 times as common, while the cache-path change in top-two margins grew 4.9-fold from 16-bit to three-bit. Serving four-bit weights through 16-bit kernels left divergence not detectably different from 16-bit, placing the amplification mainly in the quantized execution path. At Q4_K_M, run-to-run divergence came mainly from llama.cpp's server-level prompt cache: under the canonical episode order it moved divergence by 37.5 points, and at its default, divergence spanned 20.0 to 28.7 percent under five random orders. With cache state restored, each path reproduced exactly while the two still differed. In the tested stacks, cached serving is irreproducible because the cache state is absent from the request and not reset by default. A single-turn bridge shows path divergence reaching task outcomes with no detectable net change in accuracy. We release the harness, logs, and analysis pipeline.
Read the full abstract
Medical Physics
BEAM3R: Beam's-eye-view architecture with Mamba-3 for implicit dose reconstruction
To enable accurate and rapid photon control point and proton beamlet dose calculation in the DoseRAD2026 challenge, we present BEAM3R, a dose estimation framework operating in beam's-eye-view (BEV). Our core innovation combines a Mamba-3 state-space depth-sequence core with physics-based transport conditioning to model long-range depth transport without expensive 3D convolutions. BEAM3R shares a 2D CNN encoder-decoder architecture for photon and proton dose tasks, processing per-plane BEV slices. Proton beamlets are conditioned on water equivalent thickness and remaining range, encoding the parameters determining Bragg peak position. Photon models use a bidirectional Mamba-3 core to capture dose contributions from materials downstream of the calculation point, while the proton model uses a forward core with learned energy-prefix tokens and a Bragg-peak refinement module. To reduce interpolation artifacts and support high spatial resolution, we introduce axial grid alignment of BEV lattices with CT slices and an implicit super-resolution representation arranged as channels, evaluated by a differentiable Triton-accelerated resampler that reconstructs packed cubic B-spline coefficients directly in CT space. For MRI-based tasks, synthetic CTs (sCT) are generated using a conditional GAN with a SwinUNETR generator and a PatchGAN discriminator. On the preliminary DoseRAD2026 test set, CT-to-photon and CT-to-proton models achieved 1%/1 mm local gamma pass rates of 96.8% and 96.0%, with stratified plan-level MAEs of 0.0041 and 0.0079. Substituting sCT reduced gamma pass rates to 89.7% for photon and 75.4% proton plan level doses, with stratified plan-level MAEs of 0.0093 and 0.0336. Standardised runtimes were 23.4 s and 18.4 s for CT-to-photon and CT-to-proton prediction, increasing to 39.7 s and 42.8 s for the corresponding MRI-based pipelines.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Studies on the dark sector interaction from joint analysis of cosmological probes
We test whether constraints on the nonlinear interaction $\xi$IDE are stable under different treatments of the Type Ia supernovae absolute calibration. Fermi GRBs measurements and the Amati-relation parameters are fitted jointly with PantheonPlus SNe Ia, DESI DR2 BAO, and an updated cosmic-chronometer compilation. We compare the PantheonPlus-SH0ES route, which retains the SN absolute calibration, with the PantheonPlus-only route, in which the SN absolute magnitude is analytically marginalized. The GOLD GRB sample is adopted for the main analysis, while the FULL GRB sample is used to assess sample dependence. For the interaction parameter $\gamma\equiv\xi+3w$, where $\gamma=0$ denotes the non-interacting limit, the GOLD sample gives $\gamma=1.453^{+1.297}_{-1.597}$ for the PantheonPlus-SH0ES and $\gamma=-0.634^{+1.668}_{-2.486}$ for the PantheonPlus-only. Although the posterior medians correspond to opposite directions of energy transfer, neither route excludes $\gamma=0$ at 68% credibility, and the reconstructed interaction rate remains consistent with zero over the redshift range considered. Replacing the GOLD sample with the FULL sample produces negligible changes in the interaction constraints. Moreover, $w$CDM and CPL achieve likelihood improvements comparable to that of $\xi$IDE, while the information criteria do not consistently favor the interacting model. A redshift-bin diagnostic finds no significant redshift evolution of the Amati relation. We find no compelling evidence for a dark sector interaction that is robust to the choice of SN calibration or specifically favored over noninteracting dark energy extensions.
Read the full abstract
Rings and Algebras
Lie Ideals and Lie Derivations of the Algebraic Toeplitz Algebra
Let $K$ be a field and let $\T=L_K(E_T)$ be the algebraic Toeplitz algebra. We classify the Lie ideals of $\T^-$. If $w$ is the sink of the Toeplitz graph and $F=I(w)$, then $F\cong M_\infty(K)$, $\T/F\cong K[t,t^{-1}]$, and $[\T,\T]=F$. We prove that every noncentral Lie ideal contains $\mathfrak s=[F,F]$, the finitary trace-zero Lie algebra. Thus the classification reduces to the Heisenberg-type quotient $\T/\mathfrak s$. The Lie ideals are precisely $0$, $K1$, the spaces $\mathfrak s+U$, where $U\leq P_K\oplus Kw$ and $w\notin U$, and the inverse images $\rho^{-1}(W)$, where $W\leq K[t,t^{-1}]$. Here $P_K=K1$ in characteristic $0$, and $P_K=\operatorname{span}_K\{1,e^{m\ell},(e^*)^{m\ell}:m\geq1\}$ if $\operatorname{char}K=\ell>0$. We also describe the Lie derivations of $\T^-$ as sums of associative derivations of $\T$ and central Lie derivations factoring through $\T/F$.
Read the full abstract
Superconductivity
Orientation selection and superconducting properties of epitaxial Al on ferromagnetic semiconductor (In,Fe)As
Superconductor/ferromagnet heterostructures provide a versatile platform for exploring spin-dependent superconducting phenomena arising from interfacial proximity effects. In this article, we investigate the structural and superconducting properties of Al thin films grown in situ by molecular beam epitaxy on strained Fe-doped ferromagnetic semiconductor (FMS) (In,Fe)As layers. X-ray diffraction and transmission electron microscopy reveal the epitaxial growth of single-crystalline Al layers, with the growth orientation changing from (110) to (111) as the in-plane lattice constant of (In,Fe)As increases. The superconducting critical temperature of Al varies systematically with the film surface morphology and grain size. In addition, the critical magnetic field of Al exhibits an anomalous decrease below 0.5 K, possibly reflecting magnetic coupling to the underlying FMS (In,Fe)As layer. These findings provide a guideline for material design of epitaxial Al/(In,Fe)As heterostructures, which may serve as a promising platform for investigating proximity-induced superconducting and magnetic phenomena in semiconductor-based hybrid quantum devices.
Read the full abstract
Atomic Physics
Analytical model for polarization transfer during gas-phase collision events in spin-exchange optical pumping: Spin-$\frac{1}{2}$ $^{129}$Xe versus spin-$\frac{3}{2}$ $^{131}$Xe
Spin-exchange optical pumping (SEOP) is a method for producing spin-hyperpolarized noble gas nuclei, such as 129Xe and 131Xe, which are used in various magnetic resonance applications from fundamental physics to quantum sensing and medical imaging. In SEOP, optically polarized alkali-metal atoms transfer their spin polarization to the noble gas nuclei in gas-phase collision events via the hyperfine coupling (HFC) between the alkali valence electron and the noble gas nucleus. While the polarization transfer physics of spin $I = 1/2$ nuclei, such as 129Xe, is relatively well understood, that of spin $I > 1/2$ nuclei, such as 131Xe ($I = 3/2$), has been far less studied, and no rigorous theoretical model has been presented to date. To this end, we derive a simple analytical model for the upper limit, neglecting relaxation, of the SEOP polarization transfer, applicable to noble gases with arbitrary nuclear spin. Analytical evaluation of the Baker-Campbell-Hausdorff expansion for the time evolution of the spin density operator $\hat{\rho}(t)$ reveals that only even-order terms in the HFC contribute to the polarization transfer, with the leading-order quadratic term being the most significant. We obtain a result similar to that derived for the spin-exchange cross section by Herman [Phys. Rev. 137, A 1062 (1965)], but in a more general framework for the time evolution of $\hat{\rho}(t)$ that is also more familiar to magnetic resonance researchers. The model is applied to understand the difference in the polarization transfer efficiency between 129Xe and 131Xe, yielding results in agreement with previous experiments. We also validate the model by comparison to detailed numerical multiscale simulations of the SEOP process, where full quantum-chemically computed spin Hamiltonians sampled from molecular dynamics simulations of the gas-phase collision events are used to propagate the spin dynamics.
Read the full abstract
Nuclear Theory
FUSION: a skill-based research agent for publicly obtainable nuclear-physics codes
Running an unfamiliar nuclear-physics code is rarely difficult because of the physics alone. One must find and build the program, learn its input conventions, and decide whether a plausible output is actually correct. A general-purpose coding agent helps with the first two tasks but may make the last one harder: it can write an input file that runs with the wrong physical convention. FUSION addresses this problem with code-specific skills. A skill obtains the code from its public source, starts from a verified input, runs and parses the calculation, records known failure modes, and must reproduce a stated benchmark to a stated tolerance before reporting a result. The current release covers twenty codes, spanning optical models and reactions, nuclear structure, fission and statistical models, astrophysics and R-matrix analysis, and heavy-ion transport. It also includes an offline, searchable collection of 61 167 pages derived from the nucl-th literature. User notes and credentials remain outside the public repository. FUSION is available under the MIT license at https://github.com/jinleiphys/FUSION; documentation is at https://vibeinscience.com. Here I describe the design, the checks behind the current release, and one complete calculation from input to comparison with measured data.
Read the full abstract
Computer Vision
Where to Look Matters: Learning Influential Views for VLM-based 3D Visual Grounding
Recent zero-shot 3D visual grounding methods leverage vision-language models (VLMs) to localize objects in 3D scenes from natural language queries. However, these methods typically rely on heuristic rules to select which camera views are provided to the VLM, often prioritizing object visibility rather than grounding relevance. We present IVSGround, a framework that learns Influential View Selection for VLM-based 3D visual grounding. Instead of using fixed heuristics, a lightweight view selector is trained to identify views that provide discriminative evidence for grounding. To obtain supervision signals, we generate training signals using feedback from a reasoning VLM through a two-stage rejection sampling process. During inference, the learned selector predicts query-conditioned influential views for each candidate object, which are then evaluated by a frozen reasoning VLM through comparative grounding. Experiments on ScanRefer and NR3D show that IVSGround consistently improves grounding accuracy over existing zero-shot pipelines, demonstrating that selecting where to look is crucial for effective 3D visual grounding. Project page: https://ivsground.github.io/
Read the full abstract
Statistical Methodology
Copula-Based Bivariate Kumaraswamy-Teissier Distributions: Modeling Temperature-Rainfall Dependence and Compound Extremes
This study proposes two novel bivariate distributions for jointly modeling temperature and rainfall by integrating Kumaraswamy-Teissier marginals with Clayton and Gumbel copula structures. To capture a wide range of dependence patterns, including both positive and negative associations, rotated copula variants (90{\deg}, 180{\deg}, and 270{\deg}) are incorporated along with their corresponding tail dependence characteristics. Model parameters are estimated using maximum likelihood and the inference functions for margins (IFM) approach, and their finite-sample performance is assessed through a comprehensive Monte Carlo simulation study. The proposed models are applied to monthly gridded temperature and rainfall data from the Northwest Himalayas, a region characterized by complex hydro-climatic variability. Comparative analysis demonstrates that the proposed framework outperforms several existing bivariate models and effectively captures lower-tail, upper-tail, and asymmetric dependence structures across summer and winter seasons. Based on the selected best-fitting copula models, univariate, joint, and conditional return periods are derived to quantify the risk of compound extremes. The results highlight the capability of the proposed approach to provide a more realistic representation of hydro-climatic dependence and offer a robust framework for assessing the risk of extreme temperature and rainfall events in mountainous regions.
Read the full abstract
Algebraic Geometry
q-Opers and Quantum/Classical Duality Beyond Type A
Using the language of q-opers, we propose an algebro-geometric description of the duality between Bethe Ansatz equations for quantum XXZ spin chains and many-body trigonometric Ruijsenaars-Schneider/Macdonald systems for classical groups. Upon this duality, the energy level sets of the classical B/C/D-type Hamiltonians are found to be in bijection with the set of solutions of the XXZ Bethe Ansatz equations of type A, albeit with open boundary conditions. This dictionary generalizes previous results in which a GL(N) XXZ spin chain with twisted periodic boundary conditions was dual to an N-body Ruijsenaars-Schneider system. Our construction implements a $\mathbb{Z}/2\mathbb{Z}$ folding both at the level of the (GL(N),q)-oper data as well as at the level of the N-body trigonometric Ruijsenaars-Schneider model. The nonreduced BC-type systems appear in our analysis as well.
Read the full abstract
Artificial Intelligence
Aplaud: Adaptive Personalized Low-Rank Decomposition for User-Specific LLM
In this paper, we study the problem of personalized survey response prediction using fine-tuned large language models (LLMs). This task poses unique challenges: limited per-user training data, scalability of model storage, and the need to exploit shared structure across survey questions. To address these issues, we propose Aplaud (Adaptive Personalized Low-rank and User-specific Nested Decomposition), a lightweight and scalable framework for LLM personalization. Aplaud extends the LoRA paradigm by separating adaptation into a frozen, shared low-rank basis and a compact user-specific correction, augmented with a rank-one residual for finer personalization. To further reduce per-user parameter cost and mitigate overfitting, the correction matrix can be factorized into an even lower-rank form. Empirical results demonstrate that Aplaud achieves efficient, scalable personalization across users while outperforming state-of-the-art LoRA-based personalized LLM approaches in both generalization and inference efficiency.
Read the full abstract
Optimization and Control
Extended Graphon Mean-Field Games in Discrete Time
In this paper, we study games involving a continuum of heterogeneous players in the discrete-time setting with finite state spaces and continuous action spaces. We introduce a new model that incorporates joint state-action interactions within the graphon-weighted aggregate, described by a coupled forward-backward system. We establish the existence of graphon mean-field equilibria and characterize them through this forward-backward system. Additionally, we provide uniqueness results under monotonicity and contraction conditions. To illustrate the practical relevance of our framework, we solve an example of portfolio liquidation with price impact. We provide numerical results for three different graphons and two different initial distributions, illustrating the impact of the network's structure and the distribution heterogeneity on the distribution and the policy.
Read the full abstract
Statistical Methodology
A Quantile-Based Kumaraswamy-Teissier autoregressive moving average models
This paper introduces a quantile-based Kumaraswamy-Teissier autoregressive moving average (KTARMA) model for positive-valued time series. Leveraging the flexibility of the extended Kumaraswamy-Teissier distribution within an observation-driven framework, the random component of the distribution is conditioned on the historical process and time-varying covariates, and is parameterized explicitly via its $\rho$-th conditional quantile, where $\rho \in (0,1)$. To capture temporal dependence, the systematic component maps an ARMA-type structure to this conditional quantile via an appropriate link function. For inference, we implement a conditional maximum likelihood framework and derive explicit analytical expressions for the resulting score vector and conditional information matrix, followed by the development of model diagnostic and forecasting procedures. The finite-sample performance of the developed estimators is evaluated through a Monte Carlo simulation study across various parameter configurations and quantile levels. Finally, the practical utility of the study is demonstrated by modeling monthly rainfall data over the Northwest Himalayas (2001-2025), where 525 grids are grouped into four homogeneous zones using a Self-Organizing Map and relevant atmospheric variables and large-scale climate indices are incorporated as predictive regressors. Out-of-sample forecasting evaluations reveal that the KTARMA model delivers highly competitive predictive performance, achieving consistently lower mean squared errors across all identified zones compared to KARMA and $\beta$ARMA models.
Read the full abstract
Machine Learning
Training Large Language Models for Small-Molecule Design with Synthetic Task Scaling
Designing viable drug candidates requires searching a combinatorially large and rugged chemical space for molecules that satisfy multiple, often competing, objectives. Large language models (LLMs) provide a useful generative prior for this problem because of their representational capacity, reasoning ability, and flexibility when incorporating information from the external environment. While reinforcement learning from verifiable rewards (RLVR) can be used to improve the capabilities of LLMs, many chemically relevant scoring functions require hours or even days per evaluation, making them prohibitively expensive to use directly during online training. Here, we investigate whether LLMs can learn molecular design strategies from cheaper synthetic tasks that generalize to expensive molecular lead optimization settings. We find that curriculum-based training recipes that gradually incorporate more challenging synthetic design tasks enable strong performance that surpasses that of much larger frontier models on structure-based lead optimization. Our results suggest that scaling post-training using synthetic tasks is an effective strategy for adapting LLMs to high-cost experimental scenarios that are too expensive to directly train on.
Read the full abstract
Plasma Physics
Activated carbon-assisted anionic dye decomposition using a dual-liquid post-double dielectric barrier discharge plasma reactor
Non-thermal Plasma (NTP) technology, including the Dielectric Barrier Discharge (DBD) reactor, has emerged as an effective advanced oxidation process (AOP) for treating persistent organic pollutants in industrial wastewater. Based on this objective, a dual-liquid dielectric-barrier-discharge plasma reactor was built and used to degrade a ternary anionic dye mixture comprising Reactive Red 120, Congo Red, and Methyl Orange in its post-discharge configuration. The adjustable length of the outer liquid electrode (grounded) provides flexibility in controlling the discharge length and cooling, thereby achieving higher degradation efficiency and greater reactor stability. The conducting-liquid high-voltage electrode (a dielectric tube filled with a conductive solution) helps mitigate metal corrosion and oxidation caused by reactive species in the discharge zone. A detailed study of the degradation of ternary anionic dye mixtures (simulated dye wastewater samples) in the presence of activated carbon (AC) was performed to explore the potential applications of post-discharge treatment. The activated carbon (granules) enhances the degradation rate of ternary anionic dye mixtures in basic solutions rather than in acidic or neutral solutions. A comparative study of the degradation reaction kinetics of the ternary anionic dye mixtures in acidic and basic solutions was conducted after analyzing UV-Vis absorption spectra. The role of other parameters, such as solution pH, the mass and size of AC particles, dye concentrations, and AC reuse, was investigated in relation to degradation efficiency. The degradation mechanism was elucidated by the formation of strong oxidizer (hydroxyl radicals) on the surface of activated carbon during post-discharge treatment. However, in acidic or neutral anionic dye solutions, the degradation mechanism was dominated by ozone.