Searcharxiv⌕ Search

arXiv subjects

Jie Tang

Publications and source records attributed to Jie Tang.

At least 73 records · Page 4Linked to original sources

RotMoLE: Enhancing Mixture of Low-Rank Experts through Rotational Gating Mechanism

While Large Language Models (LLMs) are commonly fine-tuned to handle domain-specific tasks before being applied to vertical applications, adapting them to complex scenarios with diverse specialized knowledge remains challenging. Meanwhile, Mixture-of-Experts (MoE) architecture has risen as a crucial paradigm for training LLMs, and some recent works have also incorporated MoE into Parameter-Efficient Fine-Tuning (PEFT) to propose the Mixture of Low-rank Experts (MoE-LoRA), to enhance the power of low-rank adapters for learning complicated knowledge. However, conventional gating mechanisms in MoE typically apply only a scalar reweighing to selected experts, thereby limiting their underlying capacity of representation and generalization. Motivated and enabled by the low-rank structures in MoE-LoRA, we propose RotMoLE, a specialized MoE framework for low-rank experts featuring an additional rotation gate. Beyond simple scaling, RotMoLE implements a rotation mechanism for each selected expert, enabling superior expert exploitation and specialization for learning diverse data, especially when expert candidates are limited. Empirical results on complex multi-task and multilingual training scenarios validate our effectiveness.

cs.LG↗

Scalable Fluid Antenna Systems: A New Paradigm for Array Signal Processing

Most existing antenna array-based source localization methods rely on fixed-position arrays (FPAs) and strict assumptions about source field conditions (near-field or far-field), which limits their effectiveness in complex, dynamic real-world scenarios where high-precision localization is required. In contrast, this paper introduces a novel scalable fluid antenna system (SFAS) that can dynamically adjust its aperture configuration to optimize performance for different localization tasks. Within this framework, we develop a two-stage source localization strategy based on the exact spatial geometry (ESG) model: the first stage uses a compact aperture configuration for initial direction-of-arrival (DOA) estimation, while the second stage employs an expanded aperture for enhanced DOA and range estimation. The proposed approach eliminates the traditional need for signal separation or isolation to classify source types and enables a single SFAS array to achieve high localization accuracy without field-specific assumptions, model simplifications, or approximations, representing a new paradigm in array-based source localization. Extensive simulations demonstrate the superiority of the proposed method in terms of localization accuracy, computational efficiency, and robustness to different source types.

eess.SP↗

Sparse Fluid Antenna Arrays: Continuous Position Design Beyond Classical DOF Limits

Fluid antenna system (FAS), which continuously repositions a single physical element across a deployment region $[0, D]$, breaks this limit by freeing antenna positions from the discrete grid entirely. This paper establishes the theoretical foundations of sparse FAS design for direction-of-arrival (DOA) estimation and shows that continuous position freedom unlocks three compounding advantages over the classical designs. \emph{First}, we derive a universal dual DOF bound and prove that FAS-optimized positions can approach it, growing the DOF linearly with $D/λ$ , where $λ$ is the signal wavelength, rather than saturating at $O(N^2)$. \emph{Second}, the CRB scales as $O(1/D^{2L})$ for $L$ sources, a $(D/(N^2 d_0))^{2L}$ improvement over the best grid design, with $d_0 = λ/2$ and D-optimal positions admitting closed-form solution for single sources and efficient Frank-Wolfe algorithm for multiple sources. \emph{Third}, we propose a two-stage FAS-MUSIC approach that combines coarray MUSIC disambiguation with full-aperture local maximum likelihood (ML) refinement to track the CRB, overcoming the grating-lobe ambiguity inherent in large-aperture non-uniform arrays. Robustness to minimum spacing constraints, mutual coupling, and finite position accuracy is also analyzed. Extensive simulations show that FAS-MUSIC achieves $17.5\times$ lower root mean squared error (RMSE) than uniform linear array (ULA) MUSIC and that FAS with $4$ antennas outperforms MRA with $8$ antennas, gains that are unattainable by any grid-constrained design.

eess.SP↗

How Many Independent Modes Does a Fluid Antenna Have? A Closed-Form Outage Analysis via Equivalent Degrees of Freedom

