Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Sunday 13 September

Risk Management

Towards foundation models for insurance risk modelling

Claim narratives, images and sensor data contain information about insured risks that is difficult to use through existing actuarial models. Foundation models learn patterns from large datasets before being adapted to particular tasks. By turning these high-dimensional sources into variables or numerical representations, they could help insurers use more of the information they already collect, potentially reducing the experience needed to develop each application. For example, a language model could identify a worsening injury in a new claim note, allowing a reserving model to recognise the change in expected cost before the payments reveal the deterioration. In this paper, we review language, vision, geospatial, time series, tabular and scientific models, explaining existing insurance applications and potential future uses. Scientific models extend this approach to future weather and climate conditions: their simulations can inform loss estimates once local hazards are linked to asset damage, repair costs and insurance coverage. We propose a process to connect these model outputs to actuarial calculations and to assess their predictive contribution, stability and compliance with rules on information use. Evaluating these applications is difficult when final claim costs become known only after long delays, large losses are rare or patterns learned elsewhere fail to transfer to the target portfolio. Richer data can reveal private information and support finer risk classification, which can change access to insurance. Reusing the same models across insurers also creates dependence on shared predictions and providers.
Read the full abstract

Information Retrieval

The Wisdom of the Loudest: A Large-Scale Audit of Generative Search on Reddit

Online communities are valued not only for answers, but for the diversity of experiences and perspectives they contain. Generative search increasingly mediates access to this discourse, yet little is known about which community voices survive retrieval and synthesis. We audit Reddit Answers using 10,000 queries from 20 advice- and support-seeking communities, repeated three times to produce 30,000 answers over 14.68M comments. We find that differences across runs are driven primarily by retrieval, answers routinely combine evidence across communities, and selection strongly favors already-visible, top-level comments. Formal and directive language is more likely to be surfaced, while experiential voice is less likely to survive selection and is further weakened during synthesis, with first-person singular language declining sharply. These findings show that community-grounded generative search is not neutral summarization, and should be designed not only for relevance and fluency, but also for provenance, plurality, and legibility.
Read the full abstract

Astrophysics of Galaxies

PRISMS. GHZ1. A standard tale of galaxy evolution with atypical ionizing conditions at $z=9.878$

[Abridged] The first operating years of the James Webb Space Telescope (JWST) have revealed a surprising number of $z \gtrsim 10$ UV-bright objects, many of them characterized by their compactness, anomalous chemical abundance patterns and complex ISM physics (e.g. N-enhanced systems). To assess whether these objects are a phase of early galaxy evolution or a peculiar population, it is essential to understand the physics of systems without anomalous abundance patterns in this epoch. We present a detailed analysis of GHZ1 ($z=9.878$), a moderately ($\mu = 1.715$) lensed UV-bright ($M_{UV} = -20.07$) galaxy in the Abell2744 field, characterized by an extended size ($R_{e} \sim 410$ pc). These properties, which contrast with the properties of many of the N-enhanced galaxies, make GHZ1 an excellent laboratory to assess what are the major drivers of early galaxy evolution and the origin of the differences. By means of JWST spectroscopic observations from NIRSpec (PRISM-CLEAR configuration) and the MIR/LRS, we analyzed the full UV and optical emission from GHZ1. We used a spectro-photometric SED fitting to characterize the stellar evolution and the emission line spectra to constrain its chemical enrichment. We find that GHZ1 is among the most massive systems at $z\sim 10$ (log(M$_{\star}$ [M$_{\odot}$]) = 9.17$_{-0.26}^{+0.27}$), with a moderate amount of dust attenuation ($A_{V} = 0.21_{-0.12}^{+0.12}$~mag) and ongoing star formation (with a median SFR $= 8.75_{-1.72}^{+1.71}$ M$_{\odot}\cdot$yr$^{-1}$ over the last 10 Myr). Its chemical enrichment patterns (12+log(O/H) = $7.81_{-0.11}^{+0.12}$, log(C/O) = $-0.66_{-0.13}^{+0.13}$, log(N/O)$< -1.04$) are consistent with a standard evolution dominated by primary production from massive stars. We also derive an H$\alpha$/H$\beta$ Balmer ratio below Case B predictions. We speculate that [...].
Read the full abstract

All authors Borja Pérez-Díaz, Marco Castellano, Javier Álvarez-Márquez, Luis Colina, Lorenzo Napolitano, Sarah Kendrew, Alejandro Crespo Gómez, Stefano Carniani, Shouyi Wang, Fan Zou, Abdurro'uf, Arjan Bik, Karina Caputi, Román Fernández-Aranda, Adriano Fontana, Yoshinobu Fudamoto, Macarena García-Marín, Mahmoud Hamed, Yuichi Harikane, Takuya Hashimoto, Jakob M. Helton, Tiger Y.-Y. Hsiao, Danial Langeroodi, Ruqiu Lin, Rui Marques-Chaves, Göran Östlin, Pablo G. Pérez-González, Enrico Piconcelli, Carlota Prieto-Jiménez, Pierluigi Rinaldi, Guido Roberts-Borsani, Bruno Rodríguez del Pino, Paola Santini, Tommaso Treu, Ana Varo-O'Ferrall, Jorge Zavala

