Peer Revenue Returns subject to peer review

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Monday 31 August

Group Theory

Quasi-isometries between graphs of totally disconnected locally compact groups

Let $G$ and $H$ be compactly generated totally disconnected locally compact (tdlc) groups that decompose as finite graphs of tdlc groups $(\mathcal{G}, \mathcal{A})$ and $(\mathcal{H}, \mathcal{B})$ such that all edge groups are compact and all vertex groups have at most one end. We generalize a result of Papasoglu–Whyte to tdlc groups and show that $G$ and $H$ are quasi-isometric if and only if they have the same number of ends and every one-ended vertex group of $(\mathcal{G}, \mathcal{A})$ is quasi-isometric to a one-ended vertex group of $(\mathcal{H}, \mathcal{B})$, and vice versa. As an application, we construct uncountably many pairwise non-quasi-isometric compactly generated non-discrete simple tdlc groups, strengthening a result by Smith.
Read the full abstract

Robotics

Zeva: In-Context Causal Learning for Generalizable Embodied Manipulation

Generalizable embodied manipulation remains difficult to achieve through pretraining alone, due to unseen physical conditions in the real world. We argue that robots need to learn from their own physical interactions on the fly during real-world deployment and use this knowledge to inform subsequent actions. We present Zeva, the first framework that enables in-context learning from a robot's own physical interaction experience while keeping the policy model frozen. Zeva employs a Causal Interaction Extractor to encode an executed action and its induced state change into a causal interaction signal, which is stored in a dual-timescale causal memory. For subsequent actions, relevant causal interaction signals are retrieved from memory and injected into the frozen policy model as context. Experiments in simulation and real-world manipulation demonstrate that Zeva achieves the best performance among the compared frontier VLAs and WAMs and, more importantly, enables self-evolution during deployment without gradient updates. Its success rate continues to improve as the robot accumulates interaction experience. Furthermore, the acquired interaction experience can generalize across tasks.
Read the full abstract

All authors Fu Chen, Xin Ding, Bingjia Huang, Xiangyu Li, Mingju Wang, Jiawei He, Kun Li, Wei Sun, Yunxin Liu, Hao Wu, Ting Cao

Group Theory

Conjugator Lengths and Isoperimetric functions

We show that for any recognizing $S$-machine $\textbf{S}$ with superadditive time function $f$, there exists a finitely presented group whose conjugator length function is quadratic and whose Dehn function grows like the square of $f$. This result is dual to that of a previous paper of the authors, which constructed a family of groups with cubic Dehn function that have various conjugator length functions. We thereby give the first known example of a finitely presented group whose conjugator length function is recursive, but whose Word and Conjugacy Problems are both undecidable. This answers an analogue of a question of Rips. Moreover, given a finitely presented group $G$ with decidable Word Problem, we obtain a finitely presented group with decidable Conjugacy Problem whose Dehn function grows faster than that of $G$. Finally, combining this result with its dual, for a wide array of pairs of functions $(f,g)$ we furnish an example of a finitely presented group with Dehn function equivalent to $f$ and conjugator length function equivalent to $g$. This shows that the two invariants are very strongly independent and making significant progress on a question of Bridson, Riley, and Sale.
Read the full abstract

Solar and Stellar Astrophysics

Extremes of solar spectral irradiance in the SORCE/XPS record

Extreme and rare changes in space mission solar irradiance records are scientifically relevant but difficult to quantify because these records are finite, instrument dependent, and affected by observational gaps and time varying measurement quality. We evaluated extreme daily logarithmic changes in the band integrated 0.1-7.0 nm irradiance measured by photodiode 7 of the Solar Radiation and Climate Experiment/X-Ray Photometer System (SORCE/XPS) from 2005 to 2019. After constructing a regular daily series by linear interpolation, we analyzed daily logarithmic changes in irradiance and fitted stationary Generalized Extreme Value models to 60 day block maxima and transformed 15 day block minima. Block lengths were selected using Ljung-Box diagnostics and sample autocorrelation functions. Maximum likelihood estimation was used as the primary inferential method, with probability weighted moments as a sensitivity check. The maximum likelihood GEV shape estimates were 0.1661 for maxima and 0.2928 for transformed minima, with closely aligned estimates under the two fitting methods. These positive point estimates are compatible with Fréchet type tails under the selected block constructions. Annualized return levels provide interpretable summaries of extreme relative increases and reductions, but estimates for long return periods remain strongly dependent on extrapolation beyond the 15 year record. Reported measurement precision and absolute uncertainty were used to qualify the interpretation of the fitted tails and were not propagated through the likelihood. By combining EVT based tail modeling with explicit consideration of measurement precision, absolute uncertainty, interpolation, and mission data gaps, the analysis provides an uncertainty aware astrostatistical baseline for extreme value inference from processed solar mission records.
Read the full abstract