In a fluid antenna system (FAS), a single reconfigurable antenna is able to activate one of $N$ correlated ports to exploit spatial diversity. However, outage analysis is challenging because exact evaluation requires an $N$-dimensional multivariate integral, while existing closed-form approximations based on block-correlation models tend to underestimate the true outage probability. This paper shows that the spatial correlation matrix of a FAS with a normalized linear aperture length $W$ has at most $K^{*}=2\lceil W\rceil+1$ significant eigenmodes, regardless of the number of deployed ports. This is a spatial counterpart of the Slepian-Landau-Pollak spectral concentration theorem and reveals that the spatial degrees of freedom are determined by aperture size rather than port count. Motivated by this result, we derive an \emph{equivalent degree of freedom} (EDoF) approximation, under which the outage probability can be expressed in closed form as that of selection combining over $K^{*}$ independent branches. We propose a refined \emph{weighted independent modes} (WIM) approximation, to incorporate eigenvalue-dependent branch weights $\{β_k\}$ and yield a product-form closed-form expression with improved accuracy at moderate signal-to-noise ratio (SNR). Both approximations achieve the exact diversity order, become asymptotically exact at high SNR, and provably never underestimate the true outage probability by Anderson's inequality. The proposed framework is further extended to obtain closed-form expressions for ergodic capacity, characterize multi-user fluid antenna multiple access (FAMA) with explicit interference-limited outage floors. Besides, we analyze two-dimensional planar FAS, for which the diversity order scales multiplicatively with the aperture dimensions.

eess.SP↗

HyperTea: A Hypergraph-based Temporal Enhancement and Alignment Network for Moving Infrared Small Target Detection

In practical application scenarios, moving infrared small target detection (MIRSTD) remains highly challenging due to the target's small size, weak intensity, and complex motion pattern. Existing methods typically only model low-order correlations between feature nodes and perform feature extraction and enhancement within a single temporal scale. Although hypergraphs have been widely used for high-order correlation learning, they have received limited attention in MIRSTD. To explore the potential of hypergraphs and enhance multi-timescale feature representation, we propose HyperTea, which integrates global and local temporal perspectives to effectively model high-order spatiotemporal correlations of features. HyperTea consists of three modules: the global temporal enhancement module (GTEM) realizes global temporal context enhancement through semantic aggregation and propagation; the local temporal enhancement module (LTEM) is designed to capture local motion patterns between adjacent frames and then enhance local temporal context; additionally, we further develop a temporal alignment module (TAM) to address potential cross-scale feature misalignment. To our best knowledge, HyperTea is the first work to integrate convolutional neural networks (CNNs), recurrent neural networks (RNNs), and hypergraph neural networks (HGNNs) for MIRSTD, significantly improving detection performance. Experiments on DAUB and IRDST demonstrate its state-of-the-art (SOTA) performance. Our source codes are available at https://github.com/Lurenjia-LRJ/HyperTea.

cs.CV↗

MotionBench: Benchmarking and Improving Fine-grained Video Motion Understanding for Vision Language Models

In recent years, vision language models (VLMs) have made significant advancements in video understanding. However, a crucial capability - fine-grained motion comprehension - remains under-explored in current benchmarks. To address this gap, we propose MotionBench, a comprehensive evaluation benchmark designed to assess the fine-grained motion comprehension of video understanding models. MotionBench evaluates models' motion-level perception through six primary categories of motion-oriented question types and includes data collected from diverse sources, ensuring a broad representation of real-world video content. Experimental results reveal that existing VLMs perform poorly in understanding fine-grained motions. To enhance VLM's ability to perceive fine-grained motion within a limited sequence length of LLM, we conduct extensive experiments reviewing VLM architectures optimized for video feature compression and propose a novel and efficient Through-Encoder (TE) Fusion method. Experiments show that higher frame rate inputs and TE Fusion yield improvements in motion understanding, yet there is still substantial room for enhancement. Our benchmark aims to guide and motivate the development of more capable video understanding models, emphasizing the importance of fine-grained motion comprehension. Project page: https://motion-bench.github.io .

cs.CV↗

GLM-5V-Turbo: Toward a Native Foundation Model for Multimodal Agents