Analysis of PDEs

A free boundary problem for spreading of an invasive species in the territory of a native competitor under shifting climate

In this paper we consider a free boundary problem for the spreading of an invasive species in the habitat of a native competitor. We assume that the invasive species benefits from a climate shift that turns the environment from unfavorable to favorable at a constant speed $c$. We show that if the invasive species is an inferior one, then it must vanish, while the native competitor always persists. However, if the invasive species is a superior one, then a dichotomy occurs: either the invasive species vanishes and the native one persists, or the invasive one spreads and the native one vanishes. We also show that in the latter case the asymptotic spreading speed equals $\min\{c, c_0\}$, where $c_0$ is the spreading speed in the corresponding homogeneous environment. Numerical simulations are provided to illustrate our theoretical results.
Read the full abstract

Computers and Society

AlgoRAG: Retrieval-Augmented Generation for Theoretical Computer Science Education – A Comprehensive Evaluation Framework for Algorithm Analysis and Complexity Theory

Teaching abstract theoretical computer science (TCS) concepts such as algorithm analysis and complexity theory is challenging because students must handle formal proofs and asymptotic reasoning that conventional resources rarely explain in an adaptive, on-demand way. We present AlgoRAG, a specialized Retrieval-Augmented Generation (RAG) system that couples a large language model (LLM) with a curated, domain-specific knowledge base to address these challenges. The knowledge base integrates authoritative textbooks, 847 lecture slides, 312 practice problems with solutions, 156 worked proof templates, and 89 complexity worksheets. AlgoRAG incorporates domain-specific optimizations including mathematical entity recognition, notation-aware retrieval, and pedagogical re-ranking. We evaluate AlgoRAG on 179 curated exam-style questions spanning asymptotic analysis, recurrence relations, dynamic programming, graph algorithms, NP-completeness, sorting, and divide-and-conquer. The system achieves a 100% success rate with a mean response time of 38.0 seconds. While BLEU-4 scores are zero – a known limitation of n-gram matching on mathematical proofs where equivalent reasoning may use entirely different notation – AlgoRAG attains ROUGE-1 F1 of 0.0963, ROUGE-L F1 of 0.0683, and a pedagogical quality score of 0.7620, indicating that responses are well-structured and didactically sound even when surface wording diverges from reference answers. Performance is especially strong on NP-completeness (ROUGE-1 F1 = 0.1285, pedagogical quality = 0.7643) and graph algorithms (ROUGE-1 F1 = 0.1023, pedagogical quality = 0.8086). These results support the conclusion that RAG is an effective architecture for personalized theoretical-CS instruction, providing correct, context-rich explanations even for highly abstract topics.
Read the full abstract

Computation and Language

Domain-specific Pretraining Profile and Transformer Performance: Evidence from Modeling Digital Pragmatics in Arabic-English Code-switching

This study highlights the role of domain-specific pretraining profile (DSPP) in Transformer performance for modeling digital pragmatics in Arabic-English code-switched discourse. It evaluates MARBERT and XLM-R(oBERTa), with BERT serving as a general-purpose baseline. The models were evaluated on their ability to classify context-sensitive pragmatic functions in code-switched social-media discourse. 11695 unique X posts were collected via Python and utilized for the study. The study employs a quantitative and qualitative NLP approach, following a supervised pipeline. Findings unveil that MARBERT consistently surpasses XLM-R with validation Macro F1 increasing from 0.39 to 0.84 and validation loss decreasing from 0.55 to 0.19. On an independent test set, it achieved 0.96 accuracy, 0.83 macro precision, 0.87 macro recall, and 0.85 Macro F1, while XLM-R achieved 0.92 test accuracy but a substantially lower Macro F1 of 0.52. This was also supported by class-level performance where MARBERT outperforms XLM-R considerably with F1 improvements ranging from +0.33 to +0.60, demonstrating a clear advantage in modeling Arabic digital pragmatics. The study concludes that Transformer performance depends more on DSPP than multilingual coverage alone, as the latter does not guarantee optimal performance on a highly specialized pragmatic classification task.
Read the full abstract

All authors Fahad Al Hussen, King Saud University, Riyadh, Saudi Arabia, Mohammed Q. Shormani, Ibb University, Ibb, Yemen

Computation and Language

Disentangling Topology and Diversity in Multi-Agent LLMs for Multilingual Low-Resource Emotion Detection

Multi-agent LLM systems combine multiple inference calls, but prior work often confounds how calls are connected with how they are diversified. We study these factors independently: inference topology and source of inter-agent diversity. In a controlled $2 \times 3$ matrix, we cross parallel aggregation and sequential refinement with stochastic sampling, role prompting, and learned QLoRA specialization, under a fixed three-call budget and output protocol within each backbone. Using Qwen2.5-14B-Instruct and Llama-3.1-8B-Instruct, we evaluate all six configurations on multilingual low-resource emotion detection across nine languages. Parallel learned specialization is strongest on Qwen at 52.83 Macro-F1 and reaches 52.94 on Llama. On Qwen it also exceeds same-backbone zero-shot, few-shot, CoT, and seven-call self-consistency baselines. The preferred topology depends on diversity source: sequential refinement helps stochastic and prompted settings, while the learned Width advantage shrinks from 2.83 points on Qwen to 0.17 on Llama. Depth-wise analysis suggests that later learned specialists can overwrite correct early predictions, although the aggregate effect is backbone-dependent. Overall, how agents are differentiated produces larger performance shifts than topology, which should be evaluated jointly with specialization.
Read the full abstract