All authors Enzo Brasil, Cira E. G. Otiniano, Carolyne Brito, Beatriz Albernaz, Fidel Morales

Machine Learning

Deploying DeepSeek 175B Locally on a Single Consumer-Grade RTX 4060 Laptop with 32GB RAM for 200k-Scale Protein-Ligand Virtual Screening

Recent advances in large language models (LLMs) have demonstrated exceptional performance in protein-ligand interaction prediction, but state-of-the-art pipelines for large-scale virtual screening almost exclusively rely on high-end GPU clusters with hundreds of gigabytes of memory, creating prohibitive hardware barriers for small academic teams. In this work, we present a fully local low-resource framework that deploys the 175-billion-parameter DeepSeek 175B LLM on a single consumer-grade RTX 4060 laptop equipped with 32GB system RAM and 8GB VRAM, completing a full 200k-scale protein-ligand virtual screening workflow across 20 distinct protein targets. Our implementation achieves 100x throughput of an 8-card A100 cluster baseline under identical task configurations within 72 hours, with an average binding affinity prediction error of 0.88 kcal/mol across all targets, satisfying the 1.0 kcal/mol chemical accuracy requirement for preclinical drug discovery. Systematic runtime profiling reveals that heterogeneous memory management overhead accounts for 72% of total execution time, while accuracy loss introduced by model optimization contributes less than 10% to total prediction error. This work validates the engineering feasibility of running industrial-scale trillion-parameter LLM-driven biomedical computing tasks on consumer hardware, establishing a new low-barrier paradigm for AI-powered early stage drug discovery.
Read the full abstract

Optimization and Control

Symmetry-dependence in Rounding of a Convex Body

The symmetry measure of a convex body $S\subset\mathbb{R}^n$ is given by: $\mathrm{sym}(S):=\max\{\alpha\ge0:\text{ there exists }x\in S\text{ such that }-\alpha(S-x)\subseteq S-x\}$, where such an $x$ is called a Minkowski center. We prove that every convex body $S$ admits a $\sqrt{\frac{n}{\mathrm{sym}(S)}}$-rounding of $S$, namely, there exists an origin-centered ellipsoid $E$ and a center $c$ such that $E\subseteq S-c\subseteq\sqrt{\frac{n}{\mathrm{sym}(S)}}\,E$. This result was conjectured in 2005 by Belloni and Freund. As special cases, this recovers an $n$-rounding of $S$ (since $\mathrm{sym}(S)\ge\frac{1}{n}$), and a $\sqrt{n}$-rounding when $\mathrm{sym}(S)=1$. In the case when $S$ is a polytope given as the convex hull of points, the desired rounding is produced by a regularized minimum-volume covering ellipsoid problem where the regularization is with respect to the Minkowski center. Similarly, when $S$ is a polytope given as the intersection of halfspaces, such a rounding is produced by a regularized maximum-volume inscribed ellipsoid problem. In both of these cases, the rounding can be computed by first solving a linear optimization problem (to compute $\mathrm{sym}(S)$ and a Minkowski center), and then solving a convex optimization problem with a logarithmic determinant objective, second-order cone constraints, and one semidefinite cone constraint. We also show that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is nearly tight in its dependence on dimension and symmetry. When $\frac{n+1}{1+\mathrm{sym}(S)}$ is an integer, we show by explicit construction that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is tight. In the more general case, for every dimension $n$ and every admissible symmetry value, we construct a polytope $S$ for which every rounding factor is at least $\sqrt{\frac{2}{3}}\sqrt{\frac{n}{\mathrm{sym}(S)}}$.
Read the full abstract

Algebraic Topology

A Decomposition Theorem for Topological Semi-small Maps

A continuous surjection $f: X \rightarrow Y$ is an almost covering map if there exists a nowhere dense closed set $R \subset Y$ with a finite decomposition $R = \bigsqcup_{\beta} T_{\beta}$ such that the restriction $f\vert_{f^{-1}(Y \setminus R)}$ is a covering map and, for each $\beta$, the restriction $f\vert_{f^{-1}(T_{\beta})}$ is a fiber bundle. We refer to an almost covering map as a topological semi-small map if, for each $\beta$, the fiber of $f\vert_{f^{-1}(T_\beta)}$ and the space $T_\beta$ satisfy the same dimension condition as for algebraic semi-small maps. We first study the topological properties of almost coverings and develop the necessary tools. In the next step, we restrict our attention to topological semi-small maps and prove that, under the assumption that for each $\beta$ and each trivializing neighborhood $U \subset T_{\beta}$ the connecting homomorphisms in the Gysin sequence of the normal bundle of $f^{-1}(U) \subset X$ vanish in suitable degrees, the derived direct image of the constant sheaf on the domain admits a decomposition.
Read the full abstract

