Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 9 September
We prove a canonical (or fixed-population) local equilibrium theorem for the symmetric simple exclusion process on the discrete torus $\mathbb T_N^D$, $D\ge2$, at particle densities bounded away from $0$ and $1$, uniformly over all deterministic initial configurations with the prescribed particle number. At times \[ t_N(s)=\frac{\log(N^D)+s}{2\gamma_N}, \qquad \gamma_N=2-2\cos\left(\frac{2\pi}{N}\right), \] the Radon–Nikodym density of the process relative to equilibrium converges in $L^2$ to a canonical exponential tilt generated by the unique small mean-zero calibration field whose one-site marginals match the evolving one-particle heat profile. Consequently, whenever the profile coordinate converges, the corresponding total variation profile is a Gaussian shift. More precisely, for a deterministic initial sequence $(S_N)$, if the covariance-normalized squared amplitude $\mathfrak q_N^{S_N}(s)$ converges to a scalar $\mathfrak q$ at a fixed $s$, then the distance to stationarity converges to $ 2\Phi\!\left({\sqrt{\mathfrak q}}/2\right)-1 $, where $\Phi$ is the standard normal distribution function. The profile coordinate is asymptotically determined by the one-particle eigenspace corresponding to the smallest nonzero eigenvalue. The proof combines a calibrated canonical comparison, a fixed-degree comparison between independent and exclusion dynamics, and all-degree control obtained from pair energy estimates and preservation of the Strong–Rayleigh property.
Computer Vision
SynThermFace: Amplifying Limited Paired Data for Visible-Thermal Face Recognition via Synthetic Data Generation
Face recognition (FR) is a widely used modality for biometric authentication, but conventional models rely on visible-spectrum imagery and degrade when high-quality RGB images cannot be captured. Cross-spectral face recognition addresses this limitation by matching visible images with other modalities such as thermal imagery, enabling more reliable performance in low-light, nighttime, and unconstrained conditions. However, progress is limited by the scarcity of paired visible-thermal data, which is difficult and costly to collect at scale. We propose SynThermFace, a framework that amplifies limited real visible-thermal supervision into larger paired adaptation datasets for cross-spectral face recognition. A diffusion model is first adapted using a limited set of paired visible–thermal images and then used to generate large-scale paired visible–synthetic thermal data from existing real or synthetic visible face datasets. The generated pairs are used to adapt a pretrained visible-spectrum face recognition model into a CFR model. Unlike synthesis-based approaches that require image translation at test time, the proposed method shifts generation to the training stage and performs inference with a single forward pass through the adapted recognition model. Under the same MCXFace real-pair protocol, PACT improves over the evaluated CFR adaptation baselines, isolating the effect of the proposed adaptation objective. Training PACT on larger generated paired datasets provides additional improvements over both the unadapted model and the real-pair PACT configuration. Cross-database evaluation on the Tufts dataset provides evidence that the learned representation transfers to an unseen database. The source code and trained models will be made publicly available.
Read the full abstract
Number Theory
Faltings' Isogeny Theorem via Equidistribution
We give a new proof of Faltings' isogeny theorem. More precisely, we show that Yuan's non-archimedean equidistribution theorem can be used to "pump" homomorphisms and semisimplicity from finite fields to number fields, thereby reducing Faltings' theorem directly to Tate's theorem. In the appendix joint with Yap, we explain how an ultraproduct variant of our method gives another proof of the Shafarevich conjecture, and hence a new route to the Mordell conjecture via Parshin's trick.
Read the full abstract
Materials Science
Structural and Electronic Properties of Bulk $\beta$(2H)-GaSe from First-Principles DFT Calculations with van der Waals Corrections
Gallium selenide (GaSe) is a layered III-VI semiconductor whose bulk crystal serves as the essential energetic reference for modeling the isolated monolayer. We present a systematic density-functional-theory (DFT) study of the centrosymmetric $\beta$(2H)-GaSe polymorph, employing the GGA-PBE functional supplemented with a semiempirical Grimme DFT-D2 dispersion correction to accurately capture the weak van der Waals interlayer coupling. The optimized in-plane lattice parameter agrees well with experimental values (within about 1.3%), while the out-of-plane parameter c is overestimated by the DFT-D2 correction relative to experiment, a known limitation of this dispersion scheme when the pairwise $C_6$ coefficients are not specifically fitted for the compound class under study. Electronic structure calculations confirm a non-magnetic, direct-gap profile (1.12 eV). Although this magnitude reflects the well-known underestimation of semilocal functionals, the qualitative band topology accurately captures the intrinsic two-dimensional carrier confinement within the bulk material. Consequently, this optimized three-dimensional framework provides a consistent energetic baseline for quantifying exfoliation processes, offering a reliable starting point for future theoretical explorations of the two-dimensional limit, such as surface functionalization for potential spintronic applications.
Read the full abstract
Signal Processing
Shaping Delay-Doppler Ambiguity in Practical OFDM-ISAC
Orthogonal frequency-division multiplexing (OFDM) is a key waveform for integrated sensing and communication (ISAC). Existing OFDM ambiguity analyses, however, typically assume fully occupied data-only waveforms, whereas practical frames contain direct-current and edge-guard nulls, fixed pilots, and random payload symbols. This mixed resource structure reshapes the self-ambiguity function and induces prominent sidelobes in the sensing region of interest (ROI). We therefore propose ROI-oriented deep block-unitary precoded OFDM (DBU-OFDM), which combines resource-specific trainable unitary transformations with dedicated sensing subcarriers to suppress ROI sidelobes while preserving the prescribed resource support. We develop a constraint-preserving parameterization capable of representing arbitrary unitary matrices and an ROI-aware sensing-support initialization. We prove periodic autocorrelation function (P-ACF) invariance under phase-only optimization and zero-delay Doppler-cut invariance under arbitrary unitary transformations. Numerical results corroborate the P-ACF optimality of cyclic-prefix OFDM (CP-OFDM) and provide numerical support for the conjecture that conventional OFDM is globally optimal in the considered aperiodic autocorrelation function (A-ACF) setting. Unitary pilot optimization improves the ROI peak-to-sidelobe ratio by over 2 dB, while combining it with dedicated sensing subcarriers yields gains ranging from several to tens of dB. Under the considered configuration, the A-ACF mode also provides substantially greater ROI ambiguity-shaping capability than the P-ACF mode.
Read the full abstract
Machine Learning
A Dominant Diffuse Phase in the Sparse Autoencoder Phase Diagram
Sparse autoencoders (SAEs) are increasingly used to recover interpretable features from neural-network activations, yet systematic feature co-occurrence can cause distinct features to be absorbed or merged. The MAIS-O43 open problem proposes a controlled experiment to characterize when recovery of a true synthetic dictionary gives way to feature merging as the nesting fraction $\gamma$, sparsity penalty $\lambda$, and dictionary size $M$ vary. We implement the specified protocol and evaluate 200 independently initialized fits across ten of the 165 grid cells. We observe zero full-dictionary recoveries and zero merges. Instead, every run converges to a reproducible diffuse phase: reconstruction is nearly perfect, but learned atoms typically remain far from the true features (median best cosine 0.5-0.7 against a 0.95 recovery criterion) and learned codes are an order of magnitude denser than the ground truth. This behavior persists under robustness checks and across the full 165-cell grid using standard minibatch Adam (3,300 additional fits). Since the global optimum of the exact sparse-coding objective is known to merge nested features in the two-feature case, these results suggest that trained SAEs need not reach the corresponding minima, and that the phase diagram of trained models may differ fundamentally from that of objective minimizers.
Read the full abstract
Cryptography and Security
Learning Intrusion Response Strategies for OT Systems
Cyberattacks against Operational Technology (OT) systems, which monitor and control industrial processes, pose an increasing threat to essential societal services. For this reason, developing automated intrusion response strategies is highly important. In this paper, we present a formal model of an OT intrusion response use case using the POMDP framework. It includes a realistic model of partial observability that is based on traffic measurements. This approach allows us to develop tractable, learning-based solution methods for automated intrusion response, which are based on PPO. We evaluate the obtained response strategies on an emulated OT system and find that they are effective against several types of MITRE attacks for the studied use case.
Read the full abstract
Computer Vision
TRACE: Trajectory-robust Admission with Evidence Ordering for Efficient GUI Agents
GUI agents accumulate high-resolution screenshots as the trajectory unfolds, increasing inference latency and memory usage. Training-free visual token pruning can reduce this cost, but cache reuse introduces a fundamental constraint. Once tokens are discarded, the corresponding visual evidence cannot be recovered without re-encoding. Pruning therefore becomes an irreversible admission decision that must remain useful for unknown future targets while preserving coverage of operable regions under tight budgets. To address these challenges, we propose \textbf{\method{}}, a training-free framework for \emph{Trajectory-robust Admission and Coverage-aware Evidence ordering}. Specifically, we combine a query-independent layout-derived interaction prior with instruction relevance and feature novelty to rank visual evidence according to both potential future utility and diversity. Then, we reserve part of the budget for native visual tokens distributed across the screen, repairing missing spatial coverage without breaking the ordering. Together, these mechanisms produce a nested token order, allowing retained visual evidence to shrink monotonically across budgets while remaining reusable throughout the trajectory. Finally, our monotone KV contraction incrementally contracts retired frames into compact session state, avoiding repeated visual encoding or pruning. Extensive experiments across six GUI benchmarks and diverse models verify the effectiveness of our proposed \method{} under tight budgets. The source code will be released.
Read the full abstract
Computation and Language
The Semantic Bottleneck: Leveraging Semantic Representations for Non-Invasive Speech Decoding
Non-invasive speech decoding remains constrained by the low signal-to-noise ratio of neural recordings, which makes fine-grained reconstruction of phonemes or individual words difficult. Motivated by neuroscientific evidence that high-level semantic representations are distributed across cortical regions and evolve over slower temporal scales, we hypothesize that semantic content may provide a more suitable target for non-invasive decoding than low-level acoustic or lexical features. We introduce Brain2Semantics2Text, a method that reconstructs text through an intermediate semantic embedding space. Our model maps sentence-level MEG responses into a semantic manifold and then inverts the predicted embeddings into natural language. This semantic bottleneck enables recovery of high-level meaning without word-level alignment. We describe the core principles of the approach, its implementation, and the strategies used to mitigate the challenges of learning a reliable neural-to-semantic mapping. Finally, we compare against prior non-invasive Brain2Text methods and show improved sentence-level results.
Read the full abstract
Commutative Algebra
Bounds on Hilbert coefficients of Cohen-Macaulay modules having finite projective dimension
Let $(A,\mathfrak{m})$ be a Gorenstein local ring with $G(A)$ Cohen-Macaulay, and let $M$ be a Cohen-Macaulay $A$-module of finite projective dimension. In \cite{Quasipure}, the authors proved that $e_1(M)\geq \binom{c+1}{2}$, where $c=\operatorname{reg}G(A)$ and $e_i(M)$ is the $i$th Hilbert coefficient of $M$. We first show that this bound remains valid when $A$ is Cohen-Macaulay. We then study upper bounds for $e_2(M)$ when $e_1(M)=\binom{c+1}{2}+i$ for $i=1,2$, and investigate the consequences of equality. In particular, we obtain depth properties and explicit descriptions of the $h$-polynomial of $G(M)$. Finally, we extend these results to strict complete intersection rings without assuming that $M$ has finite projective dimension.
Read the full abstract
Cryptography and Security
An Empirical Analysis of ReDoS Vulnerabilities and ReDoS Detection Tools
ReDoS vulnerabilities are a type of denial of service software weakness that occurs when a regex is used to validate user-supplied input. In some cases, the regex matching process can take exponential time, leading to a denial of service. In this study, we examine and compare the effectiveness of five publicly-available regex detection tools, and one regex correction tool, using three datasets. We further perform an empirical analysis of all ReDoS vulnerabilities reported to the NVD database in order to understand how they differ from non-ReDoS vulnerabilities and glean insights about this type of weakness. We find that ReDoS vulnerabilities are becoming more prevalent and are much more likely to be exploited than non-ReDoS vulnerabilities. We further find that detection tools exhibit substantial disagreement on whether or not a given regex is vulnerable.
Read the full abstract
Computation and Language
GANDR: Claim Auditing for Verifiable Legal Answer Generation
In high-stakes domains such as legal practice, a language-model answer is only useful to the extent that a reader can verify each claim against the source the system cites. Current grounded-generation pipelines score the answer as a whole, so a correct conclusion can rest on fabricated or loosely matched citations and still score well. Closing this gap requires both a system built for per-claim verification and an evaluation that measures it. We introduce GANDR (Grounded ANswer DRafter), a two-agent system in which a Drafter writes an answer in a structured legal-reasoning format and a separate Critic, with the same view as a human verifier, audits each claim against its cited source and emits a per-claim audit trace on every round. We pair it with a strict correctness criterion requiring every citation to resolve to a passage the retriever returned. On a 185-item legal benchmark where all six systems share one backbone, one retrieval surface, and one citation instruction, GANDR ranks first on every primary metric, reaching 70.8% strict accuracy and leading the strongest baseline by 11.3 points (p<0.01). Reverting the protocol-anchored commit rule lowers strict accuracy by 22.7 points, and the strict lead stays positive on three further backbones, at +3.2 to +6.5 points. This lead traces to the Drafter configuration and the protocol-anchored commit, not to rewriting. Against two law-trained annotators the audit flags under-supported claims at F1 0.84 as a binary detector, while its four-way verdict labels agree only weakly and are advisory. Code is available upon request.
Read the full abstract
Computer Vision
Isotropic Embedding Perturbations for Robust Vision Language Encoders
Data augmentation is fundamental to training modern deep vision and multimodal models. While individual methods, such as RandAug, CutMix, Mixup, RandErase, and DropPath, offer strong regularization effects, their combined use has saturated in performance due to overlapping functionalities, and aggressive pixel-level manipulations may disrupt delicate cross-modal alignment. This saturation motivates the search for a new augmentation axis within the embedding space rather than the input space. We introduce Aether, a simple plug-in method that applies diffusion-style random perturbations in the embedding space via controlled alpha-mixing, specifically designed to provide isotropic regularization that remains semantically consistent. Inspired by feature-space perturbations in language models and image degradation in generative pretraining, Aether induces mild yet effective perturbations that smooth the representations without compromising the fine-grained structural information required for strong vision-language encoders. Across diverse architectures and across multiple recognition tasks, Aether delivers consistent gains over the advanced recipe combining CutMix, Mixup, DropPath, and RandAug—a level of improvement rarely observed with modern augmentation alternatives. Notably, Aether demonstrates superior effectiveness in multi-modal alignment, succeeding where traditional pixel-space augmentations fail by providing a stable, isotropic regularization signal that respects the integrity of the high-dimensional feature space.
Read the full abstract
Statistics Theory
Parameter Estimation for Diffusive Stochastic Master Equations in Continuously Observed Quantum Systems
Continuous measurement of quantum systems gives rise to stochastic dynamics of the conditional quantum state, described by diffusive stochastic master equations. In this paper, we study parameter estimation for such equations when the Hamiltonian and measurement operators depend on unknown parameters. Based on multiple independent observed trajectories with a known initial state, we construct a contrast function using the deterministic averaged state and define a maximum contrast estimator for the unknown parameter. We prove strong consistency and asymptotic normality of the parameter estimator in a fixed-time, many-trajectory asymptotic regime. A key point is that the covariance matrix appearing in the asymptotic normality is given in a form that naturally leads to a consistent covariance estimator. This covariance estimator is computable from the observed data together with the deterministic averaged dynamics, so the asymptotic normality result can be used to construct standard errors and assess uncertainty for the parameter estimator.
Read the full abstract
Astrophysics of Galaxies
From stardust to interstellar grain growth in the first galaxies: a cosmological transition in dust evolution near z ~ 8.9
When and how did dust begin to shape galaxies? Motivated by the identification of an apparent redshift break in galaxy dust masses, suggesting substantially lower dust masses at $z \gtrsim 9$, we investigate dust enrichment during the first billion years of cosmic history. We aim to determine whether the observed evolution marks a transition in the dominant dust-production mechanism and to identify the physical conditions under which such a transition is expected to occur. Using JWST, ALMA, and NOEMA observations, we measure ultraviolet dust attenuation and dust masses. We apply a censored change-point analysis and compare the observations with dust evolution modelling. The analysis identifies a preferred transition near redshift z ~ 8.9, corresponding to about 570 Myr after the Big Bang. The evidence for a break is strongest in dust mass and dust-to-stellar mass ratio, mostly estimated from JWST NIRSpec spectrophotometric fitting but also partly from sub-mm data. The ultraviolet attenuation measurements are consistent with a transition at the same epoch but do not independently require one. The models are consistent with the onset of efficient interstellar grain growth above a characteristic metallicity. We interpret the transition near z ~ 8.9 as the emergence of grain-growth-dominated dust evolution from an earlier regime dominated by supernova-produced grains. Population III enrichment can modify the earliest chemical-enrichment history but leaves the timing of the dust transition nearly unchanged and is not required for its emergence.
Read the full abstract
Computational Complexity
On the Limits of Quantum Multiparty Simultaneous Communication
We study the relative power of public randomness and quantum communication in the multiparty Simultaneous Message Passing (SMP) model. By analyzing a total Boolean function and a relational problem, we establish polynomial and exponential separations between classical public-coin protocols and quantum protocols without shared randomness or prior entanglement. We first introduce XOR Equality, a total Boolean function in which each of $k$ players receives an unrestricted string $x_j\in\{0,1\}^n$, and the referee must decide whether $x_1\oplus\cdots\oplus x_k=0^n$. For $k\ge8$ and worst-case error at most $1/3$, we prove quantum lower bounds of $\Omega(\min\{n,k^2\})$ on total communication and $\Omega(\min\{n/k,k\})$ on maximum message length. A classical public-coin protocol uses two bits per player with error at most $1/4$. For $n=k^2$ and worst-case error at most $1/3$, we prove that quantum protocols require maximum message length $\Omega(\sqrt n)$ qubits, whereas two public-coin bits per player suffice. We then turn to relations, for which we obtain exponential separations. Specifically, we study Multiparty Index Coordination, a $k$-player generalization of the two-player relation studied by Gavinsky, Kempe, Regev, and de Wolf (STOC 2006). We prove an unambiguous quantum lower bound of $\Omega(n^{1-1/k})$ on maximum message length, matched by a classical private-coin protocol. For any fixed error $\varepsilon\in(0,1/8)$, we also prove a bounded-error quantum lower bound of $\Omega(n^{(k-1)/(k+1)})$ while we show that public-coin protocols solve the relation unambiguously with maximum message length $O(\log n)$, giving exponential separations in both regimes. The implicit constants are independent of $k$, and both quantum lower bounds become linear when $k\ge c\log n$ for any fixed $c>0$.
Read the full abstract
High Energy Physics (Experiment)
Operation and performance of the Probe for Luminosity Measurement at LHCb
The Probe for LUminosity MEasurement (PLUME) detector is a dedicated luminosity monitor at the LHCb interaction point. It is a hodoscope comprising 48 Hamamatsu R760 photomultiplier tubes that detect Cherenkov light produced by particles travelling in the direction opposite to the LHCb spectrometer acceptance. PLUME provides real-time, bunch-by-bunch luminosity measurements during LHCb data taking and serves as the primary detector for controlling the luminosity levelling process at LHCb. In addition, its data are used offline, together with other dedicated counters from LHCb sub-systems, to determine the integrated luminosity delivered to the experiment. This paper reports on the detector's operational performance during the 2024-2026 data-taking period of Run 3. The integrated luminosity recorded by the LHCb experiment in $pp$ collisions at $\sqrt{s} = 13.6$ TeV during this period, as measured by the PLUME online luminosity counters for detector performance monitoring, amounts to $\mathcal{L} = (26.71 \pm 1.07)$ fb$^{-1}$. The luminosity values used in physics analyses are determined separately through dedicated offline calibrations based on van der Meer scans and Beam Gas Imaging techniques, and will be reported in a dedicated publication, as they are beyond the scope of this paper.
Read the full abstract
Machine Learning
Training Trajectories Determine Circuit Removability in Annealable Soft-Prior Transformers
Soft positional priors can help small Transformers learn retrieval circuits, but it is unclear whether the resulting circuits remain functional once the prior is removed. We test this with an annealable soft-prior Transformer whose attention biases can be learned, faded, or zeroed during training and evaluation. On associative recall, unforced models perform well with the prior active ($0.772 \pm 0.020$) but collapse at zero gate ($0.095 \pm 0.009$). Smooth fade-to-zero training preserves high zero-gate accuracy ($0.734 \pm 0.028$), whereas forced-zero training, hard switching, and post hoc continuation fail to recover the same effect. The pattern also appears on Markov induction. Linear regression ICL provides a boundary case because zero-gate training can learn that task directly. Mechanistic traces show that circuit consolidation occurs after the gate reaches zero, even though the responsible heads vary across seeds. These results suggest that circuit removability in small discrete retrieval tasks depends on the training trajectory, not just the final architecture.
Read the full abstract
Robotics
GM-Loco: Terrain-Adaptive Humanoid Locomotion on Granular Media
Humanoid locomotion on granular terrain remains a significant challenge due to its complex foot-terrain interaction dynamics that are difficult to model. Existing approaches either ignore granular contact dynamics or incorporate simplified normal force models with heuristic tangential components. In this work, we present a physics-grounded granular contact model based on three-dimensional resistive force theory (3D RFT) and efficiently simulate granular terrain for reinforcement learning (RL) training. Unlike traditional rigid contact models and simplified granular contact models with ad-hoc heuristics, our contact solver produces physically accurate granular intrusion dynamics without resorting to heuristics. It captures realistic penetration and tangential drag during training, enabling the policy to learn behaviors that transfer reliably to real-world granular terrain where rigid contact models fail. To adapt to varying terrain conditions, we train a terrain-adaptive locomotion controller via teacher-student RL, using a variational autoencoder to encode terrain information into a compact latent representation. Simulation studies using material point method (MPM) with NVIDIA Newton demonstrate that our method generalizes to unseen granular terrains, achieves a significantly higher success rate than baselines, and demonstrates zero-shot terrain identification and adaptation. We further validate our approach through extensive hardware experiments across diverse real-world granular terrains including basalt, dry sand, and beach sand. To the best of our knowledge, this is the first demonstration of agile humanoid locomotion on real-world granular terrain. Project page: https://humanoid-gm-locomotion.github.io/HUMANOID-GM/
Read the full abstract
High Energy Astrophysical Phenomena
Associating binary black holes with galactic centres using lensed gravitational waves
Binary black holes (BBHs) have been theorised to form through various different channels, but current LIGO-Virgo-KAGRA (LVK) sky locations make the direct study of formation channels a challenge. Association of strongly lensed BBHs to their hosts has been shown to be possible with current detector networks at upgraded sensitivity and survey telescopes like Euclid, with localisations that can reach sub-galactic scales in the source plane. With Hubble Space Telescope-like high-resolution imaging, we report that strong-lensing localisation of BBHs allows us to confidently associate the BBH with specific structures within their host galaxies, specifically, galactic centres (GCs). We demonstrate that a BBH localised to the GC of the galaxy can reject light-tracing BBH populations ($p < 5\%$) in a single observation, and in most cases demonstrate high confidence rejection ($p < 1\%$), providing a conservative basis to exclude light-tracing spatial distributions associated with field-like or non-central formation channels. Such association therefore directly supports formation channels confined to GCs, such as active galactic nuclei and nuclear stellar clusters.
Read the full abstract
Combinatorics
Jack Content Operators and the Deformed ${\mathcal W}_{1+\infty}$ Algebra
Frenkel and Wang obtained a representation of the Virasoro algebra by commuting Goulden's cut-and-join operator with the Heisenberg generators. A vertex-operator construction by Lascoux and the author extends this representation to $\mathcal W_{1+\infty}$ by means of differential operators whose eigenvalues are the power sums of the contents of a Young diagram. We develop a Jack deformation in the spherical degenerate double affine Hecke algebra and its stable limit. Starting from the Heckman–Polychronakos integrals, we isolate operators whose eigenvalues are the power sums of the $\alpha$-contents. Because the Goulden–Jackson product is defined in the convention dual to the usual Calogero–Sutherland Hamiltonians, the multiplication operators $\Delta_\mu(\alpha)$ are obtained by taking Hall adjoints. This gives conceptual derivations of the Jack cut-and-join operator and of the stable $3$-cycle operator. A normal-ordering construction due to Sergeev and Veselov makes the latter calculation explicit and suggests an integral form over $\mathbb Z[\alpha]$. The commutators of the cut-and-join operator contain one half of the usual Feigin–Fuchs realization, but this Virasoro completion is not the deformation of the Frenkel–Wang construction. The latter takes place in the deformed $\mathcal W_{1+\infty}$ algebra $\mathbf{SH}^c$, equivalently in the affine Yangian of $\mathfrak{gl}_1$: in our normalization its first nontrivial Cartan mode is $\psi_3=3\Delta_2(\alpha)+2(\alpha-1)E$, and its commutators with the first raising and lowering modes recursively generate the remaining currents. At $\alpha=1$ these relations specialize to the central-charge-one $\mathcal W_{1+\infty}$ representation used by Lascoux and the author.
Read the full abstract
Robotics
SwingBot: Learning Whole-Body Brachiation for Humanoid Robots
Brachiation enables primates to move across overhead supports when ground paths are blocked, suggesting a complementary locomotion mode for robots operating in cluttered or hazardous environments. Bringing this capability to high-DoF humanoid robots is difficult because the controller must discover a long-horizon release-swing-capture sequence, coordinate alternating contacts with whole-body momentum, and act without reliable measurements of segment-relative displacement or hook-contact state. We present SwingBot, a learning framework for continuous humanoid brachiation with passive wrist hooks. SwingBot makes the task trainable by organizing learning around the structure of brachiation: biomimetic keyframes make rare release-swing-capture transitions reachable during early exploration, and recurrent privileged-state estimation provides compact position and contact latents for deployment. Hardware experiments demonstrate continuous bar traversal and robustness to payload, external disturbances and different bar spacings, showing that this formulation offers a practical route to whole-body robotic brachiation.
Read the full abstract
Quantum Physics
Solving wave propagation problems via geometric quantum state preparation on dispersion manifolds
We present a quantum algorithm for solving partial differential equations through a linear-system formulation, focusing on wave propagation problems described by the discretized Helmholtz equation in frequency domain. Although quantum linear-system solvers offer exponential compression of the system degrees of freedom, their runtime complexity is generally governed by the condition number of the discretized operator. Exploiting the analytic structure of the differential operator can provide an alternative to explicit matrix inversion, as illustrated for the screened Poisson equation through an explicit quantum circuit. For the Helmholtz equation, however, the inverse operator becomes singular on the dispersion surface $k^2=\omega^2/c^2$, rendering direct Fourier-space state-preparation methods exponentially inefficient. We address this challenge by directly preparing quantum states supported on the resonant manifold and encoding source locations through Fourier phases. The resulting algorithm eliminates the exponentially large overhead associated with post-selection on the resonant manifold, yielding a success probability that depends linearly on the number of sources and is independent of the computational domain size. More generally, our approach applies to hyperbolic differential equations whose Fourier-space solutions possess singular support on dispersion manifolds, recasting their solution as a problem of geometric quantum state preparation.
Read the full abstract
Group Theory
Finite presentations of metabelian groups: effective enumeration via Laurent relations
For an ordinary finite presentation $P=\langle x_1,\ldots,x_n\mid R\rangle$, put $G(P)=F_n/\langle\langle R\rangle\rangle$. We construct a primitive-recursive predicate $V$ with $G(P)''=1 \Longleftrightarrow \exists c\in\mathbb{N}: V(P,c)=1$. Thus finite presentations of metabelian groups are recursively enumerable, answering Kourovka Problem 17.124. An effective form of the Bieri-Strebel covering construction, using signed Laurent relations and rational separation, gives a family of finitely presented metabelian groups cofinal under epimorphisms. Products of conjugates of defining relators witness these epimorphisms. The construction and enumeration theorem are formalized in Lean 4.
Read the full abstract
Computers and Society
Total Simulated Survey Error: Designing and Diagnosing Survey Responses from Large Language Models
Large Language models (LLMs), having been trained on vast amounts of human-generated data, may encode the attitudes and behaviors of these humans. As such, LLMs show promise in mimicking human-like patterns that facilitate their use in simulating people in a wide variety of contexts. One such context is using LLMs as 'silicon samples', i.e., proxies of people in answering survey questions to establish public opinion, design policies, or use as (social) scientific data. However, several critical questions of social biases, generalization, and technical limitations remain, further complicated by a vast design space open to simulation designers. Multiverse analyses might help us make sense of the impact of different design choices, however, we lack a systematic understanding of the design space of LLM-generated surveys as well as how these decisions interplay with inherent LLM limitations. Therefore, how do we systematically identify, trace, and document limitations in LLM-generated survey responses? Building on traditions in the quantitative social sciences, specifically survey methodology and measurement theory, we investigate threats to the validity of LLM-generated survey responses. To do so, we design a framework that enumerates conceptual errors and systematic biases that can occur at different stages of the survey simulation lifecycle. Our framework, called the Total Simulated Survey Error (TS2E) Framework, provides a unified and end-to-end perspective on LLM-generated survey data. The framework, illustrated through a theoretical and empirical case study, enables survey simulation designers to systematically identify and reflect on errors in LLM-generated surveys.
Read the full abstract
Signal Processing
Efficient LOS-Sampled GNSS Direct Position Estimation: An Information-Loss CRB Analysis
Conventional Global Navigation Satellite System (GNSS) Direct Position Estimation (DPE) exploits raw intermediate-frequency (IF) data and provides a full-information Cramér-Rao Bound (CRB) benchmark, but its accumulated-correlation objective requires dense evaluations over a common Position, Velocity, and Time (PVT) search space. This paper proposes an efficient Line-of-Sight (LOS)-sampled DPE, where each satellite channel independently retains only PVT sample points aligned with its LOS direction. A residual-minimization estimator is formulated to resolve the mismatch between accumulated-correlation metrics and per-satellite LOS sampling. The Fisher information matrix (FIM) and information-loss CRB of LOS-sampled DPE are derived, quantifying the information loss determined by LOS sampling parameters. Theoretical analysis, Monte Carlo simulations, and real experiments show that proper LOS sampling approaches the full-information CRB and practical performance of conventional DPE, while reducing the number of correlation evaluations from exponential to linear growth.
Read the full abstract
Computer Vision
FreqFLD: Towards All-in-One Facial Landmark Detection via Frequency Modulation
Recent progress in deep learning has significantly advanced facial landmark detection. However, most existing methods process features in a spatial-domain manner under a dataset-specific training paradigm, which overlooks the fact that facial landmark detection is inherently geometry-driven and sensitive to frequency variations, thereby limiting cross-dataset generalization under complex scenarios and hindering the development of a facial landmark detection model. To address this issue, we propose FreqFLD, a frequency-modulated framework towards All-in-One facial landmark detection. Specifically, FreqFLD introduces a Frequency Modulation Module (FreqMoM) to explicitly induce the frequency prior by decoupling and modulating low- and high-frequency components, which is then injected into subsequent feature modeling to enable balanced modeling of global facial structure and local landmark details. Furthermore, FreqFLD employs a Frequency-Modulated Mixture-of-Experts (FreqMoE), with expert selection adaptively conditioned on frequency-modulated priors, enabling flexible modeling of heterogeneous facial landmark patterns under diverse and challenging scenarios. To regularize frequency-consistent modeling under the All-in-One paradigm, we further introduce a Frequency-Consistent Routing (FreqCR) loss, which constrains the routing and assignment of frequency-aware experts to promote balanced expert utilization across diverse facial scenarios, thereby enabling stable expert specialization and achieving robust facial landmark detection. Extensive experiments demonstrate that the proposed FreqFLD achieves comparable performance on popular datasets. The code is available at: https://github.com/jkj1059657014/FreqFLD.
Read the full abstract
Social and Information Networks
How neighbourhood ideology shapes misinformation belief in densely tied social networks
With the rapid spread of news on social media, understanding the propagation of misinformation is becoming increasingly important. One factor that affects individuals' vulnerability to false information is their ideological predisposition. Despite the large number of agent-based models that focus on social influence as a driver of the spread of false claims, they often fail to explicitly integrate personal ideological biases into belief formation. In this work, we explore how misinformation spreads through the interaction between individuals' ideological biases and social influence. Our model accounts for both the strength of individuals' ideological biases and the extent to which a false claim aligns with their ideology. Social influence modifies the effects of ideological intensity and false claim alignment through network interactions. Notably, the influence of neighbours' ideological intensity on belief is strongly affected by how well those neighbours are connected to one another. These results highlight the importance of considering both network structure and personal ideological biases when modelling misinformation propagation.
Read the full abstract
Neural and Evolutionary Computing
Structural Fusion of Bayesian Networks with Limited Treewidth Using Genetic Algorithms
This paper introduces an evolutionary computation approach for consensus in structural Bayesian Network (BN) fusion under the constraint of limited treewidth. The consensus BN aims to reconcile multiple input BNs into a single one that retains key structural features present in the original networks. Treewidth, a graph-based parameter associated with computationally tractable inference, is utilized to restrict the complexity of the resulting network. A genetic algorithm is proposed to look for a BN that codifies as much information about the unrestricted fusion as possible while ensuring the treewidth restriction. Experimental evaluation demonstrates the genetic algorithm's ability to obtain consensus BNs with limited treewidth, providing a valuable tool for aggregating information from diverse sources while returning a computationally actionable model.
Read the full abstract
Statistics Applications
The Impact of a Gridded Streamflow Measure on Drought Variation in the Conterminous United States
Models for droughts draw on a wide range of meteorological and hydrological inputs. Stakeholders classify droughts according to different purposes and priorities, and accordingly rely on different measures to explain and predict the onset of drought. While many meteorological inputs are available as gridded data products, hydrological streamflow measurements are often only available as point-referenced gauge measurements. This leads to an issue of misalignment for studies relying on both areal meteorological and point-referenced hydrological data. Such gauge data can also have notable spatial and/or temporal missingness. Many areas remain ungauged, and where gauges exist, equipment malfunctions cause temporal gaps. In this study, we document the value of an existing gridded streamflow measure for the conterminous United States, one which was specifically designed to match the spatio-temporal support of publicly available meteorological and ordinal drought measurements. We use this homogenized database to assess the relative importance of this streamflow measure in explaining US drought variability. This assessment first requires that we address autocorrelation and variability in the variance of observed droughts, two extensions to existing statistical methodology. After suitably controlling for both, our results show that the streamflow measure is often the most statistically important explanatory variable from among a wide set of meteorological variables. We explore the spatial variation and some drivers of this result.