All authors Ulugbek Shernazarov, Charitha Ruwansiri Weerakon Basnayake, Abdelkhaleq El Jarjini, Noel Crespi, Praboda Rajapaksha

Machine Learning (Statistics)

Evaluation of optimisation and Bayesian inference methods for reaction rates in atmospheric chemical mechanisms

Constraining reaction rate coefficients is a central challenge in the development of explicit atmospheric chemical mechanisms, particularly for autoxidation systems where many reaction pathways are only indirectly observed through high-resolution mass spectrometry. In this study, we evaluate rate-coefficient optimisation methods for a toy-case autoxidation mechanism using synthetic data with known ground truth. Two complementary approaches are compared: ODE-constrained neural-network optimisation, which provides efficient point estimates of uncertain rate coefficients, and the Markov Chain Monte Carlo (MCMC) approach, which samples the posterior distribution of rate coefficients and quantifies parameter uncertainty. The methods are tested using direct concentration observations and mass-spectral observations under different noise levels. For unperturbed and low-noise synthetic observations, both methods converged towards the known rate coefficients, with the neural-network optimiser providing faster point estimates. Under high-noise conditions (with the signal-to-noise ratio approximately S / N = 1), however, MCMC was substantially more robust in recovering the rate coefficients. The posterior analysis shows that mass-spectral aggregation broadens credible intervals even at low noise, and that high-noise mass spectra can leave many individual reaction rates weakly identifiable. Posterior predictive validation nevertheless shows how broad parameter uncertainty constrained by MCMC remains consistent with accurate reproduction of the observable mass spectrum. These results demonstrate that point-estimation and Bayesian sampling methods provide complementary information: neural-network optimisation is effective for informative data, whereas MCMC is essential for diagnosing uncertainty, non-uniqueness, and identifiability in noisy or aggregated inverse problems.
Read the full abstract

All authors Valery Ashu, Wenqing Peng, Zhi-Song Liu, Heikki Haario, Andreas Rupp, Taiwo Ashu, Petri Clusius, Lukas Pichelstorfer, Zihao Fu, Michael Boy

Analysis of PDEs

Ground States of Nonlinear Fermionic Systems: From Power-Law Interactions to Logarithmic Sobolev Inequality

We consider ground states of a two-component logarithmic fermionic system in $\mathbb{R}^d$, where $d\ge 1$ is arbitrary. We prove that up to translations and scalings, ground states of the logarithmic system are the $L^\infty $-limits of ground states for a two-component $2p-1$ power-law fermionic system as $p\searrow 1$. As a byproduct, we also establish a sharp logarithmic Sobolev inequality for orthonormal functions in \(\mathbb{R}^d\), whose optimizers are, up to scalings, the minimizers of a constraint variational problem associated with the logarithmic system.
Read the full abstract

All authors Bin Chen, Yujin Guo, Yong Luo, Zhenya Yan

Robotics

Learning Multi-Agent Task Assignment and Navigation in the Factory: from Simulation to Real Robots

Reinforcement learning (RL) has shown considerable promise for robotic decision-making, yet deploying multi-agent RL (MARL) on physical multi-robot systems in industrial environments remains challenging. This paper investigates the real-world applicability of decentralized MARL for multi-robot multi-machine tending. We propose Feature-fusion Multi-Agent Proximal Policy Optimization (FMAPPO), which fuses 2D LiDAR measurements with task-specific state information to enable safe decentralized multi-robot task assignment and navigation. A complete simulation-to-reality pipeline was developed using high-fidelity robotic simulation and ROS2 and deployed on physical mobile-manipulator platforms operating under realistic real-world conditions, with the robotic arms disabled during the experiments. We further investigate the sensitivity of the learned policy to command update frequency, an important consideration for real-world deployment. Comparative evaluation in simulation demonstrated that FMAPPO significantly outperformed state-of-the-art baselines with a large effect size, achieving improvements of 106% and 21% in parts delivery and 48% and 11% in parts collection over MAPPO and SMAPPO, respectively. FMAPPO also increased machine utilization by 31 and 10 percentage points, respectively, while reducing collisions by 18% and 15% and increasing the safety score by 14 and 6 percentage points compared with MAPPO and SMAPPO, respectively. Furthermore, real-world experiments demonstrated that the learned decentralized policies can coordinate multiple robots to service multiple machines while maintaining safe operation under real-world sensing and control constraints. Videos of the real-world experiment are available online https://anonymouspapers123.github.io/FMAPPO/.
Read the full abstract

Signal Processing

Multi-Mode Pinching-Antenna Systems: An Inter-Mode-Interference-Free Perspective

