Searcharxiv⌕ Search

arXiv subjects

Jie Zhang

Publications and source records attributed to Jie Zhang.

At least 181 records · Page 10Linked to original sources

TeachMaster: Generative Teaching via Code

The scalability of high-quality online education is hindered by the high costs and slow cycles of manual content creation. Despite advancements in video generation, current approaches often fail to ensure pedagogical structure and precise control due to their pixel-level, black-box nature. In this paper, we propose Generative Teaching, a novel paradigm shifting educators from manual creators to high-level directors who focus on pedagogical intents while agents handle the execution. To realize this vision, we introduce TeachMaster, a multi-agent framework that leverages code as an intermediate semantic medium. Unlike traditional video generation methods, TeachMaster orchestrates a collaborative team of agents, spanning planning, design, and rendering, to automate the production of interpretable, editable, and curriculum-ready educational videos. Experiments validate that TeachMaster significantly boosts production efficiency without compromising structural coherence or visual fidelity, slashing production costs to only 0.3% of traditional online course videos and providing a robust solution for scalable education.

cs.CY↗

From Past To Path: Masked History Learning for Next-Item Prediction in Generative Recommendation

Generative recommendation, which directly generates item identifiers, has emerged as a promising paradigm for recommendation systems. However, its potential is fundamentally constrained by the reliance on purely autoregressive training. This approach focuses solely on predicting the next item while ignoring the rich internal structure of a user's interaction history, thus failing to grasp the underlying intent. To address this limitation, we propose Masked History Learning (MHL), a novel training framework that shifts the objective from simple next-step prediction to deep comprehension of history. MHL augments the standard autoregressive objective with an auxiliary task of reconstructing masked historical items, compelling the model to understand ``why'' an item path is formed from the user's past behaviors, rather than just ``what'' item comes next. We introduce two key contributions to enhance this framework: (1) an entropy-guided masking policy that intelligently targets the most informative historical items for reconstruction, and (2) a curriculum learning scheduler that progressively transitions from history reconstruction to future prediction. Experiments on three public datasets show that our method significantly outperforms state-of-the-art generative models, highlighting that a comprehensive understanding of the past is crucial for accurately predicting a user's future path.

cs.IR↗

AgentDoG: A Diagnostic Guardrail Framework for AI Agent Safety and Security

The rise of AI agents introduces complex safety and security challenges arising from autonomous tool use and environmental interactions. Current guardrail models lack agentic risk awareness and transparency in risk diagnosis. To introduce an agentic guardrail that covers complex and numerous risky behaviors, we first propose a unified three-dimensional taxonomy that orthogonally categorizes agentic risks by their source (where), failure mode (how), and consequence (what). Guided by this structured and hierarchical taxonomy, we introduce a new fine-grained agentic safety benchmark (ATBench) and a Diagnostic Guardrail framework for agent safety and security (AgentDoG). AgentDoG provides fine-grained and contextual monitoring across agent trajectories. More Crucially, AgentDoG can diagnose the root causes of unsafe actions and seemingly safe but unreasonable actions, offering provenance and transparency beyond binary labels to facilitate effective agent alignment. AgentDoG variants are available in three sizes (4B, 7B, and 8B parameters) across Qwen and Llama model families. Extensive experimental results demonstrate that AgentDoG achieves state-of-the-art performance in agentic safety moderation in diverse and complex interactive scenarios. All models and datasets are openly released.

cs.AI↗

Observation of quantum multi-Mpemba effect in a trapped-ion system

The quantum Mpemba effect (ME) in Markovian systems is conventionally explained by a smaller overlap between the initial state and the slowest decay mode (SDM). Such state, initially farther away from equilibrium or steady state, relaxes faster than closer ones, resulting to a crossing of their trajectories. This picture, by neglecting the transient dynamics, holds in the long-time limit. Here we experimentally observe multiple trajectory crossings (multi-ME) in the relaxation dynamics of a trapped ion. Such novel dynamics takes place in a unusual scenario where the initial state instead has a larger overlap with the SDM. We develop a theoretical framework based on relaxation speed to understand the multi-ME. We show that the initial relaxation speed is governed by the fastest decay mode, which together with the SDM overlap gives a phase diagram that reveals both the occurrence and the types of quantum ME observed in our experiment. Our study goes beyond the simple picture based on the long-time limit, tracks continuously the quantum ME dynamics, and establishes a comprehensive framework to describe the transient quantum relaxation.

