Peer Revenue Publish or profit

Papers

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

All of arXiv

Sunday 6 September

Econometrics

Expected Shortfall Factor Models: Common Tail Losses and Expected Returns

We develop an expected shortfall factor model (ESFM) to estimate and price common variation in the severity of lower-tail losses in large panels of asset returns. Mean factor models describe common variation in average returns, while quantile factor models describe common movements in tail thresholds. ESFM instead captures common variation in the average severity of losses below those thresholds. The model combines observed risk exposures with latent common factors. We estimate ESFM using an orthogonalized two-step procedure under which first-stage quantile estimation error has no first-order effect on the ES coefficient estimates. We establish nonasymptotic error bounds for the ES coefficients, a finite-sample Gaussian approximation, and consistent selection of the number of latent factors. Applied to a large panel of equities, ESFM uncovers common factors that react sharply to market stress and contain information not captured by mean and quantile factors. Average returns increase across portfolios sorted on ESFM exposure; high-minus-low portfolios earn annualized returns of 8.0%–11.7% and Fama–French five-factor alphas of 10.3%–15.0%. These spreads remain positive and statistically significant after conditioning separately and jointly on mean- and quantile-factor exposures. Tail-by-tail spanning tests show that ESFM factors retain significant alphas after controlling for standard traded factors and the corresponding mean and quantile factors. Adding ESFM to these benchmark factor sets increases the maximum attainable Sharpe ratio. These findings identify common loss severity as a distinct and priced dimension of downside risk.
Read the full abstract

All authors Yujie Hou, Xinbing Kong, Yalin Wang, Bin Wu

Game Theory

EFX Allocations for Three Agents and Seven or Eight Chores

We show that every additive chore instance with three agents and seven or eight indivisible chores has an EFX allocation. Costs may be arbitrary nonnegative reals. Together with the theorem of Kobayashi, Mahara, and Sakamoto for at most $2n$ chores, this settles the existence of EFX allocations for three agents and at most eight chores; for four or more agents, He and Tao have shown that EFX allocations of additive chores need not exist. Both proofs are computer-assisted. For seven chores, we normalize each agent's costs and sort the chores, and then express the nonexistence of an EFX allocation as a formula of quantifier-free linear real arithmetic with one clause per allocation; the SMT solvers Z3 and cvc5 show that this formula is unsatisfiable. For eight chores, if two agents share a cheapest chore, we remove that chore, apply the seven-chore result, and put the chore back using an insertion lemma of Kobayashi, Mahara, and Sakamoto. The remaining instances, in which the agents' sets of cheapest chores are pairwise disjoint, are handled by a second formula of the same kind.
Read the full abstract

Artificial Intelligence

Probabilistic Focal Search: Accelerating Bounded-Suboptimal Search via Lower-Bound Advancement

Bounded-suboptimal search seeks a solution within a factor $w$ of optimal while reducing search effort. Focal Search (FS) uses heuristic guidance within FOCAL, the frontier nodes eligible under the threshold $w f_{\min}$, but its deterministic policy may leave $f_{\min}$ unchanged for many expansions. We introduce Probabilistic Focal Search (PFS), which follows the FS guided choice with probability $p$ and expands a minimum-$f$ OPEN node with probability $1-p$. The latter branch encourages the lower bound to advance, enlarging FOCAL and admitting nodes that may lead to feasible solutions. By balancing guidance and lower-bound advancement, this mechanism can reduce time to a bounded solution when progress is limited by delayed FOCAL admission. As a secondary transfer experiment, we apply the same scheduler to Dynamic Potential Search, yielding Probabilistic Dynamic Potential Search (PDPS). We benchmark PFS against FS on N-Puzzle, Pancake Sorting, and the Traveling Salesperson Problem (TSP), and evaluate its anytime extension on the Generalized Covering TSP (GCTSP), using multiple $w$ and $p$ values. Across these benchmarks, the largest gains occur when long $f_{\min}$ plateaus delay useful FOCAL admissions; in such settings, the probabilistic factor may reduce node expansions by about 90% or more (e.g., on N-Puzzle and TSP). For the anytime algorithm family, Anytime Probabilistic Focal Search (APFS) outperforms all tested algorithms in evaluating anytime methods on GCTSP. We also observe that the benefit is smaller when the deterministic search already advances efficiently (e.g., Pancake Sorting), indicating that the probabilistic factor is most useful when FOCAL admission is a search bottleneck. The PDPS transfer shows that the mechanism also transfers to potential guidance, although its common-success effects remain domain- and bound-dependent.
Read the full abstract