The physical model of multi-mode pinching-antenna systems (PASS) is proposed based on the coupled-mode theory. Within the considered model, multiple guided modes are simultaneously excited in a single waveguide and exploited as independent signal-bearing channels, thus providing additional modal degrees of freedom for signal transmission. Under the local electromagnetic perturbations introduced by PAs, the undesired guided-modes coupling is explicitly investigated, and the resulting inter-mode interference (IMI) issue is revealed. The sufficient hardware-design condition for achieving the IMI-free regime is further established, for which the practical feasibility is validated through full-wave electromagnetic simulations. Then, a tractable signal model is derived for multi-mode PASS operating over the IMI-free regime. To demonstrate the benefits of the proposed multi-mode PASS model, the integrated sensing and communications (ISAC) is studied as a representative application scenario, where the base station simultaneously communicates with a communication user and senses a target by using two guided modes. A joint baseband and pinching beamforming optimization problem is formulated for the minimization of the Cramer-Rao bound for target localization, subject to the minimum communication rate requirement, under both continuous and discrete PAs activation cases. An alternating optimization-based algorithm is developed to address the formulated non-convex problem. For the baseband beamforming, a penalty-based successive convex approximation method is invoked. For the pinching beamforming, a particle swarm optimization algorithm and a two-sided matching algorithm are proposed for the continuous and discrete PAs activation cases, respectively. Numerical results obtained in the ISAC application scenario demonstrate the superiority of the proposed multi-mode PASS model over the single-mode PASS.
Read the full abstract

All authors Jingjing Zhao, Songtao Xue, Xidong Mu, Kaiquan Cai, Zhiguo Ding

Computation and Language

TATK: Triple-Aware Top-K Learning with Knowledge-Grounded Verification for LLM-based Sequential Recommendation

LLM-based sequential recommenders usually cast next-item prediction as text generation, but this interface is poorly matched to full-catalog top-K ranking. We propose TATK, a Triple-Aware framework that couples Top-K Learning (TKL) with Knowledge-Grounded Verification (KGV) for LLM-based sequential recommendation. Top-K Learning combines context-aware metadata-KG prompt grounding with position-aware top-K rewards, aligning training with ranking utility; Knowledge-Grounded Verification then applies structure-aware reranking over the top-M candidates after a single LLM forward pass, using the same metadata-derived item graph. We evaluate TATK on Musical Instruments, CDs and Vinyl, and Video Games from Amazon Reviews 2023 under a matched R2ec-style full-catalog protocol. Experiments use Gemma-2-2B-It and Qwen2.5-3B-Instruct backbones, compare against sequential, generative, KG-augmented, and reasoning-enhanced baselines, and include component, reward-shape, sequence-perturbation, reranking, relation-quality, and candidate-pool diagnostics. TATK improves over the matched R2ec reproduction on all 36 reported metrics. On NDCG@10, it improves Qwen by 8.05%, 4.26%, and 3.78% on the three datasets, and improves Gemma by 27.03%, 10.52%, and 10.23%, while keeping inference within 1.17x of Base RecPO latency. The diagnostics show that structural evidence is most useful for recoverable top-M candidates with reliable KG support, and should be gated when metadata relations are sparse or noisy.
Read the full abstract

All authors Yuchen Guan, Jiaye Liu, Yifei Han, Zhenxi Zhang, Yixuan Weng, Bin Li

Optimization and Control

Proximal-Linearized NEP Method for Composite Optimization with Set-Inclusion and Manifold Constraints

This paper focuses on difference-of-convex (DC) composite optimization problems with set-inclusion and manifold constraints. We develop an inexact proximal-linearized nonsmooth exact penalty (NEP) method that penalizes the conic constraint while retaining the manifold constraint explicitly. At each outer iteration, the method approximately solves a strongly convex proximal-linearized subproblem over the current tangent space, using computable inexactness criteria, adaptive parameters, and a retraction-based acceptance mechanism. Under boundedness of the iterates and penalty parameters, we establish an $O(\epsilon^{-2})$ worst-case outer iteration complexity for finding an $\epsilon$-approximate KKT point of the original problem. We further develop a complexity-transfer framework relating uniform primal objective-gap and KKT-residual decay, or dual objective-gap decay, to total inner-iteration complexity bounds. This yields an $O(\epsilon^{-4})$ overall oracle complexity with either accelerated semi-proximal ADMM or FISTA applied to the dual subproblem as the inner solver. Using semi-proximal ADMM as the inner solver improves the bound to $O(\epsilon^{-2}\log(1/\epsilon))$ under an additional uniform error-bound condition. We further establish convergence of the entire iterate sequence to a KKT point under the same boundedness assumption and the Kurdyka-Lojasiewicz property of the associated potential function. Numerical experiments demonstrate the competitive performance of the proposed method on row-sparse PCA, clustering, robust SVMs, and nonconvex SOCPs.
Read the full abstract

Quantum Physics

Exact $1/4$ mean-rung population and $\sqrt{2}$ continuum revival-time ratio in the anti-Jaynes–Cummings vertex at $f_\star=\sqrt{\bar n+1}$