quant-ph↗

Intertwined charge density wave, tunable anti-dome superconductivity, and topological states in kagome metal VSn

These years, kagome materials with 1:1 stoichiometry have garnered increasing attention, among which FeSn, CoSn, and FeGe have been the focus of current studies. However, all of them are antiferromagnetic, thereby hindering the observation of superconductivity and other novel physical properties. Here, we predict a novel 1:1 kagome metal VSn, which is an intrinsic charge density wave (CDW) material. Interestingly, with increasing pressure or doping concentration, the CDW order is progressively suppressed, followed by the emergence of superconductivity characterized by a non-monotonic transition temperature that exhibits a rare anti-dome-shaped dependence. Above a critical threshold, a reentrance of the CDW phase occurs. The anti-dome superconductivity originates from the first hardening and then softening of phonon modes, together with band reconstruction. Crucially, VSn retains nontrivial topological properties across the entire superconducting regime, a feature of paramount importance for realizing robust topological superconductivity. These intertwined CDW, superconductivity, and topological phenomena elucidate the correlations among multiple quantum states in VSn. Therefore, this research paves the way for for designing 1:1 kagome superconducting topological metals and establishes a platform for exploring the interplay of multiple phases in kagome systems.

cond-mat.mtrl-sci↗

Two-gap to Single-gap Transition and Two-dome-like Superconductivity in Alkali-Metal Intercalated Bilayer PdTe2

PdTe2 has been synthesized with controllable thickness down to the monolayer limit. Based on first-principles calculations within the fully anisotropic Migdal-Eliashberg framework, this work reveals that alkali-metal intercalation markedly enhances the weak superconductivity of bilayer PdTe2, boosting the transition temperature from 1.4 K to 5.0 -13.5 K and yielding a two-dome-like evolution of Tc. Rubidium intercalation induces the highest Tc of 13.5 K, which can be further increased to 14.5 K under biaxial tensile strain. The strain-dependent evolution of Tc also exhibits a two-dome-like behavior, reflecting the interplay between strain-induced band structure modifications and electron-phonon coupling (EPC). Moreover, a systematic correlation is identified between interlayer interaction and superconducting gap. Lithium intercalation induces a distinct two-gap state, whereas intercalants with larger atomic radii (Na, K, Rb, and Cs) drive the system into a single-gap character. The two-gap to single-gap transition originates from the modulation of interlayer coupling through intercalation-induced interlayer expansion. In addition, pristine and Li/Na-intercalated bilayers exhibit nontrivial band topology, suggesting that layered PdTe2 provides a promising platform for realizing the coexistence of superconductivity and nontrivial topology. These results provide detailed anisotropic insights into EPC and offer viable pathways for enhancing Tc and achieving diverse properties in layered PdTe2 systems.

cond-mat.supr-con↗

A Python/CuPy Software Correlator for QUEST: Real-Time Performance and Initial Imaging

We present a Python/CuPy FX software correlator for small radio interferometer arrays and evaluate it on QUEST (Qilu University Explorer Survey Telescope). The system combines multi-threaded data ingest, pinned-memory host-device transfers, GPU-accelerated correlation, Polyphase Filter Bank channelization, MAD-based RFI flagging, and delay/phase calibration in a single workflow aimed at array commissioning. On a single NVIDIA RTX 4090D GPU, the implementation reaches a peak throughput of 1.51 GB/s, which is sufficient for real-time operation in the four-antenna mode tested here. After calibration, the visibility phase across a clean 1.32-1.38 GHz band is flattened to a residual scatter of a few degrees. Using the calibrated visibilities, we form a four-antenna synthesis image of Cassiopeia A; the CLEANed image recovers a compact source at the phase center and reduces image-domain background fluctuations from order 0.1 to a few 0.01 Jy/beam. These results indicate that the software is suitable for small-array commissioning and initial synthesis imaging on QUEST. A GNSS-based beam measurement is included as a supporting commissioning check.

astro-ph.IM↗

Voronoi-guided Bilateral 2D Gaussian Splatting for Arbitrary-Scale Hyperspectral Image Super-Resolution