All authors Minh Vu Duc, Trung Le Huu, Hà Minh Hoàng, Trung Thanh Nguyen, Phuong Khanh Nguyen, Huynh Thi Thanh Binh

Representation Theory

D-modules and Solvable Lie Foliations

Let $V$ be a compact connected manifold and $G$ a simply connected solvable Lie group. We study $G$-Lie foliations on $V$ from the point of view of $\mathcal{D}$-module theory, following the approach initiated by Dathe. To each singular foliation $\mathcal{I}$, we associate the $\mathcal{D}_X$-module $\mathcal{M}_{\mathcal{I}} = \mathcal{D}_X / \mathcal{D}_X \cdot \mathcal{I}$ and the derived ring $\mathcal{D}_{\mathcal{I}} := R\mathcal{H}om_{\mathcal{D}_X}(\mathcal{M}_{\mathcal{I}}, \mathcal{M}_{\mathcal{I}})$. We compute the D-irregularity $\mathrm{D\text{-}irr}(\mathcal{I})$ for three classes of solvable Lie foliations: regular homogeneous foliations, the Meigniez foliation with non-polycyclic holonomy group, and an explicit foliation on a compact 5-dimensional manifold. We show that the non-polycyclicity of the holonomy group $\Gamma$ is reflected in the non-vanishing of higher cohomology groups of $\mathcal{D}_{\mathcal{I}}$, establishing a new connection between the geometry of the holonomy group and $\mathcal{D}$-module invariants.
Read the full abstract

General Physics

Supernova Time Dilation in Hybrid Expansion-Tired-Light Cosmologies

Dark Energy Survey has shown that the emission light curve widths $\Delta t_{\rm em}$ of supernovae increase to $\Delta t_{\rm obs}$, obeying $\Delta t_{\rm obs}/\Delta t_{\rm em}=(1+z)^b$ with $b=1.003\pm0.011$, excluding a nondilating redshift. We test hybrid models with $1+z=(1+z_p)(1+z_t)$ and the phenomenological stretch $(1+z_p)R(z)$, where $z_p$ is the redshift associated with the expanding parent universe cosmology, $z_t$ is a tired-light (TL) contribution, and $R$ is the hybrid-to-parent lookback-time ratio. At $z=1$, $R$ and $1+z_t$ differ by $1.3\%$ for CCC+TL and $0.5\%$ for $\Lambda$CDM+TL, and their 95% bands overlap the observed relation. This compatibility shows that the observations do not exclude the hybrid models, only fully nonexpanding ones.
Read the full abstract

Software Engineering

The Double Measurement Confound in Agent Benchmarks: De-Scaffolding, Ground-Truth Scoring, and Reliability Beyond the Mean

Agent benchmarks are increasingly used to compare large language models (LLMs) and guide deployment decisions, yet benchmark scores are meaningful only if they measure model capability rather than properties of the evaluation pipeline. We identify a double measurement confound: execution-critical decisions are performed by a fixed scaffold instead of the model, while the scorer evaluates outputs using criteria that may not reflect task correctness. We unify these issues within a measurement-theoretic framework that characterizes when benchmark scores can be interpreted as evidence of model capability, and instantiate it with an audit-and-repair protocol that (i) transfers execution-critical decisions from the scaffold to the model, (ii) replaces shape-based evaluation with seeded ground-truth scoring, and (iii) reports reliability beyond the mean through worst-case and tail-risk metrics. Experiments on ComtradeBench show that the joint intervention transforms a nearly flat leaderboard into a reliability spectrum that distinguishes both average performance and robustness across seeds. Applying the audit to existing benchmarks further shows that scorer validity is benchmark-specific, whereas scaffold ownership is an uncontrolled axis wherever we probed it. Our results suggest that benchmark scores should be interpreted together with their scaffolding level, scoring criterion, and reliability profile, providing a practical framework for more valid evaluation of LLM agents.
Read the full abstract

