Searcharxiv⌕ Search

arXiv subjects

Liang Yang

Publications and source records attributed to Liang Yang.

At least 19 recordsLinked to original sources

The Straight and Narrow: Do LLMs Possess an Internal Moral Path?

Enhancing the moral alignment of Large Language Models (LLMs) is a critical challenge in AI safety. Current alignment techniques often act as superficial guardrails, leaving the intrinsic moral representations of LLMs largely untouched. In this paper, we bridge this gap by leveraging Moral Foundations Theory (MFT) to map and manipulate the fine-grained moral landscape of LLMs. Through cross-lingual linear probing, we validate the shared nature of moral representations in middle layers and uncover a shared yet different moral subspace between English and Chinese. Building upon this, we extract steerable Moral Vectors and successfully validate their efficacy at both internal and behavioral levels. Leveraging the high generalizability of morality, we propose Adaptive Moral Fusion (AMF), a dynamic inference-time intervention that synergizes probe detection with vector injection to tackle the safety-helpfulness trade-off. Empirical results confirm that our approach acts as a targeted intrinsic defense, effectively reducing incorrect refusals on benign queries while minimizing jailbreak success rates compared to standard baselines.

cs.CL↗

Magnetoelectric Exchange Spring for Spin-Wave Logic with Ultralow Energy Consumption

Spin waves (magnons) are intrinsically free of Joule heating during their propagation in magnets. Exploring, understanding, and manipulating such quasiparticles not only helps reveal the exotic magnonic phenomena in condensed matter physics but also underpins the development of information devices with low energy consumption. However, achieving low-power and scalable control of spin-wave propagation remains a critical challenge. Herein, a magnetoelectric exchange spring has been artificially designed and constructed across an interface between ferroelectric BaTiO3 and ferromagnetic (La,Sr)MnO3 with low magnetic damping, in which polarization-modulated orbital reconstruction tailors local magnetic anisotropy and enables reversible control of spin-wave propagation. By successfully deviating from the Janovec-Kay-Dunn law, reversal polarization of engineered BaTiO3 (Ps~1.2 uC cm^-2, Vc~0.4 V) is sufficient to switch the coherent magnon transport in the (La,Sr)MnO3, indicating the magnetoelectric heterointerface may serve as a promising candidate for atto-joule control of spin-wave propagation (normalized to a 10*10 nm^2 device). Furthermore, taking advantage of amplitude, phase, and frequency to encode spin waves, all 16 compact Boolean logics with ultralow energy consumption have been designed. The artificial magnetoelectric exchange spring can be broadly applicable to various material choices, offering a versatile platform for developing energy-efficient and integrated magnonic devices.

cond-mat.mtrl-sci↗

VisualTrust: Video Reasoning under On-Screen Claim Framing

On-screen text can describe what a video shows, or it can frame what the video is supposed to mean. Current benchmarks treat both alike, testing whether a model can read the text rather than whether it should trust it. We study claim deference, multimodal large language models' tendency to let an on-screen claim override conflicting visual evidence. We introduce VisualTrust, a counterfactual benchmark with 5,063 cases across 14 claim-fact classes. Each case pairs a question with three versions of the same video: one with no claim, one with an accurate claim, and one with a misleading claim that alters a single grounded fact. The option the misleading claim supports is the trap answer. Across seven open-weight and four proprietary models, mean accuracy falls from 90.1% without a claim to 51.9% with a misleading claim. Among initially correct responses, 42.8% flip to the trap answer and only 0.6% become other errors. Strong no-claim accuracy does not ensure resistance. We also introduce DEAR (Decoupled Evidence Arbitration and Reading), a training-free agent for video question answering that separates evidence arbitration from reading. An independent check reports conflicting evidence, a selector weighs it without a fixed modality priority and blinds what it withholds, and the reader answers from the resulting video in a fresh context. On 500 videos across three proprietary models, DEAR raises accuracy under misleading claims from 47.2--64.0% to 81.8--85.2% and reduces trap-answer selection from 34.4--50.8% to 11.6--15.0%, while preserving no-claim accuracy.

cs.CV↗

Frequentist and Bayesian population pharmacometrics: similarities, differences, and practical implications