Most existing hyperspectral image super-resolution methods require modifications for different scales, limiting their flexibility in arbitrary-scale reconstruction. 2D Gaussian splatting provides a continuous representation that is compatible with arbitrary-scale super-resolution. Existing methods often rely on rasterization strategies, which may limit flexible spatial modeling. Extending them to hyperspectral image super-resolution remains challenging, as the task requires adaptive spatial reconstruction while preserving spectral fidelity. This paper proposes GaussianHSI, a Gaussian-Splatting-based framework for arbitrary-scale hyperspectral image super-resolution. We develop a Voronoi-Guided Bilateral 2D Gaussian Splatting for spatial reconstruction. After predicting a set of Gaussian functions to represent the input, it associates each target pixel with relevant Gaussian functions through Voronoi-guided selection. The target pixel is then reconstructed by aggregating the selected Gaussian functions with reference-aware bilateral weighting, which considers both geometric relevance and consistency with low-resolution features. We further introduce a Spectral Detail Enhancement module to improve spectral reconstruction. Extensive experiments on benchmark datasets demonstrate the effectiveness of GaussianHSI over state-of-the-art methods for arbitrary-scale hyperspectral image super-resolution.

cs.CV↗

STCast: Adaptive Boundary Alignment for Global and Regional Weather Forecasting

To gain finer regional forecasts, many works have explored the regional integration from the global atmosphere, e.g., by solving boundary equations in physics-based methods or cropping regions from global forecasts in data-driven methods. However, the effectiveness of these methods is often constrained by static and imprecise regional boundaries, resulting in poor generalization ability. To address this issue, we propose Spatial-Temporal Weather Forecasting (STCast), a novel AI-driven framework for adaptive regional boundary optimization and dynamic monthly forecast allocation. Specifically, our approach employs a Spatial-Aligned Attention (SAA) mechanism, which aligns global and regional spatial distributions to initialize boundaries and adaptively refines them based on attention-derived alignment patterns. Furthermore, we design a Temporal Mixture-of-Experts (TMoE) module, where atmospheric variables from distinct months are dynamically routed to specialized experts using a discrete Gaussian distribution, enhancing the model's ability to capture temporal patterns. Beyond global and regional forecasting, we evaluate our STCast on extreme event prediction and ensemble forecasting. Experimental results demonstrate consistent superiority over state-of-the-art methods across all four tasks. Code: https://github.com/chenhao-zju/STCast

cs.LG↗

PestVL-Net: Enabling Multimodal Pest Learning via Fine-grained Vision-Language Interaction

Effective pest recognition and management are crucial for sustainable agricultural development. However, collecting pest data in real scenarios is often challenging. Compared to other domains, pests exhibit a wide variety of species with complex and diverse morphological characteristics. Existing techniques struggle to effectively model the key visual and high-level semantic features of pests in a fine-grained manner. These limitations hinder the practical application of such methods in real agricultural scenarios. To address these critical challenges, we present a synergistic approach that integrates PestVL-Net, a novel vision-language framework, with two multi-species pest datasets to facilitate fine-grained pest learning. The visual pathway of PestVL-Net utilizes the Recurrent Weighted Key Value (RWKV) architecture, incorporating a saliency-guided adaptive window partitioning scheme to effectively model the fine-grained visual characteristics of pests. Concurrently, the linguistic component generates precise pest semantic descriptions by leveraging Multimodal Large Language Models (MLLMs) priors, critically informed by agricultural expert knowledge and structured via multimodal Chain-of-Thought (CoT) reasoning. The deep fusion of these complementary visual and textual representations enables fine-grained multimodal pest learning. Extensive experimental evaluations on multiple pest datasets validate the superior performance of PestVL-Net, highlighting its potential for effective real-world pest management.

cs.CV↗

Mirroring Users: Towards Building Preference-aligned User Simulator with User Feedback in Recommendation

