Searcharxiv⌕ Search

arXiv subjects

Xin Xu

Publications and source records attributed to Xin Xu.

At least 73 records · Page 4Linked to original sources

Rethinking Amortized Neural Representations for High-Resolution Terrain Elevation Data

Implicit neural representations (INRs) model a signal as a continuous coordinate-to-value function. For terrain elevation data, this supports analytic derivatives, arbitrary-resolution decoding, and a smooth surface model of the underlying heightfield. However, fitting and storing a separate INR for every tile does not scale to large terrain datasets. Amortized neural representations reduce this cost with a shared network: a new tile is mapped to a compact per-tile payload, and a shared decoder reconstructs the heightfield from it. Most such methods are hypernetworks that predict the payload in a single forward pass, while others recover it through a short per-tile optimization. These methods were developed primarily for natural images, and their suitability for terrain heightfields remains unclear. We introduce a controlled benchmark on a 1 m/pixel terrain dataset and evaluate three representative methods under a unified protocol. Observing a clear cross-domain gap, we propose HUVR+SIREN, a hypernetwork that adapts the strongest benchmarked method (HUVR) by replacing its coordinate decoder with a smooth, analytically differentiable one. It attains the best height and derivative fidelity on the benchmark with no additional per-tile storage and lower decode cost, and tolerates aggressive post-training quantization with negligible quality loss, giving a compact terrain neural format. Ablations and diagnostics further identify which design choices transfer to terrain and show that the per-tile bottleneck is already near its useful limit, leaving the remaining gap in the shared hypernetwork's architectural design.

cs.CV↗

Mining Multi-Modality Spatio-Temporal Cues for Video Important Person Identification

Identifying key individuals in video scenes is essential for applications such as automated video editing and intelligent surveillance. Current methods primarily focus on static images and immediate visual cues, overlooking the rich spatio-temporal information in videos. This leads to the phenomenon of Temporal Importance Shift (TIS), wherein individuals deemed significant in early frames may be demoted as the entire temporal context is considered. To address this, we introduce the Video Important Person (VIP) identification task, aimed at automatically identifying the most influential individuals in videos while providing textual rationales. We present Temporal-VIP, a large-scale rationale-annotated dataset consisting of 9,249 video segments across 11 categories with aligned importance rationales. To mitigate TIS, we develop the VIP-Net framework, which includes a Social Cue Encoder (SCE) for extracting multi-modal spatio-temporal cues, a Temporal Importance Rectifier (TIR) for hierarchical cue fusion and cross-modal alignment, and VIP Inference for ranking individuals. Experimental results show that VIP-Net achieves 67.3% accuracy, significantly outperforming state-of-the-art models (37.5%-53.9%) and yielding a mean rationale similarity of 0.63 to ground truth through feature-guided LLM refinement. The dataset and code are available at https://huggingface.co/datasets/yml2002/Temporal-VIP.

cs.CV↗

Noise Suppression and Radio Frequency Interference Rejection for Self-Triggered Radio Detectors of Extensive Air Showers

Self-triggered radio detection of ultra-high-energy cosmic rays and neutrinos offers a scalable and cost-effective approach for next-generation astroparticle observatories, but remains challenging under realistic radio-frequency interference (RFI) conditions. In the classical air-shower radio band, the achievable sensitivity and trigger reliability are critically limited by the balance between external sky background noise and internal detector-unit noise, as well as by non-stationary anthropogenic interference. In this work, we present an end-to-end design and experimental characterization of a self-triggered radio detector unit explicitly optimized to operate in a galactic-noise-dominated regime. Rather than focusing on a single hardware component or trigger algorithm, we adopt a system-level methodology that coherently integrates sky-noise modeling, RF-chain noise budgeting, electromagnetic compatibility (EMC) mitigation, and measurement-driven validation. By using the galactic radio background as a quantitative reference, we assess the internal noise performance of the detector unit and demonstrate conditions under which extensive air shower (EAS) radio signals can be distinguished from anthropogenic interference at the system-response level. We further introduce an indirect noise-quantification method to estimate the low-noise amplifier contribution within the complete RF chain based on differential internal-noise measurements evaluated at the ADC level. The proposed detector unit is validated through laboratory and on-site measurements, demonstrating operation close to the galactic-noise limit in the core frequency band. These results provide a practical and transferable methodology for the design and deployment of large-scale self-triggered radio arrays such as GRAND.

astro-ph.IM↗