Although the frequentist versus Bayesian debate has a long-standing history, and both are well-established approaches for inference, they are often considered separately in pharmacometric literature, with their theoretical and practical differences receiving limited direct comparison. We address this gap by providing a conceptual background and comparative evaluation of frequentist and Bayesian methods for parameter inference in pharmacometrics. First, we highlight the theoretical and algorithmic differences between approaches within a general and pharmacometric context. We then apply both to classical compartmental pharmacokinetic models using simulated and real data; initially through evaluating four inference methods (two frequentist, two Bayesian) across a range of simulated data conditions, followed by investigating each inference approach in the practical setting. The simulation studies facilitate evaluation of the sensitivity of the methods to sample size, number of observations, residual noise and inter-individual variability, comparing the performance with respect to relative error, confidence/credible interval coverage and bias in the estimated variability. The real-world data analysis further highlights how each approach quantifies and presents uncertainty estimates by examining this for both the parameter estimates and system dynamics. By providing a theoretical and practical comparison that highlights the similarities and differences between approaches, this work aims to lower the barrier to understanding and implementing Bayesian and frequentist inference in pharmacometrics.

stat.ME↗

Can Decision Models Understand Stance? Evaluating Jev Against General-Purpose LLMs

Stance detection requires identifying an author's attitude toward a given target, sometimes based on conversational context. Jev, a specialized decision model designed for structured decision-making, offers an alternative to general-purpose large language models (LLMs). In this work, we evaluate Jev on two stance detection datasets, VAST (English texts) and ZS-CSD (Chinese conversations), comparing it with four general-purpose LLMs and two fine-tuned models. Results show that Jev achieves competitive performance on VAST, matching GPT-5.6 and outperforming the other general-purpose LLMs. However, it falls behind stronger LLMs on ZS-CSD, particularly in distinguishing favor from against. Further analysis suggests that this limitation may be related to understanding reply relationships and stance direction rather than conversation length alone. These findings highlight both the potential and limitations of Jev for stance detection.

cs.CL↗

On the Sum of Inverse Gamma RVs and its Application to Wireless Communications Networks

Investigating the statistics of the sum of random variables (RVs) is fundamental in wireless communication systems, as it can be used to accurately estimate their performance. In this paper, exact closed-form expressions are derived for the probability density function (PDF) and cumulative distribution function (CDF) of the sum of inverse-gamma (IG) RVs. The IG distribution is especially suitable for performance analysis purposes because it provides a tractable yet accurate model of shadowing/local mean power variations. Unlike prior studies on sums of shadowing RVs, the resulting formulas are simple to evaluate and numerically stable. Their utility is demonstrated in two practical settings: unmanned aerial vehicle (UAV)-assisted networks and high-speed railway communications. Across all considered scenarios, the analytical results are in excellent agreement with the Monte Carlo simulation results, while the asymptotic approximations closely track the exact results

eess.SP↗

VisualNeedle: Benchmarking Active Visual Search in Information-Dense Scenes

Frontier multimodal large language models (MLLMs) have been reported to achieve over 90\% accuracy on fine-grained perception benchmarks. However, such scores do not necessarily imply faithful use of visual evidence. Prior studies have identified three shortcuts that inflate benchmark performance. First, linguistic priors and lexical cues in questions often enable models to infer plausible answers without seeing the image. Second, coarse global semantics from the visual encoder can bypass fine-grained local details. Third, in some ``think-with-images'' benchmarks, corrupting the intermediate images returned by visual tools barely affects the final answer. These findings suggest that higher input resolution or larger question pools alone do not elicit genuine active visual search. To address this, we introduce VisualNeedle, a challenging, information-dense, and fine-grained benchmark for scenes where critical evidence is spatially constrained to minute regions and not discernible at a glance. We further propose a counterfactual crop-black setting, which replaces crops returned by tools with black images of the same size, to test whether tool-enabled performance truly relies on intermediate visual evidence.We evaluate 9 prominent MLLMs across four settings: text-only, without tools, with tools, and crop-black. Text-only accuracy stays below 10\%, while accuracy without tools remains below 20\%. The best tool-enabled model reaches only 56.00\%, still trailing the 63.00\% human majority-vote accuracy. These results reveal persistent limitations in fine-grained visual search, while the crop-black ablation confirms that success on VisualNeedle hinges on genuine intermediate visual evidence.