User simulation is increasingly vital to develop and evaluate recommender systems (RSs). While Large Language Models (LLMs) offer promising avenues to simulate user behavior, they often struggle with the absence of specific task alignment required for RSs and the efficiency demands of large-scale simulation. A vast yet underutilized resource for enhancing this alignment is the extensive user feedback inherent in RSs, but leveraging it is challenging due to its ambiguity, noise and massive volume, which hinders efficient preference alignment. To overcome these hurdles, we introduce a novel data construction framework that leverages user feedback in RSs with advanced LLM capabilities to generate high-quality simulation data. Our framework unfolds in two key phases: (1) using LLMs to generate decision-making processes as explanatory rationales on simulation samples, thereby reducing ambiguity; and (2) data distillation based on uncertainty estimation and behavior sampling to efficiently filter the most informative, denoised samples. Accordingly, we fine-tune lightweight LLMs, as user simulators, using such high-quality dataset with corresponding decision-making processes. Extensive experiments confirm that our framework significantly boosts the alignment with human preferences and the in-domain reasoning capabilities of the fine-tuned LLMs, providing more insightful and interpretable signals for RS interaction. We believe our work, together with publicly available developed framework, high-quality mixed-domain dataset, and fine-tuned LLM checkpoints, will advance the RS community and offer valuable insights for broader human-centric AI research. Our code is available at https://github.com/Joinn99/UserMirrorer.

cs.HC↗

When Search Goes Wrong: Red-Teaming Web-Augmented Large Language Models

Large Language Models (LLMs) have been augmented with web search to overcome the limitations of the static knowledge boundary by accessing up-to-date information from the open Internet. While this integration enhances model capability, it also introduces a distinct safety threat surface: the retrieval and citation process has the potential risk of exposing users to harmful or low-credibility web content. Existing red-teaming methods are largely designed for standalone LLMs as they primarily focus on unsafe generation, ignoring risks emerging from the complex search workflow. To address this gap, we propose CREST-Search, a pioneering red-teaming framework for LLMs with web search. The cornerstone of CREST-Search is three novel attack strategies that generate seemingly benign search queries yet induce unsafe citations. It also employs an iterative in-context refinement mechanism to strengthen adversarial effectiveness under black-box constraints. In addition, we construct a search-specific harmful dataset, WebSearch-Harm, which enables fine-tuning a specialized red-teaming model to improve query quality. Our experiments demonstrate that CREST-Search can effectively bypass safety filters and systematically expose vulnerabilities in web search-based LLM systems, underscoring the necessity of the development of robust search models.

cs.CR↗

Strix: Re-thinking NPU Reliability from a System Perspective

DNNs and LLMs increasingly rely on hardware accelerators, including in safety-critical domains, while technology scaling and growing model complexity make hardware faults more frequent. Existing system-level mechanisms typically treat the NPU as a monolithic unit, using coarse-grained replication that incurs prohibitive performance and hardware overheads, leaving a gap between reliability requirements and deployable solutions. To bridge this gap, we present Strix, a full-stack NPU reliability framework on an open-source SoC, spanning micro-architecture, ISA, and programming methods. Strix re-partitions the NPU along the system inference pipeline, identifies dominant failure modes, and attaches targeted safeguards, achieving sub-micro-second fault localisation, error detection, and correction with only 1.04$\times$ slowdown and minimal hardware overhead.

cs.AR↗

From Characterization to Microarchitecture: Designing an Elegant and Reliable BFP-Based NPU

Block Floating-Point (BFP) is emerging as an attractive data format for edge Neural Processing Units (NPUs), combining wide dynamic range with high hardware efficiency. However, its behavior under hardware faults and suitability for safety-critical deployments remain underexplored. Here, we present the first in-depth empirical reliability study of BFP-based NPUs. Using RTL-level fault injection on NPUs, our bit- and path-level analysis reveals pronounced heterogeneous vulnerabilities and shows conventional end-to-end check becomes ineffective under nonlinear block scaling. Guided by these insights, we design a fault-tolerant BFP-based NPU microarchitecture that aligns the BFP computational semantics with reliability constraints. The design uses a row/column-wise blocking strategy to decouple the fixed-point mantissa computations from the scalar exponent path, and introduces ultra-lightweight protection mechanisms for each. Experimental results demonstrate our design achieves near-dual modular redundancy reliability with only $3.55\%$ geometric mean performance overhead and less than $2\%$ hardware cost.

cs.AR↗

A flat-band perspective on the boson peak in amorphous solids

The boson peak is a characteristic anomaly of amorphous solids broadly defined as a low-energy excess in the density of states and heat capacity compared to the textbook predictions of Debye theory. The origin of this anomaly has long been the subject of ongoing debate and remains a topic of active controversy. We propose that the boson peak may have a defining dynamical feature: the accumulation of vibrational spectral weight within a narrow frequency window that is only weakly dependent on wavevector. In this perspective, the boson peak reflects a flat or weakly dispersive band in the dynamical structure factor rather than a propagating excitation. We revisit both experimental and simulation data from the literature through this lens and conduct further simulations in 2D and 3D amorphous systems. Taken together, these analyses provide compelling converging evidence for this interpretation and sharply constrain the space of viable theoretical descriptions of the boson peak.