At atomic resonance the Jaynes–Cummings (JC) vertex of a single bosonic mode coupled to a two-level emitter is blind to $f=\omega/\lambda$ at zero detuning and Kerr; the anti-Jaynes–Cummings (AJC) vertex is not. We show that the mean-rung excited population of the AJC block equals exactly $1/4$ at $f_\star=\sqrt{\bar n+1}$, while the JC population at the same point is $1/2$. The Poisson-averaged packet value at $\bar n=16$ is $0.24650$, within $3.5\times 10^{-3}$ of the exact value, with the deviation reproduced by $-\bar n/[16(\bar n+1)^2]$. At $f_\star$ the modulation depth of the AJC inversion is $1/2$ and the relative sensitivity of the continuum revival-time ratio $r=t_R^{\rm AJC}/t_R^{\rm JC}$ is maximal with value $1/(2\sqrt{\bar n+1})$. Full diagonalization on $2(n_{\max}{+}1)$ states confirms the analytic values. The $1/4$ value can be generated by Floquet-engineered counter-rotating coupling provided that the static transverse rate satisfies $g_0\ll g_1$. Parameter translations for an ideal trapped-ion blue sideband and a flux-tunable circuit-QED coupler are reported.
Read the full abstract

Differential Geometry

Equivalence on exponential families as Hessian manifolds and classification of exponential families of order 1 with constant Hessian sectional curvature

We introduce an equivalence relation on exponential families, and prove that two exponential families are equivalent in this sense if and only if the corresponding induced Hessian manifolds are isomorphic. Moreover, we classify exponential families of order 1 with constant Hessian sectional curvature. To this end, we show that for an exponential family of order 1, it has constant Hessian sectional curvature if and only if the natural exponential family equivalent to the given family has a quadratic variance function (NEF-QVF). The classification coincides with that of NEF-QVF by Morris (1982) essentially.
Read the full abstract

Robotics

GLAM: Training a latent world model over global spatiotemporal memory for active exploration and navigation

Active exploration and semantic navigation require an embodied agent to build memory from partial observations, predict how the evolution of observed spatial memory may support future motion, and convert that prediction into actionable plans. We present GLAM, a goal-conditioned latent world model trained over global spatiotemporal memory, and GLAM NAV, the complete navigation system built around it. Given historical map tokens, a navigation goal, and the current robot pose, GLAM jointly predicts future map representations and robot-centric waypoint latents, allowing future spatial context and navigation intent to be inferred in a shared representation space. The model follows a JEPA-like latent prediction paradigm, operates directly on map-level latent tokens rather than RGB reconstruction, and uses a pretrained waypoint encoder-decoder to supervise and decode navigation plans within GLAM NAV. Training data are collected by replaying ObjectNav expert trajectories in Habitat over HM3D v0.2 scene assets and slicing them into multi-timescale prediction samples. On a controlled HM3D-ObjectNav subset reproduction setting, GLAM NAV improves over a reproduced BSC-Nav baseline in both success rate and success weighted by path length.
Read the full abstract

All authors I-Tak Ieong, Ruizhi Feng, Zhaoyang Lu, Yifei Cao, Jiayao Zhao, Leon Li, Senhua Zhu, Wenbo Ding

Computer Vision

Small Object Detection in Drone Aerial Imagery with LAF-YOLOv10

General-purpose object detectors lose accuracy on UAV footage, where targets span only a handful of pixels and onboard compute is limited. Prior work composes independently-validated architectural techniques into one detector, assuming gains reported in isolation transfer once combined. We stress-test that assumption directly. LAF-YOLOv10 integrates four techniques into YOLOv10n: a Partial Convolution C2f (PC-C2f) backbone block, an Attention-Guided Feature Pyramid Network (AG-FPN), a P2 detection head replacing the large-object P5 head, and Wise-IoU v3 regression, asking whether their combined effect matches what each contributes alone. We train LAF-YOLOv10 three times (seeds 42, 123, 256) on VisDrone-DET2019, benchmark against unmodified YOLOv10n, and use TIDE error decomposition, per-category breakdown, per-component ablation, attention/loss comparisons, zero-shot transfer to UAVDT, and held-out/test-dev evaluation to localize where the combination succeeds or fails. Composability does not hold here. LAF-YOLOv10 reaches 24.0+/-0.4% mAP@0.5 at 2.14M parameters, 7.8 points below YOLOv10n (31.8%), a deficit that transfers to UAVDT (-10.0 points) and is confirmed by held-out and test-dev evaluation (23.5%, 22.5%). Background false positives, localization error, and duplicate detections move in the direction AG-FPN and Wise-IoU were designed to push. Ablation traces the deficit to a specific source: the P2/-P5 head swap costs 2.5 points independently plus a 2.5-point interaction penalty when layered onto a backbone weakened by PC-C2f, whose own 2.0-point loss is consistent with a partial pretrained-weight transplant (73/150 backbone tensors transfer). The failure is attributable to a specific interaction, not the four components individually. Composability must be verified directly, not assumed. Code/checkpoints: https://github.com/Mudassiruddin7/Small-Object-Detection-in-UAV-Imagery.
Read the full abstract

Data Structures and Algorithms

Online matching games in bipartite expanders: applications to bitprobes and dictionaries with non-adaptive probing