Learning to Foresee: Unveiling the Unlocking Efficiency of On-Policy Distillation

On-policy distillation (OPD) has emerged as an efficient post-training paradigm for large language models. However, existing studies largely attribute this advantage to denser and more stable supervision, while the parameter-level mechanisms underlying OPD's efficiency remain poorly understood. In this work, we argue that OPD's efficiency stems from a form of ``foresight'': it establishes a stable update trajectory toward the final model early in training. This foresight manifests in two aspects. First, at the \textbf{Module-Allocation Level}, OPD identifies regions with low marginal utility and concentrates updates on modules that are more critical to reasoning. Second, at the \textbf{Update-Direction Level}, OPD exhibits stronger low-rank concentration, with its dominant subspaces aligning closely with the final update subspace early in training. Building on these findings, we propose \textbf{EffOPD}, a plug-and-play acceleration method that speeds up OPD by adaptively selecting an extrapolation step size and moving along the current update direction. EffOPD requires no additional trainable modules or complex hyperparameter tuning, and achieves an average training acceleration of $3\times$ while maintaining comparable final performance. Overall, our findings provide a parameter-dynamics perspective for understanding the efficiency of OPD and offer practical insights for designing more efficient post-training methods for large language models.

cs.CL↗

Is a team only as strong as its weakest link? Quantifying the short-board effect with AI Agents

The short-board effect, analogous to Liebig's Law of the Minimum, postulates that the collective performance of a team is constrained by its weakest component. This principle has profound implications for the optimization of collaboration in a variety of contexts, including management, education, and organizational structures. Despite its theoretical significance, empirical validation remains elusive due to challenges of assessing individual capabilities, controlling real-world variables, and data biases towards successful outcomes, as well as high employee turnover.To address this absence of knowledge, we employ multi-agents driven by large language models to simulate a teamwork with standard operating procedure, revealing the relationship between individual capability and collective team performance.In homogeneous team configurations, three capability regimes are observed, particularly the Sisyphus predicament state at the critical capability threshold characterized by extensive ineffective efforts and pseudo-high efficiency. Furthermore, with a single weak link quantifying the short-board effect, we highlight different impacts across core and non-core members on the team performance.More importantly, when the team exhibits multiple weak links, a cumulative product effect emerges, demonstrating that team performance is shaped by the aggregated impact of all weaknesses rather than the weakest link solely.This suggests that mitigation strategies should extend beyond the remediation of individual weak links.These findings rigorously elaborate the short-board theory and provide actionable insights to optimize team management, organizational operations, and supply chain resilience.

physics.soc-ph↗

SD2AIL: Adversarial Imitation Learning from Synthetic Demonstrations via Diffusion Models

Adversarial Imitation Learning (AIL) is a dominant framework in imitation learning that infers rewards from expert demonstrations to guide policy optimization. Although providing more expert demonstrations typically leads to improved performance and greater stability, collecting such demonstrations can be challenging in certain scenarios. Inspired by the success of diffusion models in data generation, we propose SD2AIL, which utilizes synthetic demonstrations via diffusion models. We first employ a diffusion model in the discriminator to generate synthetic demonstrations as pseudo-expert data that augment the expert demonstrations. To selectively replay the most valuable demonstrations from the large pool of (pseudo-) expert demonstrations, we further introduce a prioritized expert demonstration replay strategy (PEDR). The experimental results on simulation tasks demonstrate the effectiveness and robustness of our method. In particular, in the Hopper task, our method achieves an average return of 3441, surpassing the state-of-the-art method by 89. Our code will be available at https://github.com/positron-lpc/SD2AIL.

cs.LG↗

HumDial-EIBench: A Human-Recorded Multi-Turn Emotional Intelligence Benchmark for Audio Language Models

Evaluating the emotional intelligence (EI) of audio language models (ALMs) is critical. However, existing benchmarks mostly rely on synthesized speech, are limited to single-turn interactions, and depend heavily on open-ended scoring. This paper proposes HumDial-EIBench, a comprehensive benchmark for evaluating ALMs' EI. Using real-recorded human dialogues from the ICASSP 2026 HumDial Challenge, it reformulates emotional tracking and causal reasoning into multiple-choice questions with adversarial distractors, mitigating subjective scoring bias for cognitive tasks. It retains the generation of empathetic responses and introduces an acoustic-semantic conflict task to assess robustness against contradictory multimodal signals. Evaluations of eight ALMs reveal that most models struggle with multi-turn emotional tracking and implicit causal reasoning. Furthermore, all models exhibit decoupled textual and acoustic empathy, alongside a severe text-dominance bias during cross-modal conflicts.