Optimization and Control

Provably Safe Decentralized Contingency MPC under State-Only Information and Limited Sensing for Nonlinear Multi-agent Systems

This paper considers decentralized contingency MPC for multi-agent control under a state-only information pattern, with particular focus on limited sensing and plug-and-play operation. The objective is to retain recursive feasibility, safety, and Lyapunov-type convergence while reducing conservatism in local interaction handling. The framework relies on agent-wise fallback regions (safe sets) in which a feasible contingency maneuver to a safe equilibrium is always available. A novel safe-set update mechanism is introduced that supports less conservative decentralized interaction while preserving the underlying guarantees. This, in turn, enables memory-free local interaction and finite sensing ranges without requiring agents to reconstruct the exact neighbor geometry. The resulting scheme remains fully decentralized and preserves the shared-first-input contingency MPC structure. Theoretical guarantees and simulation results illustrate the effectiveness of the approach in dense multi-agent scenarios.
Read the full abstract

Computation and Language

Personas Differ from Native-Language Generation: Language Pathways Shape LLM Interpersonal Advice

LLMs are increasingly used for interpersonal advice and as tools for studying social behavior across languages and cultures. A common shortcut for eliciting language- or culture-related variation is to ask a model to answer as a native speaker. We test whether this native-speaker persona reproduces the outputs obtained when models instead generate advice in the target language and translate the response back into English. Using 600 interpersonal advice questions across 13 languages and eight LLMs, we compare native-language generation followed by translation (NL) with native-speaker persona prompting (NP), measuring linguistic style, behavioral scaffolding, and forced-choice action recommendations. We find that NP and NL are not interchangeable. Compared to NL, NP often increases lexical social cues, including affiliation and positive tone, while reducing qualities such as concreteness and social attunement; NP also provides less actionable scaffolding in open-ended advice. In forced-choice scenarios, NP changes which action the model selects, favoring confrontation over redirection, with effect sizes varying across languages, topics, and models. Our results show that cross-lingual elicitation strategy is a consequential methodological choice that can change both how advice is framed and which actions models recommend.
Read the full abstract

Computer Vision

SurgSkill-Bench: A Benchmark for Multimodal Surgical Skill Assessment

Objective assessment of surgical technical skill is important for surgical training and structured feedback, but current workflows remain dependent on labor-intensive expert review. Existing automated approaches primarily focus on visual inputs and provide limited support for jointly studying operative performance, structured skill scores, and evaluator feedback. We introduce SurgSkill-Bench, an initial video-score-text benchmark-style dataset containing 214 surgical training simulation videos, six-dimensional OSATS scores, and expert free-text comments. We define two evaluation settings: video-only OSATS prediction for automated assessment and post hoc expert-comment-assisted prediction, where evaluator comments are available as auxiliary information. We provide controlled baseline experiments using representative frozen visual backbones, content-adaptive key-frame sampling, and a simple video-text co-attention fusion module. Under internal video-level validation, content-adaptive sampling improves video-only performance in this dataset, while evaluator comments provide additional score-related signal in the assisted setting. The best mean AUROC reaches 0.88 under dataset-specific median dichotomization. We further discuss evaluation constraints related to dataset scale, metadata completeness, and the interpretation of comment-assisted prediction. Code will be released publicly at a later date.
Read the full abstract

All authors Chaohui Dang, Zheheng Jiang, James Glasbey, David Luke, Theodoros Arvanitis, Le Zhang

Statistical Mechanics

On the relaxation problem in statistical mechanics

We reformulate the relaxation problem in statistical mechanics by making explicit what are the operational objects subject to relaxation: the local time statistics of the recorded signal $Z(t)$. These local time statistics are simply the estimated histograms of observations $\{Z(t_i)\}_{i=1}^M$ performed at uniformly random times $\{t_i\}_{i=1}^M$ by a clockless observer. The subject of prediction is a belief about a future fresh out-of-sample reading of a measurement outcome whose distribution is inferred from the mathematical model believed to be true. For finite bounded systems of $N\ge 1$ degrees of freedom global irreversible relaxation of predictions can occur but special initial conditions exist. The form of the predictions depends on certain loss functions whose choice is up to the particular observer. Finally, entropy is given a learning interpretation as mutual information between the observer and the unknown past of the system under consideration and, in complete generality, its stationary value depends on the information available.
Read the full abstract