A dictionary is a data structure which stores pairs (key, value). The operation query on input key returns value if the dictionary contains a pair (key, value) and nil otherwise. A dynamic dictionary also supports the insert and delete operations. The model with cells of bitsize $n + m + 1$ is used, where $n$ and $m$ are the bitsizes of keys and values. We give 2 dictionaries that use $(1+o(1))K$ cells to store $K$ pairs and in which query makes non-adaptive probes to the data structure: a static one in which query makes $\smash{\widetilde O(n^2)}$ probes, and a dynamic one in which it makes $\smash{\widetilde O(n^2 \log K)}$ probes. Also, for the first time, a dictionary is given in which all 3 operations are non-adaptive, but the size is larger: $O(nK)$ cells. The constructions are explicit and, consequently, all operations run in time $\poly(n,m)$. 1-bitprobes storage schemes store a set $S \subseteq \{0,1\}^n$ and answer a membership query by reading a single bit. We introduce 1-bitprobes that are dynamic. Such a scheme is given whose size is smaller than in all previous constructions which are static. The query operation has runtime $n^{O(1)}$. The operations delete and insert have runtime $n^{O(\log n)}$. The proofs rely on a strategy for an online matching game played on a given bipartite graph. An opponent switches left nodes on and off. The strategy needs to assign an irrevocable match to a node when it is turned on. Such games were introduced in the companion paper~\cite{companion-Hall}. The applications in this paper rely on efficient strategies assuming that each node is turned off after a polynomial number of rounds. We present efficient strategies for (lossless) expanders.
Read the full abstract

Robotics

Language-Grounded Semantic Target Navigation for Autonomous Surface Vehicles

Autonomous Surface Vehicles (ASVs) are increasingly expected to operate in ports and harbour environments, where operators may specify navigation targets through language-based descriptions rather than predefined coordinates or fixed target identifiers. However, existing ASV navigation methods mainly execute predefined geometric goals or task-specific objectives and give limited attention to language-grounded target specification. This study proposes Semantically Grounded Navigation (SGNav), a framework that enables an ASV to identify and approach a maritime target from an operator-provided description. SGNav integrates text-guided semantic grounding, harbour-aware candidate filtering, CLIP-based semantic verification, grounded target control-state construction, and Proximal Policy Optimisation-based closed-loop control. It grounds the target description in onboard RGB observations, suppresses visually or semantically irrelevant distractors, and converts the selected target into a compact control-oriented representation for policy execution. Experiments in simulated port environments show that SGNav achieves success rates of $97.0\pm1.2\%$, $92.0\pm1.5\%$, and $90.0\pm1.8\%$ across three representative target-reaching tasks, with semantic target accuracy above $97\%$ and wrong-target rates below $3\%$. SGNav also maintains $97.7$–$98.7\%$ success rates across held-out port layouts. In the Task~3 ablation study, removing harbour-aware filtering or semantic consistency reduces the success rate to $40.4\pm2.6\%$ and $50.4\pm3.1\%$, respectively. These findings demonstrate the importance of semantic grounding, harbour-aware filtering, and semantic verification for reliable language-grounded ASV navigation. These results indicate that the proposed perception-to-control framework can support language-grounded target approach manoeuvres of ASV under the complex port environments.
Read the full abstract

Machine Learning

Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting

When performing parallel data transmission through a network using multiple paths, it is practically important to minimize the maximum transmission time among the selected paths. This study addresses an online problem in which $k$ paths from an origin vertex to a destination vertex must be selected at each time step within a network represented as a directed graph. Here, the number of paths going through each edge in each parallel data transmission is limited to its capacity, and the time required for transmission is determined stochastically. We formulate the semi-bandit problem of selecting a set of paths to minimize the maximum traversal time among the selected paths and propose an algorithm to solve it.
Read the full abstract

Statistical Mechanics

Conserved quantities in a bosonic tight-binding chain with non-Hermitian quartic terms

We investigate local conserved quantities in non-Hermitian bosonic lattice systems whose underlying Yang–Baxter structure remains unclear. Focusing on a one-dimensional bosonic chain with quartic interactions of creation operators, we provide a new representation of the local conserved quantities previously constructed by Sanatani and Shiraishi. Using Fourier transformation and trigonometric identities, we systematically derive these conserved quantities and show directly that they form a mutually commuting family. We further extend the construction to interactions extending beyond a single site, cubic interactions, asymmetric hopping, and an on-site potential. Our results provide a unified framework for constructing and characterizing local conserved quantities in this class of non-Hermitian many-body systems.
Read the full abstract

Data Structures and Algorithms

The Matroid Secretary Conjecture is True

We resolve the matroid secretary conjecture, giving an online algorithm that accepts each element of the offline optimum with probability at least $1/4$. The algorithm only needs the number of elements in advance and independence-oracle access to subsets of already-arrived elements; it does not need to know the matroid upfront.
Read the full abstract

Functional Analysis

On Rotationally Symmetric Norms

For two-dimensional norms that generate rotationally-symmetric norms in all higher dimensions, necessary and sufficient conditions are established for them to be subspaces of $L_1$. \

Algebraic Geometry

Blow-up formulas of Gromov-Witten invariants and virtual cycles under positivity conditions