eess.AS↗

Full-Duplex Interaction in Spoken Dialogue Systems: A Comprehensive Study from the ICASSP 2026 HumDial Challenge

Full-duplex interaction, where speakers and listeners converse simultaneously, is a key element of human communication often missing from traditional spoken dialogue systems. These systems, based on rigid turn-taking paradigms, struggle to respond naturally in dynamic conversations. The Full-Duplex Interaction Track of ICASSP 2026 Human-like Spoken Dialogue Systems Challenge (HumDial Challenge) aims to advance the evaluation of full-duplex systems by offering a framework for handling real-time interruptions, speech overlap, and dynamic turn negotiation. We introduce a comprehensive benchmark for full-duplex spoken dialogue systems, built from the HumDial Challenge. We release a high-quality dual-channel dataset of real human-recorded conversations, capturing interruptions, overlapping speech, and feedback mechanisms. This dataset forms the basis for the HumDial-FDBench benchmark, which assesses a system's ability to handle interruptions while maintaining conversational flow. Additionally, we create a public leaderboard to compare the performance of open-source and proprietary models, promoting transparent, reproducible evaluation. These resources support the development of more responsive, adaptive, and human-like dialogue systems.

eess.AS↗

Wan-Image: Pushing the Boundaries of Generative Visual Intelligence

We present Wan-Image, a unified visual generation system explicitly engineered to paradigm-shift image generation models from casual synthesizers into professional-grade productivity tools. While contemporary diffusion models excel at aesthetic generation, they frequently encounter critical bottlenecks in rigorous design workflows that demand absolute controllability, complex typography rendering, and strict identity preservation. To address these challenges, Wan-Image features a natively unified multi-modal architecture by synergizing the cognitive capabilities of large language models with the high-fidelity pixel synthesis of diffusion transformers, which seamlessly translates highly nuanced user intents into precise visual outputs. It is fundamentally powered by large-scale multi-modal data scaling, a systematic fine-grained annotation engine, and curated reinforcement learning data to surpass basic instruction following and unlock expert-level professional capabilities. These include ultra-long complex text rendering, hyper-diverse portrait generation, palette-guided generation, multi-subject identity preservation, coherent sequential visual generation, precise multi-modal interactive editing, native alpha-channel generation, and high-efficiency 4K synthesis. Across diverse human evaluations, Wan-Image exceeds Seedream 5.0 Lite and GPT Image 1.5 in overall performance, reaching parity with Nano Banana Pro in challenging tasks. Ultimately, Wan-Image revolutionizes visual content creation across e-commerce, entertainment, education, and personal productivity, redefining the boundaries of professional visual synthesis.

cs.CV↗

ORBIT: On-policy Exploration-Exploitation for Controllable Multi-Budget Reasoning

Recent Large Reasoning Models (LRMs) achieve strong performance by leveraging long-form Chain-of-Thought (CoT) reasoning, but uniformly applying overlong reasoning at inference time incurs substantial and often unnecessary computational cost. To address this, prior work explores various strategies to infer an appropriate reasoning budget from the input. However, such approaches are unreliable in the worst case, as estimating the minimal required reasoning effort is fundamentally difficult, and they implicitly fix the trade-off between reasoning cost and accuracy during training, limiting flexibility under varying deployment scenarios. Motivated by these limitations, we propose ORBIT, a controllable multi-budget reasoning framework with well-separated reasoning modes triggered by input. ORBIT employs multi-stage reinforcement learning to discover Pareto-optimal reasoning behaviors at each effort, followed by on-policy distillation to fuse these behaviors into a single unified model. Experiments show that ORBIT achieves (1) controllable reasoning behavior over multiple modes, (2) competitive reasoning density within each mode, and (3) integration of these frontier policies into a single unified student model while preserving clear mode separation and high per-mode performance.

cs.LG↗

CodeSpecBench: Benchmarking LLMs for Executable Behavioral Specification Generation

