Operator Algebras
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
We solve Tingley's problem for Haagerup noncommutative $L_p$-spaces, where $1<p\ne 2<\infty$, which gives an affirmative answer to Mori's problem \cite[Problem~6.3]{Mori}.
Information Retrieval
E-SENS: Exclusion-Sensitive Penalization for Negative-Constraint Retrieval
Retrieval-augmented language models can fail to respect negative constraints when the retriever supplies evidence about concepts the user explicitly excluded. Beyond explicit negation, queries may ask for answers that include one concept while excluding another, or for entities that belong to a category but differ from a closely related instance. Because the excluded concept still appears in the query text, dense retrievers may assign high similarity to documents about that concept even when the user asks to avoid it. We introduce E-SENS, a training-free reranking method for negation-sensitive retrieval. E-SENS extracts a compact trap query for the excluded side and subtracts trap-query similarity from the original-query retrieval score. On ExcluIR, E-SENS shows a clear recall-violation trade-off across four embedding models and reduces trap retrieval at recall-preserving settings.
Read the full abstract
Computer Vision
Efficient and High-Quality Depth Estimation via Pixel-Space Diffusion with Linear Attention
This work presents $\textbf{Lapis}$, a $\textbf{l}$inear-$\textbf{a}$ttention-based $\textbf{pi}$xel-$\textbf{s}$pace generative framework that achieves efficient and high-fidelity depth estimation with one-step diffusion. While generative frameworks have significantly advanced monocular depth estimation with superior detail fidelity, the $\mathcal{O}(N^2)$ complexity of standard attention and the multi-step denoising process introduce prohibitive computational costs when scaling them to high-resolution image applications. Although linear attention and one-step prediction are intuitively viable, directly applying them leads to poor structural consistency, detail loss, and noise. Lapis rectifies these limitations through a coarse-to-fine hierarchy. Specifically, a Patch-level Consistency Module restores structural coherence by integrating semantic and spatial priors. Subsequently, a Pixel-level Refinement Module recovers sharp geometric boundaries via skip-connection-based pixel correspondence. Furthermore, to mitigate sampling noise inherent in one-step diffusion, we leverage the manifold assumption and adopt a direct $\mathbf{x}$-prediction strategy to target the clean data manifold. Extensive evaluations on multiple benchmarks demonstrate that Lapis consistently achieves state-of-the-art (SOTA) accuracy and boundary sharpness across various resolutions, reducing inference latency by up to 7.6$\times$ at 1080P and 10.9$\times$ at 1440P resolution compared to previous SOTA generative models.
Read the full abstract
Optimization and Control
Analysis of First-Order Linear Pursuit and Evasion Differential Games with Gronwall-Type Constraints
We examine pursuit and evasion problems in the space $ \mathbb{R}^{n} $ involving a lone pursuer and evader. Motion of each player is governed by a first-order linear differential equation. The players' control functions are subject to the Gronwall-type inequality. The game's duration is fixed and represented by a positive number $\vartheta $. When the state of a pursuer coincides with that of the evader, we then say the pursuit is completed. On the contrary, evasion is possible when throughout the game there is no agreement between the states of pursuer and evader. The result obtained related to the pursuit problem depends on the attainability domains of the two players. On the other hand, one sufficient condition is given for evasion to be possible.
Read the full abstract
Operator Algebras
Simplicity and pure infiniteness for $\text{C}^*$-algebras associated with stabilizers of boundary actions
Given a discrete group $\Gamma$ acting on a compact space $X$, and a stabilizer subgroup $\Lambda\leq \Gamma$ of $X$, we use the Rieffel induction of covariant $(\Lambda, X)$-representations to study classes of representations induced by certain characters on $\Lambda$ and the $\text{C}^*$-algebras they generate. When $X$ is a $\Gamma$-boundary, we obtain new classes of simple, traceless group $\text{C}^*$-algebras. When the $\Gamma$-boundary $X$ is an extreme boundary, we show that the associated group $\text{C}^*$-algebras are also purely infinite, answering part of a question posed by Kalantar and Scarparo on $\text{C}^*$-algebras associated with Thompson's groups. The latter $\text{C}^*$-algebras are shown to be selfless in the sense of Robert.
Read the full abstract
Number Theory
Characterization of a class of complete permutation quadrinomials over $\mathbb{F}_{2^{2m}}$
Let $q=2^m$, $Q=2^k$, and $1\leq k\leq m-1$. We characterize complete permutation polynomials (CPPs) over $\mathbb{F}_{q^2}$ of the form \[ f(x)=c_0x^{Q+1}+c_1x^{Q+q}+c_2x^{qQ+1} +c_3x^{q(Q+1)},\qquad c_i\in\mathbb{F}_{q^2}. \] We prove that no such CPP exists when $k>1$, and recover the known characterization in the cubic case $k=1$. This completes the classification throughout the stated exponent range. The proof uses the known permutation classification to reduce completeness to linear perturbations of product and monomial models. The required nonpermutation results follow from direct elementary arguments based on the quadratic structure over $\mathbb{F}_2$.
Read the full abstract
Sound
VIBE: Video Instruction-aligned Background music gEneration
Current video-to-music (V2M) models lack semantic control and fail to penalize instruction violations, largely due to their reliance on reconstruction objectives and the representational bottleneck of static cross-modal conditioning in Diffusion Autoregressive (DAR) architectures. To resolve this, we introduce VIBE, a novel text-and-video-to-music (T+V2M) generation model that leverages: (1) Conditioning Connection, a depth-wise cross-layer conditioning mechanism that dynamically bridges the planning and diffusion refinement heads and (2) a comprehensive reward modeling taxonomy, optimizing for both hard, verifiable constraints (e.g., tempo, key) and soft, subjective qualities (e.g., musicality, multimodal alignment) with a structured 5-stage training curriculum. Upon evaluation using audio-visual alignment, instruction following, and audio quality metrics, along with a subjective human evaluation study, we observe that VIBE demonstrates enhanced controllability and instruction adherence while performing comparably to most evaluated baselines on generation fidelity and multimodal alignment.
Read the full abstract
Machine Learning
TPR-Attention for Combinatorial Generalization
Systematic generalization remains a significant challenge in deep learning. In particular, combinatorial generalization - generalizing to new configurations of known factors of variation - is effortless for humans but difficult for standard neural architectures that rely on statistical correlations rather than explicit structural representations. We introduce a new architectural component that embeds structured inductive bias into deep learning: an attention mechanism operating over tensor-product representations (TPRs). Through controlled experiments on compositional tasks, we show that this TPR-attention mechanism outperforms existing architectural components in combinatorial generalization. These results highlight the value of integrating explicit compositional structure into neural attention and point toward a promising path for models capable of systematic generalization.
Read the full abstract
Optimization and Control
Interception Conditions in Multi-Agent Pursuit Games Governed by Linear Dynamics with Gronwall-type Constraints
This paper investigates a multi-agent pursuit problem in which a group of pursuers seeks to intercept one or more evaders within a fixed operational time horizon. The motion of both pursuers and evaders is described by first-order linear differential equations, and the control inputs available to the agents are subject to Gronwall-type constraints. Pursuit is considered successful when at least one pursuer reaches the position of each evader at a finite time within the prescribed duration. Within this framework, we construct permissible strategies for the pursuers and derive sufficient conditions under which interception is guaranteed despite the evaders' counteractions. To support the theoretical results, we present numerical examples that demonstrate the effectiveness of the proposed strategies and confirm the analytical conditions for successful pursuit.
Read the full abstract
Computer Vision
Aligning Multi-Trajectory Supervision with Policy Optimization for VLA Driving
Vision-language-action (VLA) driving methods increasingly combine multi-trajectory imitation learning with group-relative policy optimization (GRPO), making trajectory selection critical to final performance. However, some high-scoring trajectories that improve imitation can degrade subsequent GRPO by inducing advantage estimates misaligned with the current policy's feasible behavior distribution, driving updates away from safe and compliant behaviors. To address this, we propose a novel framework that aligns multi-trajectory supervision with policy optimization. To address the policy gradient bias induced by infeasible noisy trajectories outside the feasible region, augmented trajectories are constrained to a neighboring manifold of the ground-truth feasible region, and a Pareto-optimality criterion is adopted in place of the conventional aggregate score, retaining only non-dominated candidates and thereby filtering out conflicting samples at the source. To ensure that expanded trajectory supervision is effectively absorbed during policy optimization, we introduce two complementary mechanisms: feasibility-first advantage assignment and dynamic distillation. The former adapts Pareto credit to the feasibility composition of each rollout group and guides fully infeasible groups toward safe references. The latter updates teacher trajectories across refinement rounds to continually transfer useful supervision. Together, they progressively translate the benefits of expanded supervision into policy improvement. On NAVSIM v1 and v2, our method achieves 91.4 PDMS and 89.1 EPDMS, respectively, under single-trajectory inference, and recovers 440 of 658 initially failed scenes, 11.1% higher than the original GRPO baseline.
Read the full abstract
Numerical Analysis
Structure-Preserving Detailed-Balance Master-Equation Discretizations for Fokker–Planck Equations
We develop a variational–Markov construction of detailed-balance master-equation discretizations for Fokker–Planck equations directly from their energy–dissipation laws. Rather than discretizing the differential operator, we represent mass transfer between neighboring grid points by two directional jump rates. On each edge, the discrete energy–dissipation law determines the net flux, while detailed balance fixes the rate ratio; a local reconstruction of edge quantities from neighboring grid-point values then uniquely determines both rates. A logarithmic-mean reconstruction recovers the classical Scharfetter–Gummel/Wang–Peskin–Elston rates, while alternative reconstructions yield other reversible schemes. The resulting semi-discrete systems conserve mass, preserve nonnegativity, satisfy detailed balance, and dissipate a discrete free energy. The same edgewise construction extends to state-dependent and degenerate mobilities, nonlocal interaction energies and higher-dimensional problems. The corresponding implicit and semi-implicit fully discrete schemes are linear, mass-conservative, positivity-preserving, and energy-stable, with a time-step restriction required only for nonlocal interaction energies whose kernel is not negative semidefinite. Numerical experiments confirm the expected spatial convergence rates of all detailed-balance schemes and verify their equilibrium accuracy, positivity preservation, and free-energy decay with discontinuous potentials, saturation, nonlocal interactions, and two-dimensional problems.
Read the full abstract
Functional Analysis
Graphs of operators as points in the Grassmann manifold
We study the set $\Gamma$ of graphs of closed, densely defined operators in a Hilbert space $H$, regarded as a subset of the Grassmann manifold $P(H\times H)$ of orthogonal projections in $H\times H$. We show that the subset $\Gamma^b$ of graphs of bounded operators is the open unit ball of $P(H\times H)$ centered at the graph of the zero operator $P_0$ (which projects onto $H\times\{0\}$). This ball is diffeomorphic to $B(H)$ via the map $T\mapsto P_T$ ($=$ the projection onto the graph ${Gr(T)}$ of $T$). We show that graphs of unbounded closed operators lie at the boundary of $\Gamma$. We also study the existence and characteristics of minimal geodesics of $P(H\times H)$ joining two graphs $Gr(A)$, $Gr(B)$. If $A,B$ are selfadjoint, such a geodesic always exists, and we construct explicitly a distinguished exponent using the five-space decomposition associated to the pair of subspaces $Gr(A)$, $Gr(B)$. An explicit low-dimensional example shows that the geodesic joining two graphs need not remain inside $\Gamma$, i.e., does not consist entirely of graphs. We also relate graphs of compact operators to the restricted Grassmannian, and study the problem of common complements for pairs $Gr(S)$, $Gr(T)$, giving positive results when one operator is bounded or under lower boundedness conditions.
Read the full abstract
Dynamical Systems
At most exponential growth of periodic orbits for star flows
We prove that on any closed manifold there exists a C1 open and dense subset of star flows for which the periodic orbits grow at most expo- nentially. We also explain how our methods apply to the sectional-hyperbolic attractors including the Lorenz polynomial equation.
Optics
All-optical reconstruction of valley polarization through helicity-resolved high-harmonic generation
We theoretically investigate valley-resolved high-order harmonic generation in gapped graphene driven by elliptically polarized laser fields. Using two-band density-matrix simulations and an electron-hole recombination trajectory model, we find that the two inequivalent valleys emit harmonics with opposite helicities. Under an elliptically polarized field, these emissions occur predominantly in different half cycles of the laser field. Time-dependent density functional theory calculations for monolayer MoS$_2$ show the same temporal separation of harmonic emissions with opposite helicities, supporting the generality of this valley-dependent chiral response. We further propose an all-optical scheme to reconstruct valley polarization from helicity-resolved harmonic signals. A circularly polarized pulse first prepares a valley population imbalance. A subsequent elliptically polarized laser induces different changes in the harmonic intensities of opposite helicities through Pauli blocking. The ratio of these intensity changes provides a direct measure of the valley polarization. Our results demonstrate that chiral high-harmonic emission can serve as an all-optical probe of ultrafast valley-dependent carrier dynamics.
Read the full abstract
Materials Science
Two-step transient liquid phase bonding of NiTi to Ti-6Al-4V through a NbZrW barrier
Dissimilar joining of NiTi to Ti-6Al-4V (Ti-64) is limited by brittle Ti2Ni formation and degradation of NiTi functionality. A two-step transient liquid phase (TLP) route was developed in which a refractory NbZrW diffusion barrier converts the incompatible couple into two independently bondable interfaces. The barrier plays a different role for each alloy: a reactive substrate for NiTi, dissolving to form a Ti-rich Ni-Ti-Nb liquid that infiltrates its own grain boundaries and is terminated by selective Ti absorption into the barrier; and an inert substrate for Ti-64, joined through contact melting of a sacrificial Cu foil. Both interfaces are fully dense and free of continuous intermetallic layers. In tension, joints spanning both interfaces began transforming at 350 MPa, exhibited a stress plateau to 2.5 global strain (consistent with stress-induced transformation of the NiTi half of the gauge) and failed beyond the plateau at 380-410 MPa. Five load-unload cycles to 460 MPa showed stable superelastic loops with minor ratcheting. These results demonstrate that a diffusion barrier enables dissimilar TLP joining of otherwise incompatible alloys.
Read the full abstract
Solar and Stellar Astrophysics
Moment-based formulas for the transport coefficients
The coefficients of the transport equations, describing the propagation features, are particularly important in astrophysics, interplanetary physics, and experimental plasma physics. In this paper, the variable-dependent diffusion coefficients are investigated. For the momentum transport equations, we find that the coefficients are related to statistical quantities, some of which are new. In addition, these coefficients take logarithmic forms, which are different from the results derived in previous papers. For isotropic pitch-angle scattering, we also obtain a formula that takes a logarithmic form. For fractional transport equations, the coefficients expressed in terms of the moments are obtained from the governing equations.
Read the full abstract
High Energy Physics (Phenomenology)
Building a Better Beta: Nucleation and Timescales in Cosmological Phase Transitions
First-order phase transitions in the early universe can generate a stochastic background of gravitational waves, offering a unique probe of high-energy physics. In this work, we investigate aspects of bubble nucleation and transition timescales, which play a central role in shaping the resulting gravitational wave spectrum. Many common approaches characterise the transition rate via a Taylor expansion of the false vacuum decay rate. We argue that a more fundamental description is instead given by the distribution of bubble lifetimes, and define a new timescale, $\beta_\nu$, as the first moment of this distribution. We show that $\beta_\nu$ reproduces the behaviour of previous timescale definitions in the appropriate limits, while avoiding their pathologies, and offers a more natural description of the ensemble of nucleated bubbles. We then quantify the impact of this improved timescale on the predicted gravitational wave spectrum, finding that it shifts the peak amplitude by up to an order of magnitude relative to previous definitions. As next-generation gravitational wave detectors come online, robust theoretical predictions will be essential; we hope this work represents a step in that direction.
Read the full abstract
Computation and Language
Manacá-1B: An Open, Reproducible Brazilian-Portuguese Language Model and a Tokenizer-Aware, Paired Evaluation
Brazilian Portuguese remains under-served by open language models, and the few that exist are difficult to reproduce and are often compared without measures of uncertainty. We release Manacá-1B, an open decoder-only model of 1.72 billion parameters trained from scratch for Brazilian Portuguese with a fully containerized, reproducible pipeline. The pretraining is stable, with zero skipped or NaN steps and self-recovering loss spikes, and we release its full log and dynamics. We evaluate the model against nine open baselines on four Portuguese benchmarks under a single harness. Every comparison reports a standard error and a paired significance test, and the harness is validated against previously published numbers. On last-word prediction Manacá-1B is the strongest model below the 7B scale, exceeding both Tucano-1b1 and Tucano-2b4 on LAMBADA-PT with large paired margins; it is competitive on commonsense completion and near chance on multiple-choice reasoning, as are all small base models. Along the way we document a concrete evaluation pitfall: converting a SentencePiece tokenizer with case-folding normalization to the HuggingFace fast format silently drops the normalizer, routing every capitalized token to byte-fallback and depressing scores in a way that is invisible in aggregate metrics. The uncorrected tokenizer lowered LAMBADA-PT accuracy from 45.3 to 25.0; we quantify the effect and provide a one-line fix that reproduces the training tokenizer exactly. Code, raw training and evaluation logs, per-example prediction vectors, the model weights, and the corrected tokenizer are released so that every number in this paper can be recomputed.
Read the full abstract
Machine Learning
Supraglacial Lake Fate Is Knowable Long Before the Season Ends
A supraglacial lake on the Greenland Ice Sheet ends its melt season in one of four ways: it drains rapidly through a hydrofracture, drains slowly across the surface, refreezes in place, or is buried by late-season snowfall. Which one occurs decides whether the meltwater reaches the ice bed. Satellite classifiers recover the outcome accurately but only after the season closes, and how much of a season each outcome actually requires has never been measured. We measure it directly: holding the representation and the classifier fixed, we truncate the input at 14 cutoffs from May 1 to December 31, retrain at each, and record the earliest cutoff at which each outcome's per-class F1 reaches a fixed target. The outcomes resolve in a consistent order, two of them months early: rapid drainage by July 15 and slow drainage by August 1, respectively 92 and 75 days ahead of the earliest date a full-season pipeline can be computed at all, with buried and refreeze following at 44 and 30 days. Five further learners, from a majority-class floor and 54 summary statistics to a trigger-based early classifier, leave the ordering largely intact: the three that produce a per-class trajectory reproduce it in five of six cases despite end-of-season accuracies differing by up to 18 percentage points, and it survives leave-one-basin-out evaluation, though not a move to machine-labeled lakes in an unseen season. Every feature we compute at day t reads only days up to t, at a cost of at most 1.3 percentage points. A monitoring system should therefore not have one release date: rapid drainage can be flagged on July 15, three months before a full-season pipeline can be computed at all.
Read the full abstract
Cryptography and Security
Drishti: AI-Led Human-Directed Vulnerability Auditing for 5G Cores
Candidate generation for open-source vulnerabilities is no longer scarce. AI-assisted code review now produces defect candidates cheaply, and industry programs pair them with expert human triage. The remaining scarcity is validation and impact assessment, and the gap is largest in critical-infrastructure software like 5G cores. Here, validation has four costs: verification, reachability, impact, and fix-completeness. We present Drishti, an AI-led human-directed vulnerability audit framework with four components, one per cost: (i) an anti-pattern catalog for verification, (ii) critical-path triage for reachability, (iii) concentric validation for impact, and (iv) patch-review for fix-completeness. Across audits of Open5GS and free5GC, Drishti produced three findings. The first is a pre-authentication NULL-dereference in the Open5GS NRF multipart parser, fixed upstream with a CVE requested. The second is an ASN.1-PER memory amplification in the free5GC NGAP decoder. A 2-byte input from a rogue gNodeB OOM-kills the AMF in 6.2 seconds. The third is a defective patch on CVE-2025-69248 whose defense-in-depth check is dead code before authentication.
Read the full abstract
Game Theory
Learning Proportional Committees from Violation Feedback
We study violation-feedback learning of proportionally representative approval-based committees. In each round, a learner proposes a committee of size $k$. An oracle either accepts the proposal or adversarially selects a representation violation with respect to a single fixed hidden approval profile. We compare full-witness feedback, which reveals the violation level, an omitted candidate, and the affected voter group, with candidate-only feedback, which reveals only that candidate. The target notions are proportional justified representation plus (PJR+) and extended justified representation plus (EJR+). In every setting we study, the number of rejected proposals can be bounded solely in terms of $k$, with no dependence on the numbers of voters and candidates. For PJR+, the optimal deterministic and randomized rejection complexities equal $k$ under both feedback models. For EJR+, the picture is more nuanced. Under full-witness feedback, we prove an $\Omega(k^{3/2})$ deterministic lower bound and give a deterministic polynomial-time algorithm using $O(k^2\log k)$ rejections. Under candidate-only feedback, randomization achieves $O(k^2\log k)$ expected rejections via uniform random deletion, while deterministic exhaustive branching gives a $2^{O(k^2(\log k)^2)}$ rejection bound. Even with full-witness feedback, randomized learners may require $k$ rejections.
Read the full abstract
Computation and Language
Can LLMs Take the Pulse of the Economy? A Real-Time Evaluation of LLM Nowcasts on Macroeconomic Indicators
Nowcasting headline macroeconomic indicators, i.e., estimating an indicator's value for the current reference period before its official release, is critical for monetary policy and financial markets, and central banks devote dedicated teams of expert economists to producing such estimates. Large language model (LLM) agents are a promising candidate for this task, combining broad world knowledge with real-time web search and supporting queries at higher frequency than institutional nowcasts. Evaluating their nowcasting capability is, however, challenging: headline indicators such as GDP and CPI are widely reported and likely memorized during pretraining, so any evaluation on historical releases is vulnerable to data contamination. To address this, we introduce LiveMacroEval, a live, contamination-resistant benchmark in which LLM agents produce hourly nowcasts for sixteen major U.S. macroeconomic indicators over a pre-release window closing at each official release. Nowcast quality is assessed through a LiveMacro Score against announcement-window equity returns and a LiveBetting Score from simulated Polymarket-style trading, with Federal Reserve regional-bank nowcasts, the Bloomberg ECOS professional consensus, and an auto-ARIMA baseline as comparators. Over six months with four state-of-the-art LLM agents configured with web search, aggregate nowcast accuracy is broadly comparable to the institutional and professional benchmarks, with performance varying widely across individual indicators. This highlights LLM agents' potential as real-time estimators of macroeconomic conditions.
Read the full abstract
Computation and Language
COGTRL: Training LLMs for Scientific Discovery Assistance using Cognitive Traces via Reinforcement Learning
Large Language Models (LLMs) trained on extensive scientific research are increasingly integrated as assistants for scientific discovery. However, most research papers omit the fine-grained cognitive process of examining constraints, failed alternatives, and iterative decisions required to achieve the desired goal. Such cognitive processes are vital for real-world scientists working toward specific goals under constraints. In this paper, we show that LLMs, when trained to produce such cognitive traces, perform better as scientific discovery assistants than when trained solely on scientific literature. We propose COGTRL, a trajectory-level reinforcement learning framework that trains LLMs to emulate cognitively grounded reasoning by jointly optimizing cognitive traces and the scientific steps produced in an interleaved manner. Across two 3B-parameter models and two scientific domains (AI and Materials Science), COGTRL improves method quality by an average of 7.85 points over comparable 3B model baselines and achieves competitive performance relative to 70B parameter models. Moreover, analysis by domain experts shows a preference for methods generated by COGTRL over the baselines.
Read the full abstract
Human-Computer Interaction
FocusAdapt: Context-aware Adaptive Focus Assistance in Diminished Reality
Diminished Reality (DR) can reduce visual clutter by removing irrelevant objects. However, removing all task-irrelevant objects may eliminate useful contextual information and reduce situational awareness. We present FocusAdapt, a context-aware DR system that predicts object-level distraction by integrating visual saliency, semantic relevance, and gaze behavior. Based on findings from a formative study, FocusAdapt selectively diminishes highly distracting objects while preserving useful context, enabling adaptive focus assistance during procedural tasks.
Read the full abstract
Computation and Language
AtlasNLP: A Country-Aware Atlas of Dataset Representation in NLP
Understanding which countries are represented in NLP datasets is essential for identifying gaps, targeting data collection, measuring progress, and informing AI policy. However, geographic metadata is very rarely available, and country-level representation is often hidden behind broad language-level claims. We introduce AtlasNLP, a country-aware atlas of over 13,000 NLP dataset records across normalized NLP task categories, tracking both the populations represented and where datasets are produced. AtlasNLP includes AtlasNLP-Gold, a human-curated reference set, and AtlasNLP-Core, an ACL-derived large-scale collection. Using this resource, we show that (1) dataset coverage is highly uneven across countries and tasks; (2) dataset production and representation are geographically asymmetric; and (3) language coverage does not imply geographic representation. These findings reveal blind spots in current dataset documentation practices and motivate more explicit geographic metadata for country-aware NLP evaluation.
Read the full abstract
Earth and Planetary Astrophysics
Atmospheric escape fractionates secondary but not primary atmospheres
A planet's atmosphere, heated by starlight, can flow off as a wind, taking some gases and leaving others in unknown proportions. Yet this selection wrote the noble-gas records of the terrestrial planets, and decides which gases hot exoplanets keep. We solve this fractionated escape problem for arbitrary composition: a wind sorts gases only for secondary, hydrogen-poor atmospheres, and removes primary, hydrogen-rich atmospheres wholesale. The algebraic solution recovers every published formula as special cases. It provides a unified interpretation of atmospheric evolution across the Solar System and exoplanets. Fractionating argon on Mars stripped carbon while sparing krypton, Venus' retained argon constrains the wind intensity that removed its water, Earth's xenon record excludes a neutral wind. The same solution ranks the rocky exoplanets under JWST observation by the gases they can keep.
Read the full abstract
Cryptography and Security
A Simple Transformer Pipeline for Full-Key Side-Channel Attacks on Uncropped Datasets
Deep learning-based side-channel analysis has historically focused on single-byte targets and manually cropped traces, which risks discarding exploitable leakage. While recent work has proposed specialized architectures and resampling techniques to address this gap, the literature lacks a simple transformer baseline for simultaneous full-key attacks on uncropped traces. We present an open-source transformer implementation for uncropped full-key attacks which uses the standard transformer encoder backbone, adapting only the input and output layers to the side-channel setting. We release our implementation, training recipes, and pretrained weights for uncropped ASCADv1f, ASCADv1r, and CHES-CTF-2018 which achieve performance competitive with previously-reported results, while using less than 10GB of VRAM and requiring at most 3.34 hours of training on a single NVIDIA A6000.
Read the full abstract
Information Theory
Fluid Antenna Multiple Access for Noise Modulation
Noise modulation (NoiseMod) encodes information in the variance of a noise-like waveform. Its noncoherent structure enables low-complexity links, but co-channel users are challenging because interference affects the same variance statistic used for detection. We study fluid antenna multiple access (FAMA) for two-level NoiseMod with independent random bits from each interferer, producing two possible nonzero interference variances. We adopt exact finite-sample maximum-likelihood energy detection from prior NoiseMod/TNM work. We derive the exact single-port moment-generating function and moments of the random-bit aggregate interference, including heterogeneous user powers, and prove that the port minimizing conditional BEP is $\arg\max_k H_k/(\sigma_w^2+J_k)$, where $H_k$ is desired-link power and $J_k$ is instantaneous bit-state-aware interference variance. For independent fading ports, the common interferer-bit vector couples per-port decision metrics; conditioning on the number of high-state interferers yields an exact binomial-mixture order-statistic representation and avoids the generally invalid rule $F_{Z_{\max}}=F_Z^{N_p}$. For spatially correlated operation, an integer-$\mu$ $\kappa$-$\mu$ benchmark uses full pairwise Jakes correlation in scattered fields, with channel-averaged BEP evaluated by conditional Monte Carlo. A standard-error-aware load study shows increased admissible co-channel users as spatial degrees of freedom grow. Finally, a finite-sample variance-domain sensing diagnostic quantifies the oracle gap under frozen channels and interferer states, providing a lower-bound warning on fast-FAMA sensing difficulty rather than a deployable acquisition protocol.
Read the full abstract
Machine Learning
Graph4BiLO: Graph Neural Network Approximation for Bilevel Mixed-Integer Linear Optimization
Bilevel mixed-integer linear optimization problems model hierarchical decision processes in which a leader anticipates the optimal response of a follower. Although expressive, these problems are computationally challenging because lower-level optimality is embedded in the leader's feasible region. Value-function reformulations replace the nested follower optimization with a constraint involving the follower's optimal value, but evaluating this value function exactly can itself be expensive. This paper introduces Graph4BiLO, a graph neural network (GNN) approach for learning bilevel value functions from variable–constraint graph representations. In contrast to fixed-length multilayer perceptron (MLP) representations, the GNN uses shared message-passing parameters and can therefore be applied across multiple problem sizes with a single trained model. The learned ReLU network is encoded exactly as mixed-integer linear constraints and embedded in an approximate single-level formulation. A repair step subsequently re-solves the follower problem for the selected leader decision to recover a bilevel-feasible follower response. We evaluate Graph4BiLO on knapsack interdiction instances with 20–100 items against the exact MibS solver and the learning-based Neur2BiLO method. Graph4BiLO obtains objective values comparable to Neur2BiLO across all tested sizes while avoiding size-specific neural networks. An additional out-of-distribution experiment demonstrates zero-shot transfer from 20-item training instances to previously unseen 40- and 60-item instances. However, embedding message passing at every graph node substantially increases the resulting mixed-integer formulation size and solve time. These results identify a central tradeoff between size-generalizable graph representations and the computational cost of embedding GNNs within optimization models.
Read the full abstract
Machine Learning
SMOTE-VAR: An Uncertainty-Aware Oversampling Method for Predicting Depression Remission in University Students
University students experience disproportionately high rates of common mental health conditions, such as depression, which can impair learning, social functioning, and overall well-being. Although lifestyle interventions such as mindfulness and physical activity can reduce the symptoms, many do not achieve symptomatic remission. Developing new approaches to identify students with poor outcomes could enable earlier and more targeted intervention. Machine learning (ML) methods have increasingly been used to predict remission in depressive patients. However, these ML models often suffer from class imbalance, where there may be an unequal proportion of people in the remitted group relative to the non-remitted group. This imbalance can reduce model accuracy and bias predictions. To address this, studies commonly employ the popular oversampling strategy SMOTE. However, SMOTE has a notable limitation: it may generate invalid synthetic minority samples. In a clinical context, these false positives can lead to incorrect risk stratification, potentially delaying necessary escalated care for patients unlikely to remit. In this paper, we introduce a novel and effective oversampling method that addresses this shortcoming. Our approach leverages the variance function of a Gaussian process to estimate the uncertainty of generated minority samples to reduce false positives. We validate our method on a depression dataset collected from university students and demonstrate that it is better than existing oversampling approaches in predicting remission (i.e., treatment outcome). By improving the reliable identification of non-responders, our method provides a robust computational tool to help clinicians rapidly pivot to adjunctive therapies, thereby personalizing and optimizing mental health care pathways.