Let $\widetilde{X}$ be the blow-up of a smooth projective variety $X$ along a smooth subvariety $Z \subset X$ satisfying a numerical positivity condition. We study virtual cycles of moduli spaces of stable maps to $\widetilde{X}$. We lift the numerical blow-up formula of Chen and Du to a pushforward identity for virtual cycles of moduli spaces of genus-zero stable maps to $\widetilde{X}$ and $X$. Using virtual dimension calculations for the fixed loci and a free-leaf contraction morphism, we show that all correction terms in the master space localization formula vanish. Variants of this method yields further blow-up formulas, including a generalization of Gathmann's formula. We also give a counterexample to the point-blow-up conjecture in higher genus (proposed by Hu), and establish an absolute–relative correspondence in all genera under positivity and dimension assumptions, comparing the Gromov–Witten theories of $(\widetilde{X},E)$ and $X$, where $E$ is the exceptional divisor.
Read the full abstract

Functional Analysis

Cancellation of complex kernels and sharp critical lines and endpoint theory for the Forelli–Rudin operators I: the purely hypersingular case

For $a,b,c\in\mathbb R$, we consider the Forelli–Rudin operators $$ T_{a,b,c}f(z):=(1-|z|^2)^a\int_{\mathbb D}\frac{(1-|w|^2)^b}{(1-z\overline w)^c}f(w)\,dA(w) $$ and their positive counterparts $$ S_{a,b,c}f(z):=(1-|z|^2)^a\int_{\mathbb D}\frac{(1-|w|^2)^b}{|1-z\overline w|^c}f(w)\,dA(w). $$ We obtain a complete and sharp classification of their weak- and restricted weak-type mapping properties in the hypersingular regime $$ \Omega_{\mathcal H}:=\{(p,q):1\leq p,q\leq\infty,\ p>q\}, $$ thereby substantially extending the recent work of the first and fourth authors on hypersingular Bergman projections. One of the main discoveries of this work is an intrinsic cancellation phenomenon associated with the complex Forelli–Rudin kernel: at certain critical endpoints, cancellation creates a sharp separation between the two operators, with $T_{a,b,c}$ remaining bounded while its positive counterpart $S_{a,b,c}$ fails to be bounded. Perhaps surprisingly, this cancellation is invisible in the strong $L^p$–$L^q$ theory established by Zhao and Zhou in 2022, where the two operators have the same boundedness range, and emerges only at the weak- and restricted weak-type levels. Allowing the parameters $a,b,c$ to vary, we show that the collection of all weak-type Forelli–Rudin pairs in $\Omega_{\mathcal{H}}$ is precisely $$ \mathcal{FR}_w=\{(p,q)\in\Omega_{\mathcal H}:1<p\leq2\}, $$ whereas the collection of all restricted weak-type Forelli–Rudin pairs is $$ \mathcal{FR}_{rw}=\{(p,q)\in\Omega_{\mathcal H}:p\neq\infty\}. $$ These ranges, together with all corresponding endpoint estimates and failures, are sharp. Our approach combines dyadic decompositions, probabilistic constructions, and weak-type Hardy estimates.
Read the full abstract

All authors Bingyang Hu, Zipeng Wang, Kenan Zhang, Xiaojing Zhou

High Energy Astrophysical Phenomena

First results on the search for the Galactic Center Excess in the sub-GeV band with the emulsion telescope in GRAINE 2023

(Please check the paper for full abstract.) The Galactic Center Excess (GCE) is an unexplained excess of gamma-ray emission from the Galactic Center. The GRAINE experiment aims to reveal the origin of the GCE using an emulsion gamma-ray telescope with high angular resolutions of 1 deg at 100 MeV and 0.1 deg at 1 GeV. In this study, we search for the GCE in a small region near the Galactic Center using the GRAINE 2023 flight data. In particular, rather than focusing on the spectral peak of the GCE at 2 GeV, we focused on the energy range below 300 MeV, where the spectral differences between the dark matter annihilation and millisecond pulsar scenarios are more pronounced. We searched for the GCE within 1 deg of the Galactic Center in the 75–300 MeV energy range. Although no significant excess was observed, we obtained an upper limit on the GCE flux of 1.70*10^-7 GeV cm^-2 s^-1 at the 2 sigma confidence level for the 1deg-radius ROI centered on the Galactic Center, based on a direct observation of the narrow region around the Galactic Center. This observation requires high angular resolution and represents a unique result from GRAINE. The obtained upper limit is consistent with the GCE flux near the Galactic Center, which was estimated from existing Fermi-LAT observations using a wide ROI and assuming an NFW profile. Although the current upper limit constrains some models, the available statistics are still insufficient to distinguish between the dark matter annihilation and millisecond pulsar scenarios, and both remain consistent with the current results. We also estimated the projected sensitivity of future GRAINE experiments based on the present observation and demonstrated their potential to probe the origin of the GCE by comparing the projected sensitivity with the predicted GCE spectra.
Read the full abstract

All authors Yuya Nakamura, Shigeki Aoki, Takashi Azuma, Hirotaka Hayashi, Yudai Isayama, Atsushi Iyono, Takumi Kato, Tsuyoshi Kawahara, Kohichi Kodama, Ryosuke Komatani, Masahiro Komatsu, Masahiro Komiyama, Hideyuki Minami, Kunihiro Morishima, Fumiya Murakami, Shogo Nagahara, Naotaka Naganawa, Mitsuhiro Nakamura, Tomoaki Nakamura, Noboru Nakano, Toshiyuki Nakano, Kazuma Nakazawa, Miyuki Oda, Kazuhiro Okamoto, Hiroki Rokujo, Osamu Sato, Kai Shimizu, Amon Suganami, Yuki Sugi, Kou Sugimura, Satoru Takahashi, Ikuya Usuda, Saya Yamamoto, Jun Yamashita, Mayu Yamashita, Shoma Yoneno, Masahiro Yoshimoto