All authors Yonghong Zhang, Shadi Motaali, Vu Phong Dinh, Avin Piroutiniya, Jorge E. López de Vergara, Luis de Pedro, Ricardo Correia, Isabel M. Parra, Yong Xie

Robotics

Design and Attitude Control of an Underwater Quadruped Robot

Legged robots are versatile on land, but their use in underwater environments remains limited. Extending quadruped locomotion to water enables amphibious mobility with applications in inspection, environmental monitoring and disaster response. This paper presents the design, modeling, and experimental validation of a reproducible underwater quadruped robot. The robot is built around custom waterproof motor housings machined from polyoxymethylene plastic, which use off-the-shelf O-rings and dynamic shaft seals. A simplified model is derived to describe the dynamics of this underwater legged system, capturing how drag forces on spherical end effectors transmit torque to the floating base. Building on this model, a closed-loop attitude controller is developed using an error formulation defined on the special orthogonal group SO(3). The controller is evaluated both in simulation and experimentally in a water tank, where the robot tracks desired orientation setpoints in roll, pitch and yaw.
Read the full abstract

General Mathematics

On one-sided series of Bessel functions of the first kind: $\sum_{m=0}^{\infty} (\pm 1)^m J_{Nm+p}(x)$

We present generic expressions for one-sided series of Bessel functions of the first kind: $\sum_{m=0}^{\infty} J_{Nm+p}(x)$ and $\sum_{m=0}^{\infty} (-1)^m J_{Nm+p}(x)$. The result is expressed in terms of incomplete Lipschitz-Hankel integrals of Bessel functions of the first kind, which can be represented as Kampé de Fériet functions.
Read the full abstract

General Mathematics

The Diophantine equation $p^{x}+6^{y}=z^{2n}$: a complete solution for half of the primes

Let $p$ be a prime number and let $n\geq 1$ be an integer. We completely solve the exponential Diophantine equation $p^{x}+6^{y}=z^{2n}$ in positive integers $x,y,z$ for every prime $p$ such that the Legendre symbol $\leg{6}{p}$ equals $-1$, that is, for $p\equiv 7,11,13,17\pmod{24}$: the equation has no solution, with the single exception $(p,n,x,y,z)=(13,1,1,2,7)$. Since these residue classes contain half of all primes in the sense of Dirichlet density, this settles the equation for one prime out of two, uniformly in the exponent $n$. Two ingredients of the proof have independent interest. First, we show that the Ramanujan–Nagell type equation $p^{x}=2\cdot 6^{m}+1$ has no solution with $x\geq 2$, using Zsigmondy's theorem on primitive prime divisors; this removes the extra congruence hypotheses that appeared in earlier work of the author on the case $n=1$ and solves the open problems formulated there. Secondly, we prove that $13^{x}+6^{y}=z^{2}$ has $(x,y,z)=(1,2,7)$ as its unique solution, thereby completely resolving the exceptional prime. The Legendre condition is sharp: we exhibit solutions for primes with $\leg{6}{p}=+1$ realising each branch of the factorisation argument. All results are corroborated by extensive computational verification, and we state several open problems, including the complete classification of the solutions when $\leg{6}{p}=+1$.
Read the full abstract

Robotics

Geometry Conditioning in an Embodied SLM: Training Controls and Robustness Diagnostics in a 0.8B Hybrid Model

We study how physical-state inputs affect a 0.8B hybrid language model adapted for manipulation with 6.2M trainable parameters. Six conditions are trained on three LIBERO-Spatial tasks and evaluated over three seeds and 540 held-out rollouts. Conditioning recurrent decay gates on geometric increments yields 28.9% success, compared with 36.7% when those increments are shuffled during training and 24.4% without explicit object/goal geometry. Both geometry policies receive correct inputs at evaluation. A token adapter using the same increments scores 27.8%; differences vary across seeds and remain inconclusive. Token-clock conditioning scores 11.1%, including one seed that fails to converge. In separate robustness tests, a state-only relative-coordinate policy retains 7/10 success under frame relabeling, whereas all four tested visual policies fall to at most 3/20 after a 5 cm object displacement. These results show no reliable advantage from training-time geometric alignment under this recipe and illustrate the gap between coordinate invariance and physical-layout generalization. Episode records, seed-level analyses, and figure-generation code accompany the paper.
Read the full abstract