Computer Vision

VCAR: Training-Free 3DGS Segmentation via View Completeness and Axis-Aware Boundary Refinement

Semantic segmentation in 3D Gaussian Splatting (3DGS) is crucial for advancing 3D scene understanding. Existing methods predominantly rely on feature distillation, which incurs substantial per-scene training overhead and often yields blurred segmentation boundaries. We identify that these boundary artifacts are driven in part by insufficient viewpoint coverage and boundary overflow of anisotropic Gaussian primitives. To address these challenges, we propose VCAR, a training-free coarse-to-fine segmentation strategy based on View Completeness and Axis-aware Boundary Refinement. In the coarse stage, a visibility-based weighted multi-view voting scheme rapidly localizes the target. In the fine stage, an object-centric sphere derived from the coarse result generates supplementary viewpoints via Spherical Spiral Sampling (SSS), allowing multi-view voting on the augmented views to precisely refine object boundaries and suppress irrelevant 3D Gaussians. Moreover, we introduce Axis-aware Boundary Refinement (ABR) to mitigate artifacts from anisotropic primitives. By decomposing the projected 2D covariance into per-axis contributions, ABR identifies the dominant axis responsible for boundary leakage and applies targeted anisotropic compression exclusively along that axis. Extensive experiments on NVOS and LERF demonstrate that VCAR achieves state-of-the-art segmentation accuracy and efficiency without training. Our code is available at https://github.com/DDKK0526/VCAR.
Read the full abstract

All authors Kun Cao, Di Wang, Haibin Zhu, Haozhi Huang, Xu Wang, Zheng Shi, Guanghua Yang

Combinatorics

Exponential random graph models with soft clique constraints

Let $r\geq3$ be fixed, and let $\mathbf{G}_n$ be the set of all simple graphs with vertex set $[n]=\{1,\ldots,n\}$. We consider an exponential random graph model which gives higher probability to $G \in \mathbf{G}_n$ than to $H \in \mathbf{G}_n$ if $G$ has fewer $r$-cliques than $H$. But all graphs in $\mathbf{G}_n$ have positive probability. The degree to which graphs with fewer $r$-cliques are given higher probability is determined by a positive weight $w$. We prove that, asymptotically almost surely as $n \to \infty$, a random graph from $\mathbf{G}_n$ has a vertex partition into $r-1$ parts of roughly equal size, the density of edges between the parts is close to $1/2$, and for every $\varepsilon > 0$ the density of edges within any part is less than $\varepsilon$. The asymptotic structural properties are independent of the weight $w$ as long as it is positive. We also extend the result to the context of several clique sizes, each one with its own weight.
Read the full abstract

Chemical Physics

Frequency-resolved ultrafast electron diffraction: visualizing vibrational dynamics in frequency- and real-space

Ultrafast electron diffraction (UED) provides direct information on changes in molecular structure following photoexcitation, but identifying the individual vibrational motions contributing to these dynamics remains challenging. Here, we introduce frequency-resolved UED, where Fourier transformation of the time-dependent difference pair distribution function ($\Delta$PDF) gives a two-dimensional frequency-distance representation of the structural dynamics. We apply this approach to allene and 1,2-butadiene following photoexcitation to the $S_1(\pi\pi^*)$ state at 200 nm, using electron scattering signals simulated from previously-published ab initio multiple spawning trajectories (S. P. Neville et al., J. Chem. Phys., 2016, 144, 014305). We identify C=C stretching and CCC bending motions and the internuclear distances over which they contribute, and separate overlapping CH$_2$ vibrational motions. By changing the pump-probe delay range used for the Fourier transform, we identify when specific frequency components contribute during the excited-state dynamics. Methyl substitution reduces the C=C stretching and CCC bending frequencies and introduces an additional frequency component in 1,2-butadiene during the first 90 fs. We further show the importance of sub-20-fs, and ultimately few-femtosecond, temporal resolution for retrieving these frequency components. Frequency-resolved UED therefore provides the vibrational frequencies, internuclear distances, and reaction times associated with photoinduced structural dynamics.
Read the full abstract

All authors Rosalie Tabarie, Simon P. Neville, Michael Schuurman, Kasra Amini

Computational Finance

Neural Calibration of a Complete Market Model