Disordered Systems and Neural Networks

Statistical Landscape Exploration and Weak-Field Defects in Selective Oscillator Ising Machines

Oscillator Ising machines (OIMs) provide an analog dynamical approach to combinatorial optimization, but comparatively little is known about the statistical structure of the ensembles they generate. Using the Sherrington-Kirkpatrick (SK) spin-glass model, we introduce a selective oscillator scheme, OIM+, in which successive annealing epochs are combined with energy-based elimination and repopulation of replicas. We characterize the resulting states through overlap distributions, Hamming distances, hierarchical clustering, and local-field statistics. OIM+ explores structured low-energy regions while retaining a nontrivial ensemble of configurations despite repeated selection. We identify sparse weak-local-field residual defects as a characteristic limitation of the dynamics. A short Metropolis-Hastings refinement preferentially corrects these defects, indicating that the oscillator dynamics performs the dominant collective exploration while the remaining corrections are predominantly local. The weak fields arise mainly from cancellation among competing interaction terms rather than uniformly weak couplings. The same behavior persists for an antiferromagnetically biased SK ensemble, where the hybrid method reaches a pooled mean energy comparable to a substantially longer pure Metropolis anneal. The complete protocol also achieves competitive performance on standard G-set Max-Cut benchmarks. These results suggest a natural division of labor between collective analog search and targeted local refinement.
Read the full abstract

Populations and Evolution

How deterministic trajectories and their fluctuations underlie allele-frequency statistics in the strong-selection regime

We determine statistics of allele-frequency trajectories across replicate populations. Defining $R = 2N_e|s|$ where $N_e$ is the effective population size and $s$ is the additive selection coefficient of a focal allele, we focus on strong selection which corresponds to $R \gg 1$. Strong selection does not require large selection coefficients: in populations of realistic size, it can readily arise from small selection coefficients. Our analysis concerns a biallelic locus over timescales on which mutation can be neglected. Every allele-frequency trajectory belongs to one of two absorbing classes: fixation or loss. When $R$ is large, individual allele-frequency trajectories can appear nearly deterministic. This does not imply that an approximation of allele-frequency statistics can be based on a single deterministic trajectory. For a beneficial allele, the deterministic trajectory approaches fixation, yet a non-negligible fraction of stochastic trajectories may be lost. Ignoring trajectories that achieve loss can produce severely erroneous statistics. We address this by conditioning separately on the eventual loss and eventual fixation of the focal allele. This yields an outcome-conditioned representation of a statistic. In the strong-selection regime, we apply a small-noise expansion that reasonably captures transient behaviours of statistics while recovering their exact long-time limits. We illustrate results with numerical examples for the mean allele frequency and its variance. The biological interpretation of this work is that, even under strong selection, both trajectory types are of importance. We provide a simple framework for calculating time-dependent allele-frequency statistics relevant to experimental evolution, longitudinal population-genomic data, and the dynamics of alleles driving selective sweeps.
Read the full abstract

Optimization and Control

SCMO: Stochastic Control for Optimization over Probability Measures on Infinite-Dimensional Spaces

We study objective-only optimization of possibly nonconvex and nonsmooth functionals over probability measures on a separable Hilbert space, allowing the optimizer to be intrinsically non-Dirac. We introduce SCMO (Stochastic Control Measure Optimizer), a gradient-free particle method derived from entropy regularized stochastic control. After finite-particle and Galerkin approximations, a Cole–Hopf transform represents the optimal feedback as a Gibbs-weighted terminal displacement. SCMO approximates this feedback by sampling context clouds, replacing one particle at a time with candidate draws, scoring the resulting empirical measures, and applying exponential reweighting. SCMO uses separate covariances for candidate proposals and particle updates, termed matched when equal and nonmatched otherwise; our analysis covers both settings. In the matched case, we establish PDE-free qualitative convergence and a projection-first quantitative bound separating particle, Galerkin-projection, and entropy-regularization errors. For the practical multi-context implementation with nonmatched covariance, we prove finite-candidate consistency and show that the signed, curvature-dependent effect of nonmatched covariance can reduce the resulting upper bound on the approximation error. Finally, experiments on function-space, trajectory-law, and contact-rich manipulation problems show that SCMO handles nonsmooth and nonconvex objectives, escapes suboptimal local basins, and recovers prescribed multimodal, non-Dirac law structure. Code for reproducing our experimental results is available at https://github.com/HenryCHEUNG7373/SCMO.
Read the full abstract

Dynamical Systems

Distributional Chaos in Over-Saturated Sets

We study distributional chaos in over-saturated sets under the non-uniform specification property. We prove that for any dynamical system with the non-uniform specification property, every non-empty over-saturated set exhibits distributional chaos of type 1. We further provide sufficient conditions for certain differences of over-saturated sets to exhibit distributional chaos of type 1. We also construct examples showing that some of these conditions are optimal.
Read the full abstract