Cryptography and Security

AgentHijack: Visual Patch Attacks on Multimodal Computer-Use Agents

This paper presents an end-to-end evaluation framework for image-triggered command injection against computer-use agents (CUAs). The goal is to test whether a local visual patch can induce verifiable environmental consequences along the full chain of screenshot input, VLM generation, action parsing, and environment execution. We train and deploy patches on author-controlled GitHub Pages pages and a locally deployed CSDN clone, and evaluate them in real environments across five open-source or publicly available GUI-agent or vision-language-model (VLM) backends. Our experiment aggregates 600 instance-level online cases, with T-ASR, TAPR, and E2E-ASR reaching 84.5%, 47.0%, and 20.3%, respectively. Trajectory analysis further shows that in some successful cases the agent first executes a malicious terminal command and then continues the original benign task. These results indicate that optimized local visual signals can affect not only VLM outputs but also propagate through the execution pipeline of open CUAs and create real environmental risk.
Read the full abstract

All authors Zhihao Liu, Hongyu Sun, Zhiyuan Fu, Xiaonan Duan, Jice Wang, Shangru Zhao, Weizhi Meng, Wuxin Yang, Yangfan Zhou, Yuqing Zhang

Machine Learning (Statistics)

A Subsampled Davis-Kahan Bound for Large-Scale Eigenspace Estimation

The Davis-Kahan theorem is a fundamental tool in spectral analysis, providing quantitative control over the distance between the eigenspaces of a symmetric matrix and its perturbation. However, when the matrix dimension is large, computing leading eigenvectors is computationally expensive, limiting the practical use of spectral methods in modern large-scale applications. This paper addresses this problem by proposing an independent Bernoulli sampling scheme and proves that the leading left singular vectors of the subsampled matrix faithfully approximate the target subspace of a low-rank symmetric matrix. Our main result is a subsampled Davis-Kahan bound that gives an explicit error bound depending directly on the sampling probability. The bound reveals the trade-off: the computational cost scales linearly with the sampling probability, while the statistical error scales as the inverse square root of the sampling probability. Our result thus extends the Davis-Kahan theorem to the subsampled setting, enabling scalable spectral analysis of large-scale symmetric matrices.
Read the full abstract

Robotics

Identifying Habit, Physics, and Nuisance in Robot World Models

Teleoperated demonstrations are often multimodal even when the underlying dynamics are nearly deterministic given the executed action. We argue that this multimodality typically mixes three factors–operator habit in action selection, shared physics, and observation nuisance–and that entangled next-observation predictors absorb all three. We formalize the split with a structural causal model a=g(h,z,u), z'=f(z,a), o=r(z,c), and test it with complementary interventions: replacing or shuffling actions at fixed state sharply increases next-state error, whereas appearance and camera changes should not; habit-aware reverse scoring improves ranking of feasible pasts without rewriting the dynamics. The associated adaptation rule is to freeze a shared physics readout and update only a thin interface. On StackCube, DROID, and RH20T this rule improves low-shot transfer relative to training from scratch, retains cleaner dynamics under corrupted adaptation data, and extends from proprioception to pixel observations with multi-view and multi-step checks. We do not equate latent actions with operator habit, and we do not target large-scale video generation benchmarks.
Read the full abstract

Computation and Language

AutoLexSteer: Automatic Contrast Construction for Lexical Activation Steering

Steering vectors have rapidly emerged as a popular and effective method for guiding the output of LLMs in very specific ways. But constructing accurate steering vectors is a difficult manual process due to the opacity of embeddings. We introduce Hangman, a novel type of steering vector that operates using word senses, as well as AutoLexSteer, the first fully automated process for building steering vectors. AutoLexSteer employs families of closely-related words extracted from WordNet to specify both the steering source to be avoided and the desired steering target. The steering vectors are quite precise, can be used to steer at the level of words and sets of word senses (meanings), and are able to steer certain LLM behaviors like sycophancy. The dataset and code can be found at https://github.com/ShuheWang1998/autolexsteer.
Read the full abstract