cs.CV↗

SPR: Toward a Graph Foundation Model for Transferable Graph Cognition via Spectral Patterns and Relational Geometry

Recently, Graph Foundation Models (GFMs) have attracted increasing attention for their potential to learn unified and generalizable knowledge across diverse graphs, thereby supporting a wide range of graph scenarios. However, unlike natural language and images, graphs lack an intuitive and unified form for perceiving and organizing transferable knowledge. Therefore, despite many initial explorations, a key problem remains unresolved: the transferable cognitive mechanism for graphs. Existing GFMs usually rely on intuitively defined mechanisms to encode transferable graph patterns, such as handcrafted structural templates (e.g., cycles and trees), fixed propagation mechanisms, and predefined random-walk patterns. These mechanisms are often prescriptive and rigid, limiting their ability to flexibly characterize diverse graph patterns across domains. This motivates the exploration of a more flexible, graph-native, and transferable cognitive mechanism. To this end, we analyze graphs from the spectral perspective and propose SPR. SPR decomposes graph information into Chebyshev polynomial bases and learns shared spectral responses, enabling unified yet adaptive cognition of continuously varying spectral patterns across graphs. We further model cross-graph relational geometry to distill recurring pairwise organization from multiple graphs, providing a shared relational reference for transferring such graph cognition across domains. Extensive experiments across diverse graphs and downstream scenarios demonstrate that SPR enables effective and transferable graph cognition.

cs.LG↗

Secure Relay Low-Altitude Networks via Hybrid Fixed-Position and Rotatable Antenna Arrays

In this paper, a relay network with hybrid fixed-position and rotatable antenna arrays is proposed. The deployment of rotatable arrays in conventional relay networks is considered to provide more secure communications for low-altitude economy applications. Specifically, both the base station and the relay station are equipped with fixed-position antenna arrays and rotatable arrays to serve ground users and aerial users, respectively. To address the challenge of multi-user interference, a low-cost reconfigurable intelligent surface is exploited as a candidate path. Accordingly, under constraints on transmit power, user quality of service, rotatable range, and path selection, the objective is to maximize the worst-case secrecy rate (SR) through joint beamforming, power allocation, and rotatable antenna orientation design. First, the SR performance in the \textcolor{black}{single ground-aerial user pair scenario} is investigated, and a step-by-step leakage-based scheme is proposed. Then, the general multi-user scenario is studied, and a Distributional Soft Actor-Critic with Three refinements (DSAC-T)-based learning scheme, which supports hybrid discrete and continuous actions, is proposed to maximize the worst-case SR. Simulation results validate the effectiveness of the proposed schemes. The proposed schemes achieve approximately a twofold improvement in SR performance compared to isotropic antennas. \textcolor{black}{The proposed system can achieve approximately 99.7\% power saving, 55\% antenna saving, and can serve more users.}

eess.SP↗

Whitewashing Hate, Smearing Harmless Content: Annotator-Style Rebuttal Attacks on LLM-Based Moderation

Large language models (LLMs) are increasingly used for hate speech moderation, often within human--AI workflows in which reviewers provide feedback before a final decision. Such feedback introduces two manipulation directions: whitewashing hateful content as normal and smearing normal content as hateful. This study examines the susceptibility of initially correct model judgments to annotator-style rebuttals and analyzes whether attack effectiveness differs across manipulation directions. We introduce a rejudge protocol that extends direct contradiction with decision-boundary perturbations and adversarial rationales. Experiments with multiple LLMs on two hate speech datasets show that annotator-style rebuttals substantially degrade moderation performance, with stronger effects in multi-turn settings. The results further reveal stable, model-specific asymmetries between whitewashing and smearing across attack configurations, indicating distinct directional vulnerability patterns. Explicit reasoning prompts and defensive instructions reduce these effects but do not eliminate them. These findings highlight the need for direction-aware safeguards and dedicated feedback-robustness evaluation in human--AI moderation workflows.

cs.CL↗

Resource Allocation for Secure Dual-UAV-Assisted ISAC System