We present GLM-5V-Turbo, a step toward native foundation models for multimodal agents. As foundation models are increasingly deployed in real environments, agentic capability depends not only on language reasoning, but also on the ability to perceive, interpret, and act over heterogeneous contexts such as images, videos, webpages, documents, GUIs. GLM-5V-Turbo is built around this objective: multimodal perception is integrated as a core component of reasoning, planning, tool use, and execution, rather than as an auxiliary interface to a language model. This report summarizes the main improvements behind GLM-5V-Turbo across model design, multimodal training, reinforcement learning, toolchain expansion, and integration with agent frameworks. These developments lead to strong performance in multimodal coding, visual tool use, and framework-based agentic tasks, while preserving competitive text-only coding capability. More importantly, our development process offers practical insights for building multimodal agents, highlighting the central role of multimodal perception, hierarchical optimization, and reliable end-to-end verification.

cs.CV↗

RG-Consistent (P)NJL Model: Impact of Thermal Cutoff Modifications on Thermodynamics and Net-Baryon Number Fluctuations

In this paper, we investigate the impact of renormalization group (RG) consistency on the chiral phase transition and thermodynamic properties of QCD matter using the RGNJL and RGPNJL models. By implementing a temperature-dependent thermal cutoff $Λ_T = kΛ_0$, we ensure that thermodynamic quantities converge toward the Stefan-Boltzmann limit at high temperatures, effectively extending the applicability of these effective theories. Our analysis shows that while the RG-consistency condition ($k \rightarrow \infty$) resolves causality violations in the RGNJL model by binding the speed of sound to the conformal limit, the RGPNJL model exhibits a more complex, non-monotonic sensitivity to the parameter $k$. Furthermore, we demonstrate that the RG-improved PNJL framework significantly enhances the description of net-baryon number fluctuations ($κσ^2$) relative to lattice QCD data at vanishing chemical potential, though the intensification of these fluctuations at high baryon density highlights a critical sensitivity to the model's parametric constraints. This study provides a rigorous evaluation of the RG-consistency framework's predictive power in mapping the QCD phase diagram and interpreting experimental observables.

hep-ph↗

RPC-Bench: A Fine-grained Benchmark for Research Paper Comprehension

Understanding research papers remains challenging for foundation models due to specialized scientific discourse and complex figures and tables, yet existing benchmarks offer limited fine-grained evaluation at scale. To address this gap, we introduce RPC-Bench, a large-scale question-answering benchmark built from review-rebuttal exchanges of high-quality computer science papers, containing 15K human-verified QA pairs. We design a fine-grained taxonomy aligned with the scientific research flow to assess models' ability to understand and answer why, what, and how questions in scholarly contexts. We also define an elaborate LLM-human interaction annotation framework to support large-scale labeling and quality control. Following the LLM-as-a-Judge paradigm, we develop a scalable framework that evaluates models on correctness-completeness and conciseness, with high agreement to human judgment. Experiments reveal that even the strongest models (GPT-5) achieve only 68.2% correctness-completeness, dropping to 37.46% after conciseness adjustment, highlighting substantial gaps in precise academic paper understanding. Our code and data are available at https://rpc-bench.github.io/.

cs.CL↗

HoWToBench: Holistic Evaluation for LLM's Capability in Human-level Writing using Tree of Writing

Evaluating the writing capabilities of large language models (LLMs) remains a significant challenge due to the multidimensional nature of writing skills and the limitations of existing metrics. LLM's performance in thousand-words level and open-ended writing is inadequately assessed by traditional reference-based metrics or modern LLM-as-a-judge methods. We propose Tree-of-Writing (ToW), to resolve the implicit inconsistency often found when LLM-as-a-judge aggregates all sub-features in text evaluation. ToW incorporates a tree-structured workflow by explicitly modeling the aggregation weights of sub-features. We also present HowToBench, a large-scale Chinese writing benchmark encompassing 12 genres and 1302 instructions across three task categories: contextual completion, outline-guided writing, and open-ended generation. ToW successfully mitigates the biases, achieving a 0.93 Pearson correlation with human judgments. Furthermore, we detect that both overlap-based text generation metrics and popular LLM-as-a-judge practices are vulnerable to textual disturbances, while ToW is robust to them. We also uncover a negative correlation between input length and content-related scores in the Guide task, showcasing that it cannot be simply improved by input-side information piling.

cs.CL↗