All authors Shuhe Wang, Lachlan Cowley, Eduard Hovy, Jey Han Lau

Systems and Control

Spectral Koopman-Hopf Formula for Reachability with Adversary

This paper develops a spectral Koopman-Hopf framework for adversarial reachability analysis of nonlinear systems. By lifting the nonlinear drift dynamics into Koopman eigenfunction coordinates, the proposed approach transforms the original state-dependent Hamilton-Jacobi-Isaacs (HJI) equation into an approximate state-independent optimization problem in spectral coordinates. The transformed control and disturbance directions are approximated using least-squares spectral projections, and upper and lower bounds on the transformed Hamiltonian are used to derive corresponding bounds on the value function and backward reachable sets. Koopman eigenfunctions are computed using a path-integral-based Galerkin framework that avoids spatial discretization of the associated eigenfunction PDEs. Numerical examples demonstrate tractable approximation of backward reachable sets for nonlinear adversarial systems.
Read the full abstract

Computer Vision

Novel Methods for Catheter and Guidewire Segmentation in X-ray Fluoroscopy under a Federated Learning Setting

Endovascular procedures rely on real-time manipulation of thin instruments, catheters and guidewires, under X-ray fluoroscopy guidance, where accurate visual analysis is essential for procedural safety. Learning-based methods are constrained by structural complexity, data scarcity, and privacy regulations precluding centralised training across institutions. This thesis presents a structure-aware federated learning framework for catheter and guidewire analysis, with four contributions evaluated on real-animal and phantom data. A benchmark dataset, CathAction, is introduced for catheterisation analysis, with over 600,000 annotated frames and 40,000 segmentation masks. A shape-sensitive loss transforms masks into signed distance maps compared in a structural feature space, improving Dice coefficient by up to 2.9 points across five backbones. This is extended to federated learning with shape-sensitive loss, preserving geometric consistency under heterogeneous client data and outperforming federated averaging by up to three points in mean intersection-over-union as clients scale from four to eight. Federated learning with projected gradient descent adds adversarial optimisation, raising mean intersection-over-union by over ten points on real-animal data. Finally, a structure-aware diffusion framework synthesises catheter and guidewire video sequences, combining structural supervision with a domain-adaptive reconstruction objective, reducing Frechet video distance over a strong baseline while maintaining visual fidelity. Incorporating synthetic sequences into federated training raises the Dice score from 44 to 51 percent under data scarcity, with gains across four held-out sites. Together, these contributions advance privacy-preserving catheter and guidewire analysis, supporting collaborative training without centralising patient data or large amounts of manual annotation.
Read the full abstract

Systems and Control

A Data-Driven Koopman-Behavioral Distance for Nonlinear Dynamical Systems

Comparing nonlinear dynamical systems directly from trajectory data remains challenging because finite-horizon trajectory representations are generally coordinate dependent. Motivated by recent behavioral subspace approaches for linear systems, this paper introduces a Koopman-behavioral distance for nonlinear stochastic systems using multi-rollout trajectory data. State measurements are lifted through a common observable dictionary, and dominant lifted behavioral subspaces are compared using Grassmannian distances without explicit Koopman operator identification. We establish coordinate invariance, connection with recently proposed linear behavioral distances under exact lifted closure, and robustness to approximate closure. Numerical examples demonstrate coordinate invariance and parameter discrimination.
Read the full abstract

Image and Video Processing

MedGSSR: Generalizable Medical Image Super-Resolution 3D Reconstruction via Hierarchical Feed-forward Gaussian Splatting