cond-mat.soft↗

TTVS: Boosting Self-Exploring Reinforcement Learning via Test-time Variational Synthesis

Despite significant advances in Large Reasoning Models (LRMs) driven by reinforcement learning with verifiable rewards (RLVR), this paradigm is fundamentally limited in specialized or novel domains where such supervision is prohibitively expensive or unavailable, posing a key challenge for test-time adaptation. While existing test-time methods offer a potential solution, they are constrained by learning from static query sets, risking overfitting to textual patterns. To address this gap, we introduce Test-Time Variational Synthesis (TTVS), a novel framework that enables LRMs to self-evolve by dynamically augmenting the training stream from unlabeled test queries. TTVS comprises two synergistic modules: (1) Online Variational Synthesis, which transforms static test queries into a dynamic stream of diverse, semantically-equivalent variations, enforcing the model to learn underlying problem logic rather than superficial patterns; (2) Test-time Hybrid Exploration, which balances accuracy-driven exploitation with consistency-driven exploration across synthetic variants. Extensive experiments show TTVS yields superior performance across eight model architectures. Notably, using only unlabeled test-time data, TTVS not only surpasses other test-time adaptation methods but also outperforms state-of-the-art supervised RL-based techniques trained on vast, high-quality labeled data.

cs.LG↗

Comparative Analysis of EMCEE, Gaussian Process, and Masked Autoregressive Flow in Constraining the Hubble Constant Using Cosmic Chronometers Dataset

The Hubble constant ($H_0$) is essential for understanding the universe's evolution. Different methods, such as Affine Invariant Markov chain Monte Carlo Ensemble sampler (EMCEE), Gaussian Process (GP), and Masked Autoregressive Flow (MAF), are used to constrain $H_0$ using $H(z)$ data. However, these methods produce varying $H_0$ values when applied to the same dataset. To investigate these differences, we compare the methods based on their sensitivity to individual data points and their performance in constraining $H_0$. We apply Monte Carlo delete-$d$ jackknife (MCDJ) to assess their sensitivity to individual data points. Our findings reveal that GP is more sensitive to individual data points than both MAF and EMCEE, with MAF being more sensitive than EMCEE. Sensitivity also depends on redshift: EMCEE and GP are more sensitive to $H(z)$ at higher redshifts, while MAF is more sensitive at lower redshifts. In simulation-based performance tests, we generate an ensemble of mock CC datasets with a fixed input truth $H_{0,\mathrm{true}}$, apply each method to recover $H_0$ posteriors, and summarise performance by comparing the recovered posterior to $H_{0,\mathrm{true}}$: (i) posterior central value accuracy (bias and RMSE), (ii) credible-interval calibration (68\% and 95\% coverage), and (iii) overall posterior quality (log score), under two simulation prescriptions ($Λ$CDM-based and GP-based). Overall, EMCEE performs best, GP is intermediate, and MAF performs worst across the performance metrics.

astro-ph.CO↗

MM-MoralBench: A MultiModal Moral Evaluation Benchmark for Large Vision-Language Models

The rapid integration of Large Vision-Language Models (LVLMs) into critical domains necessitates comprehensive moral evaluation to ensure their alignment with human values. While extensive research has addressed moral evaluation in LLMs, text-centric assessments cannot adequately capture the complex contextual nuances and ambiguities introduced by visual modalities. To bridge this gap, we introduce MM-MoralBench, a multimodal moral evaluation benchmark grounded in Moral Foundations Theory. We construct unique multimodal scenarios by combining synthesized visual contexts with character dialogues to simulate real-world dilemmas where visual and linguistic information interact dynamically. Our benchmark assesses models across six moral foundations through moral judgment, classification, and response tasks. Extensive evaluations of over 20 LVLMs reveal that models exhibit pronounced moral alignment bias, diverging significantly from human consensus. Furthermore, our analysis indicates that general scaling or structural improvements yield diminishing returns in moral alignment, and thinking paradigm may trigger overthinking-induced failures in moral contexts, highlighting the necessity for targeted moral alignment strategies. Our benchmark is publicly available.

cs.CV↗