Integrated sensing and communication (ISAC) is a rising technology in the next wireless communication networks, enabling the simultaneous execution of communication and sensing tasks by fully utilizing limited spectrum resources. In this work, we investigate the secrecy performance of a dual-uncrewed aerial vehicle (UAV)-assisted secure ISAC system. Specifically, a base station UAV communicates with users and transmits radar signals to locate potential eavesdroppers, while simultaneously providing information to a jammer UAV to perform jamming tasks. Considering constraints such as maximum UAV velocity, transmit power, propulsion energy, and sensing thresholds, we maximize the average secrecy rate by optimizing user scheduling strategies, time allocation, transmit power, and UAV trajectories. The presence of a non-convex problem, originating from tightly coupled variables, is tackled by an efficient iterative algorithm. In particular, the original optimization problem is decomposed into six subproblems, and non-convex subproblems are transformed into approximately convex forms via successive convex approximation. Then, block coordinate descent techniques are employed to solve all subproblems sequentially. Numerical results demonstrate the convergence and effectiveness of the proposed algorithm.

cs.IT↗

MER 2026: From Discriminative Emotion Recognition to Generative Emotion Understanding

MER2026 marks the fourth edition of the MER series of challenges. The MER series provides valuable data resources to the research community and offers tasks centered on recent research trends, establishing itself as one of the largest challenges in the field. Throughout its history, the focus of MER has shifted from discriminative emotion recognition to generative emotion understanding. Specifically, MER2023 concentrated on discriminative emotion recognition, restricting the emotion recognition scope to fixed basic labels. In MER2024 and MER2025, we transitioned to generative emotion understanding and introduced two new tasks: fine-grained emotion recognition and descriptive emotion analysis, aiming to leverage the extensive vocabulary and multimodal understanding capabilities of Multimodal Large Language Models (MLLMs) to facilitate fine-grained and explainable emotion recognition. Building on this trajectory, MER2026 continues to follow these research trends and contains four tracks: MER-Cross shifts the focus from individual to dyadic interaction scenarios; MER-FG centers on fine-grained emotion recognition; MER-Prefer aims to predict human preferences regarding different emotion descriptions; MER-PS focuses on emotion recognition based on physiological signals. More details regarding the dataset and baselines are available at https://zeroqiaoba.github.io/MER-Challenge/.

cs.HC↗

Generalizable AI-Generated Image Detection Based on Fractal Self-Similarity in the Spectrum

With the rapid development of image synthesis techniques, AI-generated images have become increasingly realistic, which heightens the potential risk associated with their misuse and creates a growing need for reliable detection. However, the growing diversity of generative models makes it increasingly difficult for detectors to generalize to images produced by unseen generators. Most existing methods rely on artifacts associated with specific generators, which limits their generalization to images produced by unseen models. To address this problem, we investigate structural characteristics arising from the image generation process itself. Image generation fundamentally involves constructing spatially rich content from more compact representations, while preserving the semantic identity of structures across different spatial locations. We formalize these properties through dimension-increasing shift-equivariant transformations and show that such transformations induce a self-similar structure in the Fourier spectrum. Across successive generation stages, this structure can propagate recursively and form a hierarchical fractal self-similar pattern. Consequently, different spectral sub-regions exhibit consistent structural correspondences inherited from the generation process, providing a generator-agnostic cue for detection. Based on this observation, we propose Fractal-CNN, which captures spectral self-similarity rather than generator-specific spectral values. Extensive experiments across diverse GAN- and diffusion-based generators demonstrate that Fractal-CNN achieves strong cross-generator generalization, with an average detection accuracy of 93.93% across 16 test generators.

cs.CV↗

DRL-Based Secure Transmission for Rotatable Antenna-Enabled Low-Altitude ISAC Systems

The development of the low-altitude economy has driven innovation in intelligent antenna systems within ISAC systems. In this paper, we investigate a Rotatable Antenna (RA)-enabled low-altitude integrated sensing and communication (ISAC) system. In practical terms, the RA array can flexibly adjust the three-dimensional (3D) beam direction of each antenna to enhance array directional gain, thereby improving the communication security of legitimate mobile users against potential eavesdropping risks from the unmanned aerial vehicle (UAV). Our objective is to maximize the minimum secrecy rate (SR) by jointly optimizing transmit beamforming matrix, transmit and receive RAs' pointing matrices. To this end, an multi-agent proximal policy optimization with three improvement mechanisms (MAPPO-T) algorithm is proposed to cope with the issue of complex multi-agent collaborative decision-making problem. Simulation results show that the introduction of RAs can effectively improve SR performance compared to the traditional fixed orientation antenna (FOA)-based system. In addition, the proposed MAPPO-T algorithm validate the superiority compared to the standard MAPPO algorithm.