We propose a neural calibration method to construct a recombining binomial tree directly from a set of given option prices. Rather than estimating a continuous option pricing function or a local volatility surface as an intermediate object, a neural network is used to deform a benchmark lattice. This leads to a discrete pricing model which is guaranteed to be arbitrage-free, complete, easy to interpret, and can be used directly for pricing and to find replicating trading strategies. Calibration is formulated as a penalized optimization problem that combines a repricing error with an admissibility penalty, and an optional spatial regularization term based on implied local volatilities. Numerical experiments on synthetic and SPX market data show that the proposed approach yields accurate repricing and is very competitive when compared to recently proposed other neural calibration methods. It preserves the computational advantages of lattice-based valuation and hedging. In particular, the calibrated tree can be reused to price contracts that allow early exercise, and could even be calibrated directly with American option prices.
Read the full abstract

Computation and Language

Beyond Good Intentions: When Does the Framing of Multilingual and Low-Resource NLP Research Become a Caricature?

Building language technologies and conducting NLP research for low-resource languages—particularly when led by native speakers or involving participatory research practices—are often framed as means of addressing inequality, serving local communities, and, at times, contributing to *decolonisation*. In this paper, we examine recently published NLP and ML papers, focusing on the narratives used to characterise multilinguality, low-resource languages, and underrepresented cultures. We propose a framework for analysing research framings and identify recurring rhetorical patterns that may hinder accountability and constrain equitable knowledge production for—and by—underserved communities. We further assess the evidential basis of assertions regarding community benefit and find that such statements are often weakly supported or left unsubstantiated. Although community ownership and participation are frequently presented as key objectives, our analysis, supported by statistics from the ACL Anthology, suggests that research outputs more often prioritise resource creation and benchmarking—important but distinct goals—over evidence of broader structural change. We conclude by offering practical recommendations to help authors, reviewers, and readers critically assess these assertions and avoid potentially misleading framings.
Read the full abstract

Artificial Intelligence

Predicting Residential Rents in Dakar Using Machine Learning

Dakar's residential rental market remains poorly documented despite its economic and social importance: 54.4% of households are renters, compared to 23.3% nationally. This study develops a complete machine learning pipeline to predict residential rents in Dakar, from data collection to model interpretation. An original dataset of 1,507 rental listings was built through systematic web scraping and a documented cleaning pipeline, then enriched with four purpose-built features, including a luxury score and a keyword-based quality score. Five models were compared: linear regression, Random Forest (baseline), XGBoost, and LightGBM optimized through Bayesian optimization with Optuna, using leakage-free KFold target encoding for location. The optimized XGBoost model achieved the best performance with an $R^2$ of 0.847, an MAE of 210,902 XOF, and an RMSE of 324,195 XOF. Feature importance was assessed using native XGBoost gain and SHAP values, revealing a substantial difference in the ranking of location, which appears as a minor predictor by gain but as the second most influential variable by SHAP. This result carries methodological implications for hedonic studies using target-encoded categorical variables. This study provides an interpretable benchmark for Dakar's rental market and highlights several avenues for improvement, including the integration of geospatial features and conformal prediction.
Read the full abstract

Signal Processing

Measurement of Liquid Water Content in Snow from Density-Insensitive Microwave Attenuation

A measurement principle for determining liquid water content (LWC) in snow is presented that does not require a priori knowledge or separate measurement of snow density. LWC affects the imaginary part of the effective permittivity of snow, which is linked to microwave attenuation along a microstrip transmission line embedded in the snowpack, independent of snow density. By analyzing the attenuation over a range of microwave frequencies, the corresponding LWC can be inferred. Full-wave simulations indicate a sensitivity of approximately 2 dB per % LWC,while experimental results confirm the insensitivity to snow density, highlighting the potential for remote snow characterization.
Read the full abstract

All authors Marco Niederberger, Sebastian Droz, Shaarujan Kamalanathan, Michel A. Nyffenegger, Albert Loichinger, Hans-Dieter Lang

Soft Condensed Matter

Self-Diffusion of Water through Thermally Activated Membranes