Beyond Literal Mapping: Benchmarking and Improving Non-Literal Translation Evaluation

Large Language Models (LLMs) have significantly advanced Machine Translation (MT), applying them to linguistically complex domains-such as Social Network Services, literature etc. In these scenarios, translations often require handling non-literal expressions, leading to the inaccuracy of MT metrics. To systematically investigate the reliability of MT metrics, we first curate a meta-evaluation dataset focused on non-literal translations, namely MENT. MENT encompasses four non-literal translation domains and features source sentences paired with translations from diverse MT systems, with 7,530 human-annotated scores on translation quality. Experimental results reveal the inaccuracies of traditional MT metrics and the limitations of LLM-as-a-Judge, particularly the knowledge cutoff and score inconsistency problem. To mitigate these limitations, we propose RATE, a novel agentic translation evaluation framework, centered by a reflective Core Agent that dynamically invokes specialized sub-agents. Experimental results indicate the efficacy of RATE, achieving an improvement of at least 3.2 points in combined system- and segment-level correlation with human judgments compared with current methods. Further experiments demonstrate the robustness of RATE to general-domain MT evaluation. Code and dataset are available at: https://github.com/BITHLP/RATE.

cs.CL↗

Data-Efficient RLVR via Off-Policy Influence Guidance

Data selection is a critical aspect of Reinforcement Learning with Verifiable Rewards (RLVR) for enhancing the reasoning capabilities of large language models (LLMs). Current data selection methods are largely heuristic-based, lacking theoretical guarantees and generalizability. This work proposes a theoretically-grounded approach using influence functions to estimate the contribution of each data point to the learning objective. To overcome the prohibitive computational cost of policy rollouts required for online influence estimation, we introduce an off-policy influence estimation method that efficiently approximates data influence using pre-collected offline trajectories. Furthermore, to manage the high-dimensional gradients of LLMs, we employ sparse random projection to reduce dimensionality and improve storage and computation efficiency. Leveraging these techniques, we develop \textbf{C}urriculum \textbf{R}L with \textbf{O}ff-\textbf{P}olicy \text{I}nfluence guidance (\textbf{CROPI}), a multi-stage RL framework that iteratively selects the most influential data for the current policy. Experiments on models up to 7B parameters demonstrate that CROPI significantly accelerates training. On a 1.5B model, it achieves a 2.66x step-level acceleration while using only 10\% of the data per stage compared to full-dataset training. Our results highlight the substantial potential of influence-based data selection for efficient RLVR.

cs.LG↗

A new approach to dark photon

Over the past few decades, the hypothetically dark photon has been extensively studied from both phenomenological and experimental perspectives. It should be noted that the local symmetry for dark photon does not gauge the standard model Higgs scalar and chiral fermions. In this paper, we show that an artificially introduced $U(1)_X$ gauge group for dark photon and the standard model $U(1)_Y$ gauge group for hypercharge can be simultaneously born from two $U(1)_1\times U(1)_2$ gauge groups under which the standard model scalar and fermions carry the same $U(1)_1$ and $U(1)_2$ charges without causing any gauge anomalies. We further introduce a spontaneously broken mirror symmetry between the $U(1)_1$ and $U(1)_2$ gauge groups so that the $U(1)_1$ and $U(1)_2$ gauge couplings can acquire a small difference at one-loop level and hence the $U_X \times U_Y$ kinetic mixing can be highly suppressed in a natural way.

hep-ph↗

Infrastructure First: Enabling Embodied AI for Science in the Global South

Embodied AI for Science (EAI4S) brings intelligence into the laboratory by uniting perception, reasoning, and robotic action to autonomously run experiments in the physical world. For the Global South, this shift is not about adopting advanced automation for its own sake, but about overcoming a fundamental capacity constraint: too few hands to run too many experiments. By enabling continuous, reliable experimentation under limits of manpower, power, and connectivity, EAI4S turns automation from a luxury into essential scientific infrastructure. The main obstacle, however, is not algorithmic capability. It is infrastructure. Open-source AI and foundation models have narrowed the knowledge gap, but EAI4S depends on dependable edge compute, energy-efficient hardware, modular robotic systems, localized data pipelines, and open standards. Without these foundations, even the most capable models remain trapped in well-resourced laboratories. This article argues for an infrastructure-first approach to EAI4S and outlines the practical requirements for deploying embodied intelligence at scale, offering a concrete pathway for Global South institutions to translate AI advances into sustained scientific capacity and competitive research output.