Large language models (LLMs) can generate code from natural language, but the extent to which they capture intended program behavior remains unclear. Executable behavioral specifications, defined via preconditions and postconditions, provide a concrete means to assess such understanding. However, existing work on specification generation is constrained in evaluation methodology, task settings, and specification expressiveness. We introduce CodeSpecBench, a benchmark for executable behavioral specification generation under an execution-based evaluation protocol. CodeSpecBench supports both function-level and repository-level tasks and encodes specifications as executable Python functions. Constructed from diverse real-world codebases, it enables a realistic assessment of both correctness (accepting valid behaviors) and completeness (rejecting invalid behaviors). Evaluating 15 state-of-the-art LLMs on CodeSpecBench, we observe a sharp performance degradation on repository-level tasks, where the best model attains only a 20.2% pass rate. We further find that specification generation is substantially more challenging than code generation, indicating that strong coding performance does not necessarily reflect deep understanding of intended program semantics. Our data and code are available at https://github.com/SparksofAGI/CodeSpecBench.

cs.SE↗

A Survey of Mamba

As one of the most representative DL techniques, Transformer architecture has empowered numerous advanced models, especially the large language models (LLMs) that comprise billions of parameters, becoming a cornerstone in deep learning. Despite the impressive achievements, Transformers still face inherent limitations, particularly the time-consuming inference resulting from the quadratic computation complexity of attention calculation. Recently, a novel architecture named Mamba, drawing inspiration from classical state space models (SSMs), has emerged as a promising alternative for building foundation models, delivering comparable modeling abilities to Transformers while preserving near-linear scalability concerning sequence length. This has sparked an increasing number of studies actively exploring Mamba's potential to achieve impressive performance across diverse domains. Given such rapid evolution, there is a critical need for a systematic review that consolidates existing Mamba-empowered models, offering a comprehensive understanding of this emerging model architecture. In this survey, we therefore conduct an in-depth investigation of recent Mamba-associated studies, covering three main aspects: the advancements of Mamba-based models, the techniques of adapting Mamba to diverse data, and the applications where Mamba can excel. Specifically, we first review the foundational knowledge of various representative deep learning models and the details of Mamba-1&2 as preliminaries. Then, to showcase the significance of Mamba for AI, we comprehensively review the related studies focusing on Mamba models' architecture design, data adaptability, and applications. Finally, we present a discussion of current limitations and explore various promising research directions to provide deeper insights for future investigations.

cs.LG↗

AppellateGen: A Benchmark for Appellate Legal Judgment Generation

Legal judgment generation is a critical task in legal intelligence. However, existing research in legal judgment generation has predominantly focused on first-instance trials, relying on static fact-to-verdict mappings while neglecting the dialectical nature of appellate (second-instance) review. To address this, we introduce AppellateGen, a benchmark for second-instance legal judgment generation comprising 7,351 case pairs. The task requires models to draft legally binding judgments by reasoning over the initial verdict and evidentiary updates, thereby modeling the causal dependency between trial stages. We further propose a judicial Standard Operating Procedure (SOP)-based Legal Multi-Agent System (SLMAS) to simulate judicial workflows, which decomposes the generation process into discrete stages of issue identification, retrieval, and drafting. Experimental results indicate that while SLMAS improves logical consistency, the complexity of appellate reasoning remains a substantial challenge for current LLMs. The dataset and code are publicly available at: https://anonymous.4open.science/r/AppellateGen-5763.

cs.CY↗

RRAT J1541+4703: A Rotating Radio Transient Exhibiting Normal Pulsar States

Rotating Radio Transients (RRATs) are a class of pulsar-like objects characterized by intermittent radio emissions. Among them, RRATs that exhibit both RRAT and normal pulsar (NP) states may represent a key evolutionary stage from nulling pulsars to RRATs. We performed a detailed analysis of RRAT J1574+4703 using the Five-hundred-meter Aperture Spherical Radio Telescope (FAST) at a frequency of 1250 MHz. Our findings indicate that this RRAT spends approximately 98% of its time in the RRAT state, with the remainder spent in an NP state exhibiting nulling behavior. Additionally, we observed distinct integral pulse profiles and polarization properties between the two states, suggesting that they originate from different emission heights and magnetospheric structures. Furthermore, it was observed that the NP states of this RRAT exhibit mode switching, with ~44% of the time spent in the normal mode and ~39% in the abnormal mode. Notably, abnormal modes are predominantly detected at the onset and termination of the NP states. This discrepancy between the modes indicates potential instability in the magnetospheric processes that govern the NP states.

astro-ph.HE↗

The annular gap model under a rotating dipole field approximation: simulating gamma-ray light curve