Diffusion processes involving membranes are of fundamental importance in both science and technology, since membranes serve as selective interfaces that regulate the transport of mass, charge, and information across multiple length and time scales. In this study, we employ molecular dynamics (MD) simulations to calculate the self-diffusion coefficient, tetrahedral order parameter and hydrogen-bond (HB) lifetime of SPC/E water over a wide high-temperature range in the presence of thermally activated membranes (TAMs). These membranes exhibit thermally controlled stochastic behavior that locally influences particle dynamics by probabilistically inducing elastic scattering events as particles traverse the membrane. The stochastic behavior of the membranes is governed by a sigmoidal profile, which depend on the reduced temperature of the system. The effective activation energy for diffusion is estimated for several membrane configurations. It is found that the diffusion coefficients generally decrease with an increase in the number of membranes and are in reasonable agreement with the Arrhenius approximation at high temperatures. Additionally, both the tetrahedral order parameter and the HB lifetime are only locally sensitive to the action of the membranes.
Read the full abstract

Game Theory

Bidding Games with Rewards: Taming Infinite Configuration Space

Bidding games are graph games in which a token is placed on a vertex, each player starts with an initial budget, and a simultaneous auction determines which player moves the token; the players' budgets are then updated accordingly. Motivated by scenarios such as resource-allocation systems in which agents receive periodic rewards (e.g., credits, energy) while competing for control, we introduce and study bidding games with rewards, in which, at each vertex, players may receive additional budget, incentivizing desired behaviors. We focus on reachability discrete poorman bidding games with rewards (DPBGr). The main challenge when compared to discrete bidding games without rewards is that the configuration graph is infinite. To this end we introduce a novel technique to eliminate plays with suboptimal infixes. This enables focusing on a finite part of the infinite configuration graph in order to solve the game via approximation to continuous bidding games with overall complexity in EXP. Finally, we discuss a new type of strategy, usable on a subclass of DPBGr, which guarantee a winning strategy for the reachability player. Membership in this subclass is shown to be in NP.
Read the full abstract

Geophysics

Is Seismic Forecasting Possible with Physics-based AI?

Slow slip events within subduction zones offer a unique window into earthquake prediction. The subducting plate drives dehydration reactions in the fault, causing cyclical slip and observable surface displacements. Earthquake footprints can then be identified in these displacement series through coupling the multi-physics governing the subduction process with regional seismic activity. However, data noise and traditional filtering methods obscure the underlying mechanisms. Here, we alleviate this constraint with our physics-based attractor. By accounting for the physics of subduction paired with AI-assisted manifold detection, we are able to predict an earthquake in New Zealand's Hikurangi trench one week early. Additionally, predictability limits extend to 5-6 weeks with decadal repeatability, pointing to the fundamental determinism of the suggested mechanism through which physics-based seismic forecasting is possible.
Read the full abstract

Quantum Physics

Well-conditioned iterative methods for large open quantum systems

Markovian open quantum systems are well modeled by the Lindblad Master Equation (ME) $\frac{\mathrm{d}}{\mathrm{d} t} \rho_t = \mathcal{L} \rho_t$, where $\mathcal{L}$ is a linear (super-)operator and $\rho_t$ is the system state, a positive matrix. When designing or characterizing a quantum system, one is usually interested in the steady state $\rho_\infty$ (such that $\mathcal{L} \rho_\infty = 0$), the first few excited states, and trajectories $t\mapsto \rho_t$. In finite dimension, $\rho_t$ is an $n\times n$ matrix, $\mathcal{L}$ thus typically costs $n^4$ to store explicitly as a dense matrix, and $O(n^6)$ to diagonalize or invert exactly, making standard linear algebraic techniques expensive for large systems. However, $\mathcal{L}$ usually costs only $O(n^3)$ to apply. This makes iterative methods appealing, but they do not work without a good preconditioner. In this article, our main observation is that a part of the Lindblad equation, corresponding to the so-called no-jump evolution $\mathcal{S}$, can be inverted efficiently. Using this inverse map, we introduce an auxiliary completely positive trace-preserving (CPTP) map $\Phi$ whose fixed point is directly related to $\rho_\infty$, all the other eigenvalues having smaller magnitude. The map $\Phi$ is thus well suited to iterative methods, and $\rho_\infty$ can be found in a few Arnoldi iterations. Using the same inverse map $\mathcal{S}^{-1}$ as preconditioner, we compute the low-lying spectrum efficiently via shift-invert Arnoldi, and, as a proof of concept, build an implicit time integrator that is competitive on stiff systems in the low-precision regime. For the steady-state and low excited states problems, our methods scale like $O(n^3)$ per iteration and offer state-of-the-art performance on CPU and GPU.
Read the full abstract

All authors Gaspard Beugnot, Paul Gregory, Rémi Robin, Antoine Tilloy

Analysis of PDEs

Conservation Laws with Discontinuous Flux: A First Application to Traffic Flow