eess.SP↗

A five-variable counterexample to the Hessian conjecture, and the low-dimensional status of the Jacobian and Hessian conjectures

We exhibit an explicit integer polynomial in five variables, of total degree $14$ and with constant Hessian determinant $128$, whose gradient is not injective. Consequently its formal Legendre transform is not a polynomial, and the Hessian conjecture $\HC_5$ is false. The counterexample is obtained from the six-variable doubling of Alpöge's 2026 Jacobian counterexample by a one-variable \emph{Schur descent}---a partial Legendre transform in a single variable. Combined with de~Bondt's theorem that $\HC_n$ holds for $n\le3$, with the elementary doubling and stabilization bridges relating the Jacobian conjectures $\JC_n$ to the Hessian conjectures $\HC_n$, and with Alpöge's refutation of $\JC_3$, this decides the Hessian conjecture in every dimension except $n=4$: $\HC_n$ is true for $n\le3$, false for $n\ge5$, and open only at $n=4$. Exactly two statements of the two families remain unsettled, $\JC_2$ and $\HC_4$, linked by $\HC_4 \Rightarrow \JC_2$. Along the way we record, as a warm-up, an explicit six-variable counterexample to $\HC_6$ with constant Hessian determinant $-4$ and non-injective gradient. This note adds the five-variable counterexample to, and updates the status recorded in, the first author's earlier educational preprint \cite{MengRG2026}.

math.AC↗

Trade-off for Secure UAV-ISCC Systems

The integrated sensing, communication, and computing (ISCC) system overcomes the limitations of conventional standalone architectures. Through resource sharing and collaborative design, it dynamically optimizes and jointly enhances communication, sensing, and computing performance, thereby significantly improving overall system efficiency. This work investigates the performance trade-off among secure communication rate, radar estimation rate, and computational energy efficiency in an uncrewed aerial vehicle (UAV)-assisted ISCC system. By jointly optimizing the UAV's three-dimensional (3D) trajectory, beamforming, user scheduling, and computational frequency, three optimization problems are formulated to maximize the average secrecy rate, sensing rate, and computational energy efficiency, respectively, thus establishing the system's performance boundaries under diverse scenarios. On this basis, the trade-off among security, sensing, and computation is further explored with the goal of maximizing the normalized weighted sum of the three performance metrics, which provides a theoretical basis for the performance-coordinated design of aerial ISCC systems.

cs.IT↗

Homological rigidity of quiver representations over $\mathbb{F}_1$

We establish a homological rigidity phenomenon for the category of representations of quivers over the virtual field $\mathbb{F}_1$, which is inherently non-additive and does not admit classical homological algebra tools. We prove that all higher Yoneda extension groups vanish beyond degree two for arbitrary quivers, including infinite ones. Consequently, the global dimension of the category is universally bounded by 2. Moreover, we obtain a complete classification of quivers according to their homological dimension, which is determined solely by the underlying orientation structure.

math.RT↗

Shift-MoE-Based DJSCC for CSI Feedback in Multi-User Pinching-Antenna Systems

In frequency-division duplexing systems, the performance gains of pinching-antenna systems (PASS) critically depend on accurate channel state information (CSI) at the base station. However, PASS CSI exhibits structured correlations over the waveguide-antenna grid and pronounced heterogeneity across users, making conventional fixed feedback mappings difficult to generalize. To address this challenge, this letter proposes an end-to-end CSI feedback scheme over a noisy uplink feedback link based on deep joint source-channel coding, termed Shift-based Mixture-of-Experts (Shift-MoE). Specifically, Shift-MoE leverages channel-grouped one-step shift operations to capture grid dependencies without global attention, and employs a gated multilayer perceptron mixture-of-experts module to adapt to heterogeneous CSI statistics across users. Numerical results demonstrate that the proposed Shift-MoE consistently outperforms representative learning-based CSI feedback baselines in normalized mean squared error and remains effective under different system parameter settings.

eess.SP↗