A more realistic description of the magnetosphere is crucial for understanding the radiation emitted by pulsars. In this paper, we revisit the annular gap model by employing a rotating dipole field, which is more realistic than the static dipole field, as an approximation of the magnetic structure of the pulsar magnetosphere. Compared with the static dipole field approximation, the open field-line region, including both the core and annular gaps, is significantly enlarged, and the two regions become asymmetric with respect to the fiducial plane. We apply this model to three young gamma-ray pulsars with distinct light-curve morphologies, PSRs J0631$+$1036 (single peak), J1709$-$4429 (double peaks), and J1048$-$5832 (three peaks). Using viewing geometries constrained by radio polarization measurements, the annular gap model within the rotating dipole field successfully reproduces the main morphological features of their gamma-ray light curves above 0.1 GeV. Our model provides a framework for interpreting pulsar high-energy emission, which can be used to analyze the emission properties of high-energy pulsars.

astro-ph.HE↗

Asymptotics of the principal eigenvalue of an elliptic operator on closed and orientable Riemannian manifolds

This paper investigates the asymptotic behavior of the principal eigenvalue $λ(s)$, as $s\to+\infty$, for the following elliptic eigenvalue problem \begin{equation*}\label{E} -Δ_{M}u-s\langle \nabla_M f, \nabla_M u\rangle_g +c u=λ(s)u, \end{equation*} defined on an orientable and closed Riemannian manifold $(M,g)$. Assuming $f$ is a Morse function defined on $M$, we find that the limit $\lim\limits_{s\to+\infty} λ(s)$ is determined by the minimum value of the function $c$ over the set of the maximum points of $f$, a result that is independent of the curvature of manifold.

math.AP↗

TextOVSR: Text-Guided Real-World Opera Video Super-Resolution

Many classic opera videos exhibit poor visual quality due to the limitations of early filming equipment and long-term degradation during storage. Although real-world video super-resolution (RWVSR) has achieved significant advances in recent years, directly applying existing methods to degraded opera videos remains challenging. The difficulties are twofold. First, accurately modeling real-world degradations is complex: simplistic combinations of classical degradation kernels fail to capture the authentic noise distribution, while methods that extract real noise patches from external datasets are prone to style mismatches that introduce visual artifacts. Second, current RWVSR methods, which rely solely on degraded image features, struggle to reconstruct realistic and detailed textures due to a lack of high-level semantic guidance. To address these issues, we propose a Text-guided Dual-Branch Opera Video Super-Resolution (TextOVSR) network, which introduces two types of textual prompts to guide the super-resolution process. Specifically, degradation-descriptive text, derived from the degradation process, is incorporated into the negative branch to constrain the solution space. Simultaneously, content-descriptive text is incorporated into a positive branch and our proposed Text-Enhanced Discriminator (TED) to provide semantic guidance for enhanced texture reconstruction. Furthermore, we design a Degradation-Robust Feature Fusion (DRF) module to facilitate cross-modal feature fusion while suppressing degradation interference. Experiments on our OperaLQ benchmark show that TextOVSR outperforms state-of-the-art methods both qualitatively and quantitatively. The code is available at https://github.com/ChangHua0/TextOVSR.

cs.CV↗

FedBPrompt: Federated Domain Generalization Person Re-Identification via Body Distribution Aware Visual Prompts

Federated Domain Generalization for Person Re-Identification (FedDG-ReID) learns domain-invariant representations from decentralized data. While Vision Transformer (ViT) is widely adopted, its global attention often fails to distinguish pedestrians from high similarity backgrounds or diverse viewpoints -- a challenge amplified by cross-client distribution shifts in FedDG-ReID. To address this, we propose Federated Body Distribution Aware Visual Prompt (FedBPrompt), introducing learnable visual prompts to guide Transformer attention toward pedestrian-centric regions. FedBPrompt employs a Body Distribution Aware Visual Prompts Mechanism (BAPM) comprising: Holistic Full Body Prompts to suppress cross-client background noise, and Body Part Alignment Prompts to capture fine-grained details robust to pose and viewpoint variations. To mitigate high communication costs, we design a Prompt-based Fine-Tuning Strategy (PFTS) that freezes the ViT backbone and updates only lightweight prompts, significantly reducing communication overhead while maintaining adaptability. Extensive experiments demonstrate that BAPM effectively enhances feature discrimination and cross-domain generalization, while PFTS achieves notable performance gains within only a few aggregation rounds. Moreover, both BAPM and PFTS can be easily integrated into existing ViT-based FedDG-ReID frameworks, making FedBPrompt a flexible and effective solution for federated person re-identification. The code is available at https://github.com/leavlong/FedBPrompt.

cs.CV↗