This work provides a traffic flow interpretation of the model recently introduced in \cite{ABS2025}. We adapt the conservation law with discontinuous gradient-dependent flux to a macroscopic traffic setting, assuming concave flux functions $f(u)$ and $g(u)$ defined on the density domain $[0,u_{\max}]$. To prevent violations of the maximal density constraint, we introduce modified Riemann Solvers tailored to this setting and generalize the existence theory for weak solutions developed in \cite{ABS2025}. Finally, we construct Riemann Solvers for a broader two-phase model incorporating a free-flow regime, in which $f(u)=g(u)$ on a subset of $[0,u_{\max}]$, and establish existence of weak solutions in this more general framework.
Read the full abstract

Robotics

GAFT: Geo-Anchored Fine-Tuning for Hazard Identification from Rare Failures

Off-road navigation can fail when physical structures induce irrecoverable states such as high-centering or entrapment, requiring human interventions. Identifying these structures is crucial, yet challenging. Such failure events are rare and costly to collect, resulting in limited training data. Moreover, the collected data associate frames with outcomes, but do not indicate the visual cues responsible for the failure. Learning directly from these data can therefore exploit scenario-specific visual cues, leading to poor generalization. We propose Geo-Anchored Fine-Tuning (GAFT), a parameter-efficient method that adapts a vision foundation model with a geometry-derived prior. It guides LoRA adaptation by aligning a spatial attention-rollout map with the geometry prior, while preserving pretrained representations. On an intervention-verified forest hazard benchmark, across ten independently trained adaptations, GAFT consistently outperforms frozen DINOv2 and supervised PEFT baselines, improving the repeated leave-one-scenario-out mean $F_2$ from 0.0607 to 0.3757 with statistical significance under paired analysis. Within these independently trained models, the best-performing GAFT model achieves a repeated-LOSO $F_2$ of 0.570. Code and benchmark: https://github.com/Xu-Yanran/geo_anchored_fine_tuning
Read the full abstract

All authors Yanran Xu, Chuanhang Qiu, Yue Wang, Wenbo Wu, Zhaoxing Li

Computer Vision

TAMI: Temporally Aligned, Missingness-Aware, and Interpretable Multimodal Fusion for Mental Health Assessment in Older Adults with Mild Cognitive Impairment

Depression and anxiety in older adults with Mild Cognitive Impairment (MCI) are frequently underdiagnosed due to limited access to care. Multimodal analysis of remote clinical interviews is a scalable screening approach, but existing methods have three limitations. First, they do not correct temporal misalignment across multimodal features extracted at different resolutions, inducing spurious cross-modal associations. Second, remote recordings exhibit uneven modality dropout, but missing values are often zero-filled, making them indistinguishable from valid near-zero measurements. Finally, they do not jointly attribute predictions to modalities, questions, and interview moments, limiting fine-grained clinical interpretation. We propose a Temporally-Aligned, Missingness-Aware, Interpretable (TAMI) multimodal fusion framework. TAMI aligns speech, language, facial, and physiological features within question-answer segments on a shared timeline, encodes modality-level missingness over time, and conditions fusion on question context. In interviews with 49 older adults with MCI, TAMI achieved area under the receiver operating characteristic curve (AUROC) scores of 0.68 (depression) and 0.69 (anxiety). Fine-grained temporal alignment of multimodal features produced the largest performance gain ($\Delta{\geq}0.1$). Multi-level interpretability analysis revealed that depression classification relied on eyegaze and open-ended questions, while anxiety classification depended on eyegaze and head pose, with attribution uniformly distributed across questions. Using only responses to the open-ended questions (5.1min), the depression model achieved an AUROC score of 0.67, which was not significantly different from using the full interview (19min) ($p>0.05$). Our findings support designing interview protocols centered on open-ended questions for depression screening in older adults with MCI.
Read the full abstract

All authors Merna Bibars, Bolaji Omofojoye, Allan I. Levey, Rachel Hershenberg, Gari D. Clifford, Hyeokhyen Kwon

Computation and Language

You Shouldn't Have Asked: A Pragmatics-Inspired Taxonomy for Evaluating LLM Refusals