cs.CY↗

Fundamental Analysis of Scalable Fluid Antenna Systems: Identifiability Limits, Information Theory, and Joint Processing

Unlike fixed-position arrays with static observation entropy, the scalable fluid antenna system (S-FAS) can dynamically adjust its aperture to form different observation spaces with configuration-dependent entropy budgets. This reconfigurability requires an information-theoretic framework beyond traditional algebraic identifiability analysis. This paper establishes an observation entropy framework for S-FAS, which unifies the derivation of identifiability limits, the diagnosis of processing bottlenecks, and system design optimization. For an S-FAS with mutual coupling suppression, we derive a complete capacity hierarchy among compressed, extended, and jointly stacked configurations. The entropy framework reveals that sequential two-stage processing suffers from an information bottleneck that restricts achievable capacity, while the noise entropy ratio can be used to distinguish fundamental performance limits from algorithmic deficiencies. A joint MUSIC algorithm is proposed to approach the theoretical joint capacity bound. Extensive Monte Carlo simulations, validated by both algebraic and information-theoretic criteria, verify the derived capacity hierarchy and identifiability boundaries.

eess.SP↗

Rotatable Antenna Enhanced Multicast Communication System

Rotatable antenna (RA) provides additional spatial degrees of freedom (DoFs) for communication systems by enabling per-antenna dynamic boresight adjustment, which is attractive for fairness-oriented multicast transmission. This letter investigates an RA-enhanced downlink multi-group multicast system. Specifically, we aim to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among all users by jointly optimizing the multicast beamforming vectors and the RA boresight directions under transmit power and rotation constraints. To solve this non-convex problem, we first reformulate the max-min SINR objective via quadratic transform. Then, we develop an alternating optimization (AO) algorithm that iteratively updates the multicast beamforming and RA boresight directions. The beamforming vectors are obtained from a convex subproblem, while the boresight directions are refined using a successive convex approximation (SCA) procedure. Simulation results verify that the proposed RA-based scheme substantially enhances the fairness performance compared with fixed antenna-based and random-orientation benchmarks.

cs.IT↗

Sensitivity of the RECODE Reactor CEvNS Experiment to the Dark Axion Portal

Reactor CEvNS experiments provide a powerful probe of the physics beyond the Standard Model (BSM) with the intense flux of neutrinos, photons, and other particles produced in nuclear reactors. In this work, we investigate the sensitivity of reactor CEvNS experiments to the dark axion portal, which connects the axion or axion-like particle to the dark photon. We focus in particular on the RECODE experiment, while also considering other reactor-based experiments such as CONUS and MINER. We find that reactor CEvNS experiments offer enhanced sensitivity in the sub-MeV region compared with the existing constraints from B factories, and can probe the portal coupling down to $\mathcal{O}(10^{-3})$ for $G_{aγγ'}$.

hep-ph↗

SCAIL: Towards Studio-Grade Character Animation via In-Context Learning of 3D-Consistent Pose Representations

Achieving controllable character animation that meets studio-grade standards remains challenging despite recent progress. Existing approaches can transfer motion from a driving video to a reference image, but often fail to preserve structural fidelity and temporal consistency in wild scenarios involving complex motion and cross-identity animations. In this work, we present \textbf{SCAIL} (a framework toward \textbf{S}tudio-grade \textbf{C}haracter \textbf{A}nimation via \textbf{I}n-context \textbf{L}earning), which is designed to address these challenges from two key innovations. First, we propose a novel 3D pose representation, providing a robust and flexible motion signal. Second, we introduce a full-context pose injection mechanism within a diffusion-transformer, enabling effective spatio-temporal reasoning over full motion sequences. To align with studio-grade requirements, we develop a curated data pipeline ensuring both diversity and quality, and establish a comprehensive benchmark for systematic evaluation. Experiments show that \textbf{SCAIL} achieves state-of-the-art performance and advances character animation toward studio-grade controlling. Code and model are available at \href{https://github.com/zai-org/SCAIL}{zai-org/SCAIL}.

cs.CV↗