High-resolution volumetric medical imaging is critical for clinical diagnosis, yet acquisition is often limited by scanner hardware, scan time, and for CT, radiation dose. Medical 3D Super-Resolution (Med3DSR) offers a computational alternative, but existing methods commonly rely on per-subject optimization, pretrained priors, or coordinate-based implicit representations, which compromise anatomical fidelity and limit efficiency. To address these limitations, we present MedGSSR, a fully end-to-end feed-forward framework that represents volumes as an explicit 3D Gaussian field for Med3DSR. Unlike coordinate-based implicit functions, our explicit 3D Gaussian representation naturally enhances signal continuity and local high-frequency fidelity. Specifically, MedGSSR explicitly decouples the reconstruction process into coarse-grained structural preservation and fine-grained textural refinement through the proposed Pyramid Anatomical Encoder and a Hierarchical Gaussian Projector. To support arbitrary-scale super-resolution, we introduce sub-voxel Gaussian decomposition and a Differentiable Gaussian Voxelizer that directly queries the continuous 3D intensity field, reducing discretization artifacts. Extensive experiments on MRI and CT benchmarks demonstrate that MedGSSR significantly outperforms state-of-the-art methods. Notably, our framework exhibits robust generalizability across unseen datasets without requiring per-subject optimization, enabling fast inference and high-fidelity volumetric super-resolution in practical clinical settings. Our project webpage, including code, is at https://william2ai.github.io/medgssr
Read the full abstract

All authors Chengkai Wang, Luoyu Hong, Yiting Zhao, Jiamin Wang, Xiang Feng, Feiwei Qin, Zhenzhong Kuang, Xuefei Yin, Ali Bashashati, Yanming Zhu

Machine Learning (Statistics)

Large Classification-Risk-Optional Label Acquisition

We study how a limited labeling budget should be allocated to minimize multiclass zero-one classification risk. We consider parametric classification problems in which features are observed for all sampling units while class labels can be acquired selectively. By combining the Fisher information supplied by an acquired label with the local geometry of multiclass excess risk, we derive an acquisition criterion that minimizes the leading asymptotic coefficient of expected multiclass excess risk. The resulting rule values a label according to how strongly its information is aligned with parameter directions that perturb the active Bayes decision boundary, rather than according to posterior uncertainty or global parameter information alone. We characterize the oracle acquisition design, establish its threshold structure, and derive face-specific and cost-sensitive extensions. An analytic example shows that posterior uncertainty and classification value can produce different, and even reversed, acquisition rankings. We further develop a two-stage adaptive procedure that attains the oracle leading-risk criterion under regularity conditions and provide explicit results for Gaussian discriminant analysis. Three-class QDA experiments illustrate the resulting acquisition geometry, while an application to the six-class Statlog Landsat Satellite data shows that classification-risk acquisition can differ materially from both uncertainty-based acquisition and the complete-classification-information comparator. The adaptive classification-risk design attains lower mean error than this Fisher comparator across the labeling budgets considered, although it does not uniformly outperform entropy or margin sampling and differences among the targeted strategies become small as the labeling budget increases.
Read the full abstract

Machine Learning

Exact Record Omission in Delta Attention: A Transport Criterion, Its Cost, and a Replay Certificate

An assistant can stop repeating a deleted statement while its recurrent memory still carries that statement's influence. We examine this distinction by saving the state difference immediately after a record, carrying this saved difference, or receipt, through later updates, and comparing the corrected state with the state built from the same conversation with the record omitted. Unrolling the recurrence gives an exact criterion: transport reaches this never-stored state if and only if the additional differences created by later updates cancel after transport. We evaluate eleven conditions using 40 prospectively selected synthetic Kimi Linear contexts, with 40 separate calibration contexts and paired uncertainty estimates computed across complete records. Attention masking removed all 40 exact greedy target answers, yet a fixed three-query candidate-scoring attack with known candidate values and log-probability access attained AUC 0.740 (95% interval 0.695–0.809); the measured false-positive rate was 7.5%. Prompt-only forgetting still returned 33 of the 40 targets. Checkpoint replay matched the complete declared active state and audit logits in all 80 contexts, while preserving all 120 retained answers in the evaluation cohort. An independent Qwen cohort and matched original-bf16/8-bit Kimi controls confirmed native transport mismatch beyond the numerical error measured in matched controls. Replay also supported record replacement and successive deletions with a new record added between them. These results provide a practical audit of both the requested memory change and the assistant's remaining behavior, with replay work determined by the surviving suffix.
Read the full abstract

Statistical Methodology

Some homogeneity test statistics for DNA evolutionary models

We present a test statistic for the comparison of DNA sequences under some of the most popular evolutionary processes available in the literature. Theoretical properties for the test statistic as well as its empirical performance by stochastic simulations are presented. The proposed test statistic is a generalized $U$-statistics built for tests of distributional homogeneity under the null hypothesis. We show that a dicothomous situation exists here. Under the null hypothesis, the $U$-statistics kernel is first-order degenerated, this test statistic falls in the quasi $U$-statistics class and follows an asymptotic normal law, albeit of higher order than the standard case. Under heterogeneity, the asymptotic normality is attained on the more usual first-order asymptotics. Asymptotic normality is proven for the cases: high-dimension/large sample size, high-dimension/small sample size, low-dimension/large sample size. Moreover, the case of local alternatives is discussed, and the contiguity of the test statistic for them is established. Simulation studies are performed to assess some finite-dimensional properties of the test statistic, regarding issues such as balanced/unbalanced samples, dimension and sample size.
Read the full abstract

Computer Vision

Organization of Valence and Arousal in Vision-Language Representations of Built Environments: Insights from the EMOIS Dataset

Visual perception of built environments contributes to the affective impressions that people form in everyday life. However, how these impressions are represented within vision foundation models remains largely unexplored. To support the systematic investigation of this subject, we introduce the Emotional Impression of Spaces (EMOIS) dataset, comprising 1,544 real-world built-environment images. Each image is annotated with image-evoked valence and arousal ratings collected from Japanese adults by conducting a large-scale web-based survey, with approximately 120 ratings per image. Using Contrastive Language–Image Pre-training (CLIP) representations, we perform predictive and geometric analyses to systematically investigate how valence and arousal are encoded and organized within the representation space. These analyses reveal that valence exhibited stronger and more coherent organization than arousal. Cross-dataset analyses with the Open Affective Standardized Image Set (OASIS), a benchmark dataset of general affective photographs, reveal differences in affective organization between the two datasets. Regression analyses demonstrate high predictive performance for valence and arousal within EMOIS, with mean coefficients of determination of 0.865 and 0.807, respectively, across repeated internal hold-out evaluations. Finally, we present an example-based interface illustrating how learned representations can support qualitative interpretation of predicted affective values. These findings can help elucidate affective representations of built environments and establish EMOIS as a densely annotated resource for future affective computing research in this domain.
Read the full abstract

All authors Madoka Yonekura, Katsunori Kohda, Nobuhiko Muramoto, Takahiro Yamaguchi

Machine Learning

PPIM: Pennes Physics-Informed Mamba for Heat-Source-Conditioned 3D Bioheat Simulation

Three-dimensional bioheat simulation aims to predict transient temperature distributions in biological tissue and is commonly modeled using the Pennes bioheat equation, which combines thermal diffusion, perfusion-mediated heat loss, and external heat generation. In this study, we consider a controlled 3D Pennes bioheat simulation under a localized heat-source condition inspired by microwave ablation (MWA). To evaluate neural approximation performance, we compare three neural partial differential equation (PDE) solvers under the same controlled simulation: a spatial Fourier-feature physics-informed neural network (PINN), a generic PINNMamba temporal subsequence model, and Pennes Physics-Informed Mamba (PPIM). PPIM builds on the temporal subsequence model by incorporating conditioned heat-source input and Pennes-aware state-space model (SSM) decay initialization. All three neural models are trained under the same conditions with the same Pennes residual, and an explicit finite-difference method (FDM) solution is used only as the numerical reference. In a representative 600~s run, PPIM achieved the lowest MAE, relative $L_1$ error, and relative $L_2$ error among the evaluated neural solvers. Error maps further showed that the remaining PPIM errors were more concentrated near the heat-source region than across the rest of the domain. These results indicate that PPIM is effective for approximating the FDM reference final temperature field in this controlled simulation. The source code is available at https://github.com/muvYun/PPIM.
Read the full abstract

Statistical Methodology

Cluster randomized crossover trials with very few clusters but multiple periods: which analyses for continuous outcomes should be used?

Cluster randomized crossover (CRXO) trials are often used when individual randomization is impractical and the number of available clusters is limited. However, statistical analysis of CRXO trials is complex because of the need to account for complex correlation structures over time. It becomes especially challenging when very few clusters are used because standard modeling assumptions may lead to unstable variance estimates, poor confidence interval coverage, and inflated type I error. This study evaluates individual-level mixed-effects and fixed-effects models with and without a cluster-period random effect, cluster-period summary analysis using normal- or \(t\)-based inference, and two-period crossover-difference estimators. Using extensive simulation studies under both nested exchangeable and discrete time decay correlation structures, we compare model performance in terms of bias, root mean squared error, coverage probability, type I error, and convergence. Across scenarios, all models produced approximately unbiased treatment effect estimates, but their inferential performance differed substantially. Models that explicitly accounted for cluster-period heterogeneity generally provided the most reliable control of coverage and type I error, whereas simpler exchangeable models performed adequately only when the true correlation structure closely matched their assumptions. Cluster-period level analysis performance improved with increasing numbers of periods but was unreliable in the sparsest designs. Overall, the findings suggest that in CRXO trials with very few clusters, accurate modeling of cluster-period correlation is more important than the choice between fixed and random cluster intercepts, and that results from extremely sparse designs should be interpreted with caution.
Read the full abstract

All authors Guangyu Tong, Qianzhe Sun, Jessica Kasza, Andrew Forbes, Monica Taljaard, Fan Li

Combinatorics

Beyond halfway to Hadwiger's conjecture

Hadwiger conjectured in 1943 that every graph with no $K_t$ minor has chromatic number at most $t-1$. Delcourt and Postle proved that every graph with no $K_t$ minor has chromatic number $O(t\log\log t)$. We build on their result to improve this bound to $O(t\log\log\log t)$.

Statistical Methodology

The H-IAR Model for Irregular Multispectral Time Series. Quaternion Formulation, Mapping of Resilience Indicators, and Exploratory Identification of Forest Edges

We propose the Hypercomplex Irregular Autoregressive (\HIAR) model, a quaternion extension of the \IAR/\CIAR/\BIAR{} family for four-component observations at irregular times. Temporal dependence is represented by a real power of a quaternion parameter and estimated in state-space form through the Gaussian innovation likelihood of the Kalman filter, conditional on the adopted covariance specifications. Across 12,000 Monte Carlo fits, mean absolute bias decreased with sample size and ranged from 0.0009 to 0.0023 at $N=300$. We applied the model to 30,824 Sentinel-2 pixel series covering the Mata de Santa Genebra ARIE from 2020 to 2023. The optimizer reported successful numerical termination in 98.73% of the fits; the median $\|{\Phihat}\|$ was 0.6248, 3,872 pixels met the operational high-persistence threshold ($\|{\Phihat}\}\geq0.95$), and the median residual RMSE for band B8 was 5.1551 percentage points. The results demonstrate the computational feasibility of \HIAR{} and its ability to generate descriptors of multispectral persistence, vector dynamics, predictive error, and spatial discontinuities potentially associated with forest edges.
Read the full abstract

Theoretical Economics

School Choice with Appeals

Roughly fifty thousand families in England appeal their school assignments each year through a centralized and understudied procedure that improves the placement of about one in five claimants. This paper shows that appeals are not an institutional afterthought: they change how parents report preferences to the education authority and the quality of placements it generates. Once the appeal stage is incorporated, Immediate Acceptance (IA) becomes less manipulable and can support equilibrium outcomes that Pareto dominate those of Deferred Acceptance (DA) under truth-telling, reversing the DA-IA welfare comparison. In a preregistered experiment, we find results consistent with the theoretical predictions: appeals increase truth-telling in IA, leaving DA essentially unchanged, and widen the IA-DA efficiency gap. Around 60% of the IA efficiency gain appears before any appeal is upheld, because subjects anticipating the possibility of a potential appeal rank schools differently.
Read the full abstract