Refusals are often treated as face-threatening acts in pragmatics because they can challenge the requester's socially claimed self-image. Large language models (LLMs) are increasingly trained to refuse unsafe and inappropriate requests, and these refusals may harm users when models fail to manage this interactional cost properly. While existing work has mainly approached LLM non-compliance as a safety-alignment outcome, it does not provide a way to evaluate whether LLMs refuse appropriately across different harmful contexts. To study this question, we propose (to our knowledge) the first taxonomy of LLM refusals that is grounded in pragmatic theory. Applying this taxonomy to responses from 16 modern LLMs across 14 harm categories, we find that although models differ in how they refuse, their refusals are overall explicit and strongly morally evaluative, with interactional repair occurring mainly through offering or providing safer alternatives instead of interpersonal facework. This pattern is especially consequential in sensitive harm contexts, where overuse of negative framing may make users feel shamed or provoked, undermining the purpose of safe non-compliance. We therefore call for alignment evaluation that considers not only whether models refuse harmful requests, but also whether they refuse in ways that are contextually adaptive and socially accountable for the interactional consequences of saying no.
Read the full abstract

All authors Ruoxuan Li, Pinqiao Wang, Sheng Li, Cameron Robert Jones

Algebraic Geometry

Degenerations of elliptic quartics and K-moduli of Fano threefolds

We study the K-moduli space of Fano threefolds obtained by first blowing up $\mathbb{P}^3$ along an elliptic quartic curve $C$ and then blowing up a fiber $\ell_p$ of the exceptional divisor $E \to C$. We prove that this K-moduli space is isomorphic to a VGIT quotient parametrizing pairs $(C,p)$, with linearization induced by the CM line bundle. In particular, we classify all K-(semi/poly)stable members of this deformation family. The main new ingredients in the proof include the geometry of the Hilbert scheme of elliptic quartic curves, deformation theory of Fano–K3 pairs, and optimal bounds on the local volumes of threefold singularities.
Read the full abstract

All authors Ivan Cheltsov, Anne-Sophie Kaloghiros, Robert Śmiech, Junyan Zhao

Sound

Playability-Aware Audio-to-Tablature Guitar Transcription via Diffusion Models

Guitar tablature transcription requires not only accurate pitch detection but also assigning each note to a specific string-fret position, as the same pitch can be played at multiple fretboard positions. Existing approaches treat this as a standard classification problem, ignoring the musical and physical constraints that govern playable fingering sequences. We propose Noise2Fret, a diffusion model for audio-to-tablature transcription that generates tablature through a continuous latent representation of discrete fret and string targets, conditioned on spectral and audio features. To bridge the gap between pitch accuracy and physical playability, we introduce five auxiliary losses encoding Pitch-Class Distance, Positional Distance, Circle-of-Fifths Distance, String Similarity, and Hand-Span Feasibility directly into the training objective. Experiments on GuitarSet and GOAT datasets demonstrate that the model outperforms baselines while remaining computationally more efficient, and that the auxiliary losses yield consistent gains over the standard training objective.
Read the full abstract

Computation and Language

Linguistic Distance Segregates Latent Representations in Automatic Speech Recognition Systems

While automatic speech recognition (ASR) models have achieved remarkable improvements in recent years, performance disparities persist across different speaker populations. One such disparity is for speakers whose first languages (L1) are from families distant from English. This paper investigates the relationship between first language background and English ASR performance. Through empirical analysis, we observe that the correlation between speakers' L1 distance and ASR error rates yields a systematic effect on English Speech, with its strength varying across datasets and models. This association is statistically significant in a follow-up analysis accounting for dataset-level variation in Tweedie mixed-effects models ($p<0.001$ across evaluated models). In addition, analysis of the latent space reveals a L1-based spatial segregation across deeper acoustic layers in the majority of evaluated architectures
Read the full abstract

High Energy Physics (Theory)

Holographic subregion complexity in insulator/superconductor transition

We study holographic subregion complexity (HSC) across a fully backreacted insulator/superconductor transition in an AdS-soliton background and compare it with holographic entanglement entropy (HEE) and holographic complexity based on the complexity=volume (CV) proposal. Both HSC and HEE signal the second-order transition. For a strip subsystem, competing connected and disconnected Ryu-Takayanagi surfaces give rise to a confinement/deconfinement transition. At fixed chemical potential in the superconducting phase, HSC exhibits a finite jump at the critical width, whereas HEE remains continuous. Beyond this width, HSC grows linearly with the strip width, while HEE is constant. At fixed strip width, HSC first decreases and then increases with chemical potential for $\ell<\ell_c$, opposite to HEE, but increases monotonically for $\ell>\ell_c$. After consistent normalization and subtraction of the respective insulating references, the half-space HSC and CV complexity densities are analytically identical. These results show that HSC can diagnose the insulator/superconductor transition, but its qualitative response remains sensitive to the subsystem scale and entanglement-wedge topology.
Read the full abstract

All authors Yu Shi, Chikun Ding, Yuebing Zhou, Weike Deng, Sheng Long