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

Monday 14 September

Robotics

PredTac: Learning Contact-Rich Manipulation with Predicted Touch

Contact-rich manipulation benefits from tactile feedback, yet physical tactile sensors introduce hardware, calibration, synchronization, and maintenance costs that complicate policy learning and deployment. We formulate predicted touch as an alternative to measured tactile input and present PredTac, a framework that learns to infer tactile states from causal visual observations and robot states and uses the predicted touch as an explicit interface for policy learning and execution. A tactile predictor is first trained with tactile supervision and then used to provide contact information without requiring measured tactile input during downstream policy training or execution. We evaluate PredTac across three contact-rich manipulation tasks in simulation and on a real robot, and further examine how policy performance depends on the predicted contact content. In simulation goal-offset evaluations, predicted-touch policies achieve 27.0%, 52.0%, and 44.7% success on USB, Barbed-spike, and Valve, respectively, improving over the visual baseline by 8.0-13.7 percentage points. On the real robot, predicted-touch ACT achieves 70.0%, 50.0%, and 90.0% success on USB insertion, Barbed extraction, and Valve rotation, respectively, with a three-task mean of 70.0%, approaching measured-touch ACT at 72.2% and substantially outperforming visual ACT at 21.1%. Fixed-policy interventions further show that performance is sensitive to the spatial structure of predicted contact, with spatial rearrangement at fixed value distributions reducing Valve success by 10.7 percentage points. These results demonstrate that predicted touch can provide useful contact information for contact-rich manipulation without requiring tactile sensing as a policy input.
Read the full abstract

Systems and Control

Formal Synthesis of Robust Koopman-Model Predictive Control: A Case Study in AC-DC Power Conversion

This letter proposes a formal synthesis of Robust Koopman-Model Predictive Control (RK-MPC), a novel data-driven approach to formal synthesis of systems with nonlinear dynamics. We formulate a novel optimization problem for RK-MPC by incorporating specifications described by Signal Temporal Logic and prove its closed-loop performance. Effectiveness of the proposed RK-MPC is evaluated by applying it to the reliable design of an AC-DC power converter.
Read the full abstract

Strongly Correlated Electrons

Band-Saddle-Point Engineering in Mixed $A$-site $A$V$_3$Sb$_5$ Kagome Metals

$A$V$_3$Sb$_5$ compounds ($A$ = K, Rb, Cs) offer an experimental platform for probing the physics of kagome metals near ideal Van Hove filling. Here, we use optical spectroscopy on $A$V$_3$Sb$_5$ with mixed $A$-site compositions to reveal the effect of the alkali metal on the low-energy electronic structure. Supported by density-functional-theory calculations, we identify a band-saddle-point inversion as a chemical consequence of Cs substitution, revealing that $A$-site composition controls the orbital character of Van Hove singularities, Fermi surface topology, and electron-phonon interactions while leaving the kagome layer intact.
Read the full abstract

All authors Maxim Wenzel, Alexander A. Tsirlin, Andrea N. Capa Salinas, Brenden R. Ortiz, Stephen D. Wilson, Ece Uykur, Martin Dressel

Robotics

HarnessVLN: Unifying Training-Free Embodied Navigation through an Agent Harness

Embodied navigation requires agents to ground instructions or object goals in spatial observations and translate plans into successful execution. As multimodal large language models (MLLMs) become increasingly capable, they offer stronger support for navigation without task-specific training; however, improved semantic reasoning alone does not ensure that proposed actions remain consistent with spatial evidence, task progress, and execution outcomes. We introduce HarnessVLN, a zero-shot, training-free framework that unifies instruction-following and object-goal navigation through a shared Agent Harness. The Harness coordinates perception, memory, and execution tools through a unified interface, validating planner proposals for evidential support, geometric feasibility, and subgoal consistency before dispatch. It jointly manages hierarchical event memory and a persistent Spatiotemporal Graph to track task progress, preserve spatial evidence, and contextualize failures. Structured execution feedback updates this shared state, guiding subsequent planning, recovery, and termination. Across R2R, RxR, HM3D-v2, and HM3D-OVON, HarnessVLN achieves success rates of 59.6%, 51.4%, 76.0%, and 59.3%, respectively, outperforming prior training-free methods. Humanoid robot deployment further demonstrates its applicability to both navigation tasks in real-world environments. The project page is available at [https://agibot-harnessvln.netlify.app/].
Read the full abstract

All authors Yang Chen, Lirong Che, Zhenyu Huang, Wenbo Fu, Chuang Wang, Xu Cao, Daqi Liu, Yuzhe Yang, Jian Su, Lan-Zhe Guo

Computation and Language

Semiotic Relations and Proof Methods: A Cross-Genre Study of Argument Structure with Large Language Models

When a direct proof of a statement $S$ seems hard or even impossible to obtain, there may exist another statement (or set of statements) $S^{*}$, somehow related to $S$, on the basis of which $S$ can be proved. In order to investigate what options can be used to move from $S$ to $S^{*}$, four kinds of semiotic relations inspired by the four master tropes of semiotic research are briefly reviewed. Specifically, our syntagmatic, paradigmatic, antithetic and meronymic relations correspond, respectively, to metonymy, metaphor, irony and synecdoche. It is suggested that these four semiotic relations determine the options to move from $S$ to $S^{*}$, leading to proof by inference, proof by analogy, proof by contradiction, and proof by case analysis. To examine how the four relations are actually used across different kinds of argument, we complement the framework with an empirical study. We turn the four relations into explicit operational definitions and apply them to a cross-genre corpus of mathematical, legal, and everyday argument using a panel of large language models. We find that the relations are used very unevenly across genres: mathematical proofs draw on all four, whereas legal and everyday reasoning rely almost entirely on inference.
Read the full abstract

Machine Learning

Convergence rates for generative drifting flows: fixed-scale obstructions and multihead acceleration

Drifting models offer a promising route to faster generative AI: they perform gradual transport during training, while generating new samples in a single step. This paper asks whether the underlying drifting process can converge rapidly to a target distribution under ideal conditions, before finite-data or optimization effects are introduced. We show that its convergence rate depends critically on how it handles spatial scale. With a single fixed resolution, fine-scale features of the target can become nearly invisible, leading to extremely slow convergence. We introduce a multihead approach that combines scale-normalized information across a continuum of resolutions. We prove that this multihead approach restores exponential convergence near standard reference distributions. These results identify fixed resolution as a key bottleneck and provide a simple route to faster one-step generative models.
Read the full abstract

Cryptography and Security

Sociotechnical Aspects of Tor Relay Rejection

In 2019, the Tor Project enforced an end-of-life (EoL) policy for Tor versions, leading to the rejection of outdated relays, amounting to a notable fraction of consensus weight. While this policy aids network maintenance, reduces backporting efforts, and shortens vulnerability exposure, its sociotechnical implications remain unstudied. A user study ($N=26$) reveals that relay operators, though not universally aware of the EoL policy, generally view it favorably. Operational practices vary, occasionally excluding newly installed relays from the network. Network simulations, grounded in historical data, assess the policy's immediate impact on Tor clients against common adversaries. Results indicate a marginal adversarial advantage, with network churn (i.e., relays entering and exiting) exerting a more pronounced effect on user anonymity. Security metrics are introduced to evaluate relay contributions against two adversary models, enabling ranking by individual utility and security. Analysis of four exclusion rounds shows that a minority of rejected relays typically account for over 50% of the security provided by all excluded relays. Recommendations for EoL policy implementation are proposed to mitigate potential drawbacks.
Read the full abstract

All authors Jules Dejaeghere, Lionel Goffaux, Pierre Luycx, Hosam Elkoulak, Florentin Rochet

Computation and Language

What Limits Us? Analyzing Self-Reported Limitations in NLP Research

Since late 2022, a Limitations section has become mandatory at many top-tier NLP conferences. The growing number of accepted papers at these venues has resulted in a vast corpus of self-reported limitations that cannot all be manually reviewed, yet remains systematically unanalyzed. Therefore, in this paper, we conduct a large-scale analysis of the Limitations sections from ACL and EMNLP papers published between 2020 and 2025 to understand what researchers disclose about their own work. To do so, we implement a novel human-AI framework for iterative hybrid qualitative coding. This framework enables us to investigate trends in self-reported limitations over time, their correlations with specific paper attributes, and the writing patterns that recur around these disclosures. Our findings offer a critical reflection on the diverse reported challenges as well as the self-reporting practices of researchers in the NLP community.
Read the full abstract

All authors Tawan Thaepprasit, Peeranuth Kehasukcharoen, Ding Wang, Remi Denton, Peerapon Vateekul, Piyawat Lertvittayakumjorn

Number Theory

Algorithms for $p$-rationality and for $p$-saturation of units

Let $K$ be a number field. We give new practical algorithms that determine whether $K$ is $p$-rational. For real cyclotomic fields $K=\mathbb{Q}(\zeta_{n})^{+}$, our method avoids computing either the class number or the full unit group. We also use the notion of $p$-rationality to explain the practical efficiency of an algorithm for determining whether a subgroup of the unit group $\mathcal{O}_{K}^{\times}$ is $p$-saturated. This in turn yields a new algorithm for the unconditional verification of unit groups of number fields that substantially outperforms existing unconditional algorithms in practice. Finally, by combining our algorithms for determining $p$-rationality with work of Greenberg, we construct certain Galois representations $\rho : \mathrm{Gal}(\overline{\mathbb{Q}}/\mathbb{Q}) \rightarrow \mathrm{GL}_{n}(\mathbb{Z}_{p})$ with open image and further prescribed properties.
Read the full abstract

Computer Vision

Reconstructing Is Not Acting: Action-Centric Latent Dynamics Modeling

Latent action models (LAMs) learn action representations from unlabeled videos by inferring latent actions from visual transitions and reconstructing future states. However, we identify a fundamental $\textbf{reconstruction-action mismatch}$: lower reconstruction error does not necessarily yield better latent dynamics or downstream performance. We attribute this mismatch to two underconstrained aspects of reconstruction-based latent dynamics modeling: (i) the inverse dynamics model (IDM) is not explicitly encouraged to distinguish action-related transitions from nuisance appearance, and (ii) the forward dynamics model (FDM) can underutilize the inferred latent action by exploiting predictive shortcuts from the current state. To address both limitations, we propose $\textbf{ACT-LAM}$, a lightweight action-centric framework that strengthens both action extraction and action utilization. Specifically, its Action Query IDM (AQ-IDM) employs learnable action queries and gated aggregation to selectively extract rich action-related transition cues without strong information bottlenecks. And its Action Token FDM (AT-FDM) projects latent actions into action tokens that progressively interact with evolving state representations, enabling continuous state-aware action conditioning. ACT-LAM further streamlines feature processing to concentrate model capacity on latent dynamics modeling. Extensive experiments on several robotic datasets and the VP$^2$ benchmark demonstrate stronger latent action consistency, forward dynamics, and downstream visual planning performance with fewer trainable parameters and lower computational overhead. In particular, ACT-LAM surpasses the previous state of the art by $\textbf{7.6%}$ on the aggregated VP$^2$ success rate. Codes at $\href{https://github.com/DingjieFu/ACT-LAM}{url}$.
Read the full abstract

All authors Dingjie Fu, Dianxing Shi, Yangyang Xu, Jun Yu

Computation and Language

MUSE: A Theory-Harnessed Story Engine for Vibe Narrativizing

LLMs have been able to generate fluent prose, but high-quality stories also require coordinated decisions about plot, character, and language across planning, drafting, and revision. We formulate Vibe Narrativizing as turning natural-language writing requirements into a finished story. MUSE, a Theory-Harnessed Story Engine, addresses two bottlenecks: rule quality and sustained rule realization. Story theory supplies the rules, and a practical agent harness puts them to work. Knowledge engineering organizes Robert McKee's theory through rule atomization, semantic consolidation, mechanism abstraction, a single source of truth, and layered disclosure; typical examples clarify judgments that depend on context and aesthetic purpose. The harness preserves story decisions in intermediate deliverables across design, character performance, scene composition, and revision. Context engineering supplies each role with relevant guidance and decisions; a masterwork corpus provides inspiration and prose references. A worked example follows a requested object from its thematic role to climactic actions. Across four base models, MUSE improves WritingBench by 1.1 to 6.2 points over zero-shot generation; it is the only multi-stage system in our comparison to do so. It also raises LongStoryEval by more than ten points on three of the four models. ConStory-Bench consistency error density remains in the low single digits for all four models, below every reproduced story-system baseline on three of the four models. Ablations locate the largest quality contribution in structural design, voice-specific effects in the character path, and further gains in revision.
Read the full abstract

All authors Jianxiang Ma, Xiaocui Yang, Daling Wang, Mingfu Zhang, Zijing Wang, Yuesong Hou, Yichen Gao, Junzhao Huang

Computer Vision

Does Attention-Guided Masking Really Help Object Discovery in Object-Centric Learning?

Object-Centric Learning (OCL) aims to decompose images into objects without human annotations. A major family of mainstream methods uses Slot Attention to aggregate image features into object-level representations and then from them reconstructs masked image content, i.e., Random Masking (RM), to provide self-supervision. The recent method DIAS simply masks image patches at uniform randomness yet achieves competitive object discovery accuracy. Since attention during aggregation already possesses object discovery ability, we explore using it to develop a better image patch masking strategy, i.e., Attention Guided Masking (AGM), thereby providing better self-supervision. Results on six recognized datasets show that AGM does not always outperform RM. Under unconditional slot initialization, AGM substantially improves background segmentation on datasets with realistic textures (COCO and VOC); Regardless of conditional or unconditional slot initialization and across datasets, foreground object discovery remains comparable or decreases. We suggest peer researchers in the OCL community that attempts to exploit internal attention semantics to improve OCL with masked decoding are risky. Our source code, model checkpoints and evaluation logs are available on https://github.com/und-entropy/Does-Attention-Guided-Masking-Really-Help-Object-Discovery-in-Object-Centric-Learning-.
Read the full abstract

All authors Youliang Tao, Yanhua Han, Bin Zhao, Juho Kannala, Joni Pajarinen, Rongzhen Zhao

Numerical Analysis

A Hybridized Staggered Discontinuous Galerkin–Mixed Finite Element Method for Strain Gradient Elasticity

We propose a hybridized staggered discontinuous Galerkin–mixed finite element method for the strain gradient elasticity model, a fourth-order singularly perturbed problem governed by a material length scale parameter $\iota$ and the Lamé constants $\lambda$ and $\mu$. Introducing the total stress together with the scaled Cauchy and hyper stresses as auxiliary unknowns, we recast the model as a first-order system and discretize the displacement and the total stress by staggered discontinuous Galerkin spaces, the two scaled stresses by Raviart–Thomas pairs, with symmetry imposed strongly on all three stresses. The higher-order Dirichlet boundary condition enters the variational formulation naturally, so that the scheme avoids the numerical boundary layer that limits displacement-based methods. By establishing an inf-sup condition on the symmetric subspace and a discrete Korn inequality, we prove algebraic stability and optimal convergence, both uniform in $\iota$ and $\lambda$. We further develop a hybridized scheme in which local static condensation leaves only two multipliers on the mesh skeleton as globally coupled unknowns. Numerical experiments confirm the predicted convergence rates and the parameter robustness.
Read the full abstract

Dynamical Systems

Isolated Flat Points and $C^2$-Robustness of the No Focal Points Property

We prove a local stability criterion for the no focal points property on compact Riemannian surfaces. More precisely, if a smooth metric $g$ has non-positive Gaussian curvature and its zero-curvature set is finite, then $g$ belongs to the $C^2$-interior of the set of metrics without focal points. Thus, every sufficiently small $C^2$-perturbation of $g$ still has no focal points, although arbitrarily small perturbations may create regions of positive Gaussian curvature. By Ruggiero's characterization of the $C^2$-interior of the set of metrics without conjugate points, all metrics in the resulting neighborhood are Anosov. We also show that, starting from any hyperbolic metric on a compact surface, one can prescribe an arbitrary finite set as the zero set of the Gaussian curvature of a smooth conformal non-positively curved metric. These metrics can be approximated smoothly by negatively curved metrics, so they lie on the boundary of the negatively curved regime while remaining interior points of the no-focal-points regime. The proof of the stability theorem combines uniform local convexity, Gulliver's bound on the length of geodesic segments contained in small balls, and an inductive argument on the Riccati equation that controls successive passages through the regions where positive curvature may appear.
Read the full abstract

Sound

Cross-Lingual F5-TTS 2: A Simplified Framework for Language-Agnostic Voice Cloning

Zero-shot text-to-speech (TTS) can clone a speaker's voice from a short audio prompt, yet most TTS systems still require the audio prompt transcript during inference. This dependency prevents cross-lingual voice cloning when the audio prompt transcript is unavailable, particularly for unseen languages. Cross-Lingual F5-TTS removes this dependency and enables transcript-free cross-lingual voice cloning, but it prepares its training data with forced alignment. Forced alignment is sensitive to boundary errors, and its cost grows as more languages are covered. Its speaking rate predictor is also unreliable at estimating duration when the audio prompt begins or ends with silence. In this paper, we present Cross-Lingual F5-TTS 2, a simplified framework for transcript-free cross-lingual voice cloning without forced alignment. Instead of using forced alignment to segment real utterances, we build same-speaker prompt and target pairs using a pretrained F5-TTS model and fine-tune the same model on these constructed pairs. This simplifies data preparation and preserves the acoustic modeling capability of the pretrained model, enabling adaptation with only a short fine-tuning stage. We further make the syllable-level speaking rate predictor robust to leading and trailing silence through silence-aware augmentation. Experiments show that Cross-Lingual F5-TTS 2 reaches higher speaker similarity than F5-TTS and Cross-Lingual F5-TTS while maintaining intelligibility. All related resources are publicly available.
Read the full abstract

All authors Qingyu Liu, Rixi Xu, Yushen Chen, Zhikang Niu, Haitao Li, Pengcheng Zhu, Bowen Zhang, Jian Zhao, Yunting Yang, Qinyuan Cheng, Xipeng Qiu, Berrak Sisman, Kai Yu, Xie Chen

Analysis of PDEs

Bilinear estimates for Schrödinger equation with repulsive inverse-square potential and its application

In this paper, we establish the bilinear Strichartz estimates for the following linear Schrödinger equation with repulsive inverse-square potential $i\partial_tu+\La u=0$ where $\La=-\Delta+a|x|^{-2}$ with $a\geq0$ for non-radial data. Our proof relies on the physical space method (interaction Morawetz estimate). Such type of method was first introduced in Planchon-Vega [Ann. Sci. Éc. Norm. Supér. (4) 42 (2009), 261–290] in flat case, and Planchon-Tzvetkov-Visciglia [Rev. Mat. Iberoam, 39(2023), no. 4, 1405-1436] for harmonic oscillator. Our bilinear estimate extends results obtained in Camps [Ann. Inst. H. Poincaré Anal. Non Linéaire 39 (2022), 1–58] and Pusateri-Soffer [Mem. Amer. Math. Soc. 299 (2024), v+107 pp] to the critical case. As an application, we establish the global well-posedness for cubic NLS with inverse-square potential \begin{equation*} iu_{t} +\La u = -|u|^2u,\ \ (t,x)\in \mathbb{R}\times\mathbb{R}^{3}. \end{equation*} for radial initial data $u_0\in H_a^s$ with $s>\frac{11}{13}$ and $a>0$ where $H_a^s$ is the Sobolev space adapted to the Schrödinger operator with inverse-square potential. The proof relies on Bourgain's high-low frequency decomposition argument and our bilinear estimates. This is the first result on the low regularity well-posedness for NLS with scaling-critical potential.
Read the full abstract

Artificial Intelligence

VisInteract: Towards Dynamic Interactive Text-to-Visualization under Imperfect Queries

Real-world visualization requests are routinely ambiguous, incomplete, or factually incorrect, yet existing Text-to-Visualization (Text-to-Vis) systems assume well-specified inputs and produce charts in a single pass. When queries are imperfect, a system must interact with the user to recover the true intent, but no benchmark or method supports this dynamic process. We introduce VisInteract, a new paradigm that reframes Text-to-Vis as interaction-driven intent recovery, and VisInteract-Bench, to our knowledge, that is the first benchmark for dynamic interactive Text-to-Vis, featuring controlled imperfection injection, a leakage-controlled User Agent for realistic multi-turn feedback, and dual-perspective (code and chart) automated evaluation. On the algorithmic side, we propose Vis-MCTS, a Monte Carlo Tree Search (MCTS) enhanced method, introducing improvements over classical MCTS, that Progressive Widening to tame the unbounded tool-argument space in tree search, cross-rollout information sharing so clarifications and critiques benefit the entire search tree, and Dimension-Aware Reward Decomposition that routes scalar user feedback along data-fidelity, visual-design, and intent-alignment dimensions to resolve credit assignment across heterogeneous actions. Extensive Experiments across two LLM backbones show that Vis-MCTS consistently outperforms all Text-to-Vis baselines, improving end-to-end task success by $13.40\%$–$16.27\%$ over the strongest interactive baseline and by more than $5\times$ over non-interactive ones.
Read the full abstract

All authors Wenxin Xu, Jinwei Lu, Hwanhee Kim, Chen Jason Zhang, Xiao-Yong Wei, Haoyang Li, Yuanfeng Song

High Energy Physics (Phenomenology)

The $\gamma Z$-box correction and its impact on parity-violating deep-inelastic scattering

The $\gamma Z$-box correction is an important electroweak contribution to precision parity-violation measurements, but its conventional low-energy treatment relies on an ambiguous effective quark-mass prescription. We revisit this correction using a finite-mass calculation that provides a well-defined perturbative contribution without introducing such an auxiliary scale. Applying the result to the Jefferson Lab PVDIS measurement shifts the extracted electron-quark couplings at the $10^{-3}$ level. We discuss the implications of this shift for precision electroweak tests and the need for a consistent separation of perturbative and non-perturbative hadronic contributions.
Read the full abstract

Machine Learning

Rethinking Correctness for Uncertainty Estimation in Clinical Prediction with Vision-Language Models

Vision-language models are increasingly explored for clinical prediction from electronic health records and medical images, where identifying unreliable predictions is important for safe deployment. Uncertainty estimation (UE) enables detecting such predictions, but its evaluation depends on a correctness criterion that determines whether each model output is correct. If this criterion disagrees with human judgement or distorts downstream UE performance, conclusions about model reliability can be misleading. We introduce a two-axis framework that evaluates correctness criteria by their agreement with human judgements and fidelity to human-referenced UE performance. We assess eight criteria across three clinical prediction tasks and three models using 450 predictions annotated by two reviewers. Across the audited tasks, canonical exact matching (EM) achieved the highest observed human agreement and lowest UE distortion, while the BERT-based matching (BEM) and LLM-judge also showed strong human agreement. Across four UE methods and 23,254 clinical predictions, criterion choice changed error-detection AUROC by up to 0.146 and reversed the relative ranking of UE methods. The LLM-judge also selectively accepted invalid or uncertain outputs, accepting 16 of 30 such human-identified errors. These results demonstrate that correctness assessment is an integral component of clinical UE evaluation and should be validated before UE methods are compared.
Read the full abstract

Computational Geometry

Low-Dimensional Embeddings for Gaussian Kernels on Manifolds

The Gaussian kernel is a widely used similarity measure underlying kernel methods such as kernel PCA and spectral clustering, but computing Gaussian kernel distances for many pairs of points can be expensive. Using Random Fourier Features (RFF), Chen and Phillips [ALT 2017] showed that for points in a $d$-dimensional Euclidean ball in ${\mathbb R}^N$, $t=\Omega((d/\varepsilon^2)\log(dR/\varepsilon))$ features suffice to preserve all pairwise Gaussian kernel distances within a $(1\pm\varepsilon)$ factor with high probability. We establish a uniform relative-error embedding theorem for the more general setting of an arbitrary positive-reach submanifold $\mathcal M\subset{\mathbb R}^N$ of intrinsic dimension $d$. We show that $t=O((d/\varepsilon^2)\log(\operatorname{vol}(\mathcal M)^2N^{2d}/(\operatorname{vol}(B_1^d(0))^2\operatorname{rch}(\mathcal M)^{2d}\varepsilon^{2d+1}\delta)))$, or approximately $O((d^2/\varepsilon^2)(\log N+\log(1/(\varepsilon\delta))))$, RFFs suffice, with probability $1-\delta$, to preserve the Gaussian kernel distance between every pair of manifold points up to relative error $\varepsilon$. Thus the bound depends only logarithmically on the ambient dimension and on manifold parameters such as volume and reach, while retaining the $1/\varepsilon^2$ Euclidean rate. We also prove a topological consequence: under the same RFF embedding, persistent homology is preserved in the sense that weighted Cech and Rips filtrations built from Gaussian kernel power distance are $(1\pm\varepsilon_\star)$-interleaved, where $\varepsilon_\star$ accounts for both distance distortion and kernel-weight approximation.
Read the full abstract

Combinatorics

Type C transpositions and strong marked tableaux

Motivated by the Morse–Seelinger conjecture on type C $k$-Schur functions, we develop a permutation model for type C strong marked tableaux. Using type C transpositions, we give an explicit correspondence with the symmetric-core model that preserves the marking data. We also describe the induced affine Weyl group action on bounded partitions.
Read the full abstract

Machine Learning

Temporal Self-Distillation: Faster Inference in Discrete Diffusion Language Models

Diffusion language models (dLLMs) promise fast inference by generating multiple tokens in parallel, but suffer severe performance degradation when parallel decoding is pushed too aggressively. We introduce Temporal Self-Distillation (TSD), a simple on-policy method that trains dLLMs for fast inference by distilling predictions across time. Specifically, TSD distills the model's denoising distribution at earlier timesteps toward its distribution at the final timestep at which a token is committed. This encourages earlier predictions to better anticipate the model's eventual output, enabling much more aggressive parallel decoding. Because its teacher signal comes from the model itself, TSD requires no offline teacher generation and applies seamlessly to both base and post-trained policies. Across seven benchmarks in mathematics, planning, and code, TSD substantially shifts the speed–quality frontier toward the low-compute regime. TSD thus provides a simple, single-stage approach to accelerating dLLMs, achieving speedups competitive with offline distillation while avoiding a complex two-stage pipeline.
Read the full abstract

All authors Shijian Xu, Andrea Miele, Metod Jazbec, Volker Roth, Eric Nalisnick, Ilija Bogunovic

General Relativity and Quantum Cosmology

Charged Black Hole Solution in Hoyle Narlikar Gravity and its Thermodynamic Properties

In this paper, we derive a new class of analytic black hole solutions within the framework of Hoyle–Narlikar gravity, where the black hole is surrounded by an electric charge acting as the source. After obtaining the corresponding metric, we investigate the thermodynamic properties of the resulting black hole solutions, including the Hawking temperature and entropy. Subsequently, we compute the specific heat and Gibbs free energy in order to analyse the thermodynamic stability of the black hole in Hoyle–Narlikar gravity. An interesting result of our analysis is that the black hole becomes thermodynamically stable for large values of the horizon radius within this framework.
Read the full abstract

Analysis of PDEs

On the Uniqueness of a Nonlinear Discrete Calderón Problem

The discrete Calderón problem aims at recovering the conductivity on the edges of a graph from boundary measurements, encoded by the discrete Dirichlet-to-Neumann (DtN) map. The problem has been intensively studied in the linear case on square lattices since the seminal works of Curtis and Morrow. In this work, we investigate a nonlinear analogue of the discrete Calderón problem for a semilinear second-order elliptic equation on square lattices. We establish three uniqueness results for the conductivity recovery. First, we show that conductivity-dependent corner excitations allow a layer-by-layer reconstruction of the conductivity. Second, we study the linearization of the nonlinear DtN map at an arbitrary background boundary datum and prove that the conductivity and the background potential are uniquely determined by one pair of nonlinear Cauchy data and the linearized DtN map. Third, we show that the linearized data can be replaced by finitely many nonlinear measurements, which uniquely determine the conductivity.
Read the full abstract

All authors Elena Beretta, Maolin Deng, Alberto Gandolfi, Bangti Jin

Probability

Palm Disintegration and Height-Profile Recovery for Projected Hardy–Szegő Zeros

We study the horizontal projection of the upper-half-plane Hardy–Szegő zero process after independent height-dependent thinning, with height retained as an unobserved mark. We identify the reduced Palm law of the projected process by disintegrating over the missing height coordinate, describe the conditional law of the two heights associated with a pair of projected points and its near- and far-separation limits, and obtain the small-spacing asymptotic for the right nearest neighbour. We then study recovery of the height profile from the projected second-order structure. The resulting covariance transform uniquely determines every compactly supported finite positive height measure and, for separated finite unions of intervals, yields uniform Lipschitz recovery of all endpoints, even when the number of intervals is unknown but bounded.
Read the full abstract

Signal Processing

Full-Wave-Calibrated Element-Wise RIS Modeling With Cross-Aperture Coefficient Transfer for Multipath Channel Prediction

Practical reconfigurable intelligent surfaces (RISs) can exhibit deterministic parasitic scattering that is not captured by idealized element-wise models. As a result, such models may overestimate the gain of the intended RIS-assisted path and bias multipath prediction. This paper develops a full-wave-calibrated element-wise model using three Bragg-order basis functions to represent the intended and dominant parasitic scattering components. Environmental multipath is incorporated by identifying RIS–Rx reflection sequences with ray tracing (RT) and unfolding them by image theory into path-dependent image points. This allows direct and reflected RIS-assisted paths to be evaluated using the same per-element kernel and coherently combined with Tx–Rx bypass paths. To reduce the full-wave calibration burden for large RISs under a prescribed focusing configuration, only the three Bragg-order coefficients are transferred from a 25-by-25 calibration aperture, while the target-aperture basis functions and geometry are recomputed. At 154 GHz, the transferred coefficients keep the intended-order errors within 0.8 dB for the 50-by-50 and 100-by-100 RISs, while reducing the full-wave calibration time for the prescribed configuration from 7.56 to 1.08 h relative to direct 100-by-100 calibration. For multipath validation with the 50-by-50 RIS, the calibrated model using the same transferred coefficients keeps the nominal-Rx gain error within 0.88 dB across four PEC reflector configurations, compared with 1.75–5.51 dB for the uncalibrated general model, and reduces the error from 6.49 to 0.23 dB in the scaled indoor environment.
Read the full abstract

Artificial Intelligence

STHMoE: Hypergraph-Enhanced Heterogeneous Dependency Coordination for LLM-Based Urban Traffic Data Forecasting

Spatio-temporal traffic forecasting is a fundamental big data analytics task for intelligent transportation systems, where massive urban sensor streams exhibit heterogeneous, non-stationary, and structurally dynamic patterns. Although recent deep learning and large language model (LLM)-based methods have advanced traffic forecasting, they often remain temporally centered and lack effective coordination of temporal, spectral, pairwise spatial, and higher-order structural cues under evolving traffic regimes. To address this heterogeneous dependency coordination problem, we propose STHMoE, a Spatio-Temporal Hypergraph-Enhanced Mixture of Experts framework for urban traffic data forecasting. STHMoE decouples traffic dynamics into frequency-domain, time-domain, spatio-domain, and higher-order spatial representations, which are modeled by prompt-guided heterogeneous experts built upon a partially frozen LLM backbone. The first three experts leverage domain-specific statistical prompts, while the higher-order spatio expert uses a structural placeholder prompt and obtains dependency information from an adaptive hypergraph module. To capture evolving spatial structures in traffic data,, STHMoE jointly learns first-order graph dependencies and higher-order group interactions without predefined topologies. An entropy-aware MoE router with coefficient-of-variation load balancing adaptively fuses expert outputs while improving expert utilization and routing confidence. Experiments on 10 real-world traffic benchmarks show that STHMoE achieves competitive performance against temporal, spatio-temporal graph, and LLM-based baselines.
Read the full abstract

All authors Jiawen Chen, Qi Shao, Yongjian Chang, Mingtong Zhou, Duxin Chen, Wenwu Yu

Computer Vision

EECTracker: Swarm Motion Prior-Guided Feature Compensation for Airborne Optical UAV Swarm Tracking

Airborne optical tracking of uncrewed aerial vehicle (UAV) swarms is challenging due to extremely small target scales, rapid viewpoint changes, and cluttered backgrounds, which can weaken target feature responses and lead to intermittent or temporarily missing detector responses. Existing multi-object tracking methods generally depend on reliable target-specific detector responses to maintain target states and identities across frames. When such responses become unreliable, target states cannot be reliably updated and cross-frame association cues become ambiguous, resulting in fragmented trajectories and identity switches. To address this problem, we propose EECTracker, a swarm-motion-prior-guided joint detection-and-tracking framework for airborne optical UAV swarm tracking. EECTracker constructs a probabilistic swarm motion prior from reliable historical tracklets to capture the shared short-term image-plane motion tendency of the swarm and its uncertainty, providing spatial guidance for cross-frame feature compensation. Building on this prior, we introduce Energy–Entropy Consistency Activation (EEC Activation) to evaluate motion-prior-conditioned feature consistency using feature residual energy and local residual entropy. The resulting Local EEC score guides pixel-level feature compensation by enhancing motion-prior-consistent feature responses in potential target regions while suppressing inconsistent background responses. Experiments on AIRMOT and UAVSwarm show that EECTracker achieves superior overall tracking performance compared with state-of-the-art methods. Compared with the strongest competing method SCT-MOT, EECTracker improves MOTA/IDF1 by 3.89/1.79 percentage points on AIRMOT and by 2.81/1.74 percentage points on UAVSwarm, while maintaining online inference speed.
Read the full abstract

All authors Zhaochen Chu, Tao Song, Ren Jin, Mingdong Jia, Defu Lin

Machine Learning

Nearly Minimax-Optimal Regret for Linear Contextual Bandits with Arbitrary Adaptive Action Sets

We study stochastic linear contextual bandits with arbitrary action menus that may depend on the fixed parameter and the interaction history. We establish matching upper and lower bounds, up to logarithmic factors. Let $d$ be the dimension, $K$ be the menu size, and $T$ the time horizon. For $2\le K\le d$, we prove an upper bound $\widetilde O(K^{1/4}\sqrt{dT})$. When $T\ge d^2$, we further prove a lower bound $\Omega(K^{1/4}\sqrt{dT})$. Thus, for $T\ge d^2$ and $2\le K\le d$, the upper and lower bounds match up to logarithmic factors, and the polynomial dependence on $K$ is optimal. Compared with the previous $\widetilde O(\sqrt{dKT})$ bound, our upper bound improves the dependence on $K$ by a factor of $K^{1/4}$. For $K\ge d$, we prove an upper bound $\widetilde O_{d,T}\left(\sqrt{dT}\min\{\sqrt d,(d\log K)^{1/4}\}\right)$ and a lower bound $\Omega\left(\sqrt{dT}\min\left\{\sqrt d,\left(\frac{d\log K}{\log(2d)}\right)^{1/4}\right\}\right)$. Here, $\widetilde O_{d,T}$ omits logarithmic factors only in $d$ and $T$. In particular, for polynomially large $K\ge d$, the upper and lower bounds both scale as $d^{3/4}\sqrt T$ up to logarithmic factors, improving the standard $\widetilde O(d\sqrt T)$ rate by a factor of $d^{1/4}$. As $K$ grows further, the regret smoothly recovers the $d\sqrt T$ scale once $\log K$ reaches order $d$.
Read the full abstract

Computer Vision

GRAVA: Grounded Reasoning-to-Action Representation and Learning for Autonomous Driving

Driving vision-language-action (VLA) models increasingly reason before acting, but their intermediate reasoning is often weakly grounded in physical scene evidence and loosely connected to executable behavior. We present GRAVA, a framework built around Grounded Reasoning-to-Action (GRA), which unifies grounding, reasoning, and action generation in a single autoregressive stream. GRA links action-relevant language references to 2D visual regions and ego-centric physical states, organizes object interactions and decisions in a trajectory-anchored typed graph, and serializes this structure into grounded reasoning. A single VLM generates this reasoning followed by a compact Executable Planner action that is deterministically decoded into a continuous trajectory. We further introduce an agentic GRA data construction pipeline that combines forward scene grounding with backward trajectory anchoring, and use it to build GR-NavSim with 2.2M grounded question-answer pairs and 70K GRA reasoning traces. A progressive training strategy develops grounded cognition through pre-training, establishes the reasoning-to-action interface through imitation, and improves driving behavior through reinforcement learning and exploration. Using about 60% of the available human driving demonstrations for action supervision, GRAVA-8B achieves state-of-the-art performance among purely autoregressive driving models on the full NAVSIM benchmark. On an internal long-tail benchmark, full GRA improves key-object compliance and Closed-loop Driving Score by 19.3% and 20.5% over action-only prediction, respectively. These results show the benefit of preserving action-relevant physical evidence from grounded reasoning through executable action generation.
Read the full abstract

All authors Xiao Liu, Haoyu Li, Jianghao Leng, Lin Wang, Chao Sun