Searcharxiv⌕ Search

arXiv subjects

Zhen Zhang

Publications and source records attributed to Zhen Zhang.

At least 91 records · Page 5Linked to original sources

Fragile electron-phonon superconductivity in MnB4 under pressure

The origin of pressure-induced superconductivity in MnB4 remains unclear. Here we show that it can be explained by electron-phonon coupling once the structural space is mapped using both volume and the Mn dimer distance as key structural parameters under compression. Minor changes in the dimer distance significantly affect electronic and phonon properties, bringing the calculated Tc into agreement with experiment. Our results suggest that MnB4 is a highly responsive system, providing a platform for probing the subtle interplay between structural instability, superconductivity and magnetism.

cond-mat.supr-con↗

How Much Dense Attention is Necessary? Oracle-Guided Sparse Prefill for Full/GQA Layers in Hybrid Long-Context Models

Long-context prefill remains expensive because full/GQA layers still score the historical sequence, even in hybrid models with local, sparse, linear, or recurrent components. We study how much dense attention is needed to preserve task-level behavior under explicit support granularity and top-k budgets. We introduce an attention-mass top-k oracle for existing GQA checkpoints: for each layer and query position, it computes dense attention, selects head-averaged token support, and recomputes attention only on that support. The oracle is a diagnostic reference, not a deployable accelerator, and separates sparse-budget feasibility from indexer error and runtime realization effects. On Qwen-family retrieval-heavy evaluations, the longest per-query oracle rows stay within 1 point of dense, and a Qwen3.5-9B RULER-style sweep from 4K to 100K stays within 0.48 points. Guided by the oracle, we derive a head-collapsed auxiliary indexer trained by KL distillation from dense attention-mass distributions while keeping the backbone frozen. With separately distilled Qwen3.5-0.8B and Qwen3.5-9B indexers, the reported 16K/32K validation macro gaps are +2.04 and +1.13 points, treated as quality preservation rather than improvement; fused selection-block-shared support can introduce a larger realization gap. Preliminary single-card TTFT measurements show distilled-indexer sparse serving speedups of 1.71x for Qwen3.5-0.8B on NPU and 1.93x for Qwen3.5-9B on GPU against its dense FlashAttention-2 baseline. Additional random-init stress rows reach 3.44x, indicating sparse-runtime headroom but not validated output quality. This first release separates oracle feasibility, distilled-indexer quality, and runtime headroom, leaving a fully matched quality-latency frontier to future work.

cs.LG↗

Bankruptcy Prediction from 10-K Narratives: Evidence from Interpretable Text Scores and Accounting Baselines

Bankruptcy is a low-frequency but high-impact corporate event, making early risk identification important for creditors, investors, regulators, and risk managers. Traditional bankruptcy-prediction models rely primarily on accounting ratios, but these measures may reflect financial deterioration only after it appears in reported financial statements. Narrative disclosures in annual 10-K filings may therefore provide incremental warning signals about emerging distress. This study examines whether 10-K narratives improve bankruptcy prediction beyond conventional accounting variables. Using firm-year observations matched to 10-K text, SEC financial statement data, and bankruptcy events from the Florida-UCLA-LoPucki Bankruptcy Research Database, the analysis evaluates bankruptcy risk over the year following the 10-K filing date. The paper develops a transparent Pre-Bankruptcy Stress (PB Stress) Score, a dictionary-based measure designed to capture distress-specific language related to liquidity and funding stress, debt covenant and refinancing stress, operating deterioration, restructuring and legal distress, and business fragility. The score is evaluated against a five-variable accounting baseline and a Loughran-McDonald dictionary benchmark. In the primary one-year holdout test, adding the PB Stress Score increases AUC from 0.8323 to 0.9019 and raises top-decile bankruptcy capture from 44.12% to 64.71%. The positive incremental pattern remains visible across bootstrap inference, alternative accounting benchmarks, alternative outcome definitions, and out-of-time validation. The findings indicate that distress-specific 10-K narratives provide interpretable incremental information for bankruptcy-risk monitoring beyond conventional accounting ratios.

q-fin.RM↗

Ekka: Automated Diagnosis of Silent Errors in LLM Inference

LLM serving frameworks are quickly evolving with a complex software stack and a vast number of optimizations. The rapid development process can introduce silent errors where output quality silently degrades without any explicit error signals. Diagnosing silent errors is notoriously difficult due to the substantial semantic gap between the high-level symptoms and the low-level root causes. We observe that diagnosis of silent errors can be effectively framed as a differential debugging problem by leveraging the existence of semantically correct reference implementations. We propose Ekka, an automated diagnosis system that identifies root causes by systematically aligning and comparing intermediate execution states between a target and a reference framework. We constructed a benchmark of real-world silent errors from popular serving frameworks, where Ekka shows 80% pass@1 diagnosis accuracy and 88% pass@5 diagnosis accuracy, outperforming state-of-the-art systems. Ekka also diagnoses 4 new silent errors from serving frameworks, all of which have been confirmed by the developers.

cs.DC↗

DiffSlack: Learning under Nonlinear Inequality Constraints via Learnable Slack Variables

Enforcing nonlinear inequality constraints in neural networks remains challenging, especially when the output is subject to many coupled constraints. Existing hard constraint methods often impose structural restrictions on the constraint set or introduce substantial computational overhead for large-scale nonlinear problems. Here, we propose DiffSlack, a differentiable projection layer for nonlinear inequality-constrained neural prediction. DiffSlack reformulates inequalities as equalities with learnable slack variables, which are predicted as part of the augmented network output and provide a data-driven warm start for damped Gauss-Newton projection. The projection layer maps raw predictions onto the augmented feasible manifold while preserving end-to-end differentiability. A two-stage curriculum further stabilizes training and improves constraint satisfaction. We evaluate DiffSlack on vehicle path planning with 200 nonlinear inequality constraints from collision avoidance, curvature limits, and waypoint spacing. Compared with existing learning-based baselines, DiffSlack achieves a higher planning success rate and stronger geometric constraint satisfaction under a comparable inference budget. Ablation studies further show that the hard projection layer reduces sensitivity to supervision quality. Closed-loop tracking in CARLA and real-world vehicle experiments confirms the executability of the generated trajectories. These results demonstrate that DiffSlack provides a practical and scalable approach to embedding hard inequality constraints into neural networks for engineering applications.

cs.LG↗

RADAR: Redundancy-Aware Diffusion for Multi-Agent Communication Structure Generation

Compared with individual agents, large language model based multi-agent systems have shown great capabilities consistently across diverse tasks, including code generation, mathematical reasoning, and planning, etc. Despite their impressive performance, the effectiveness and robustness of these systems heavily rely on their communication topology, which is often fixed or generated in a single step. This restricts fine-grained structural exploration and flexible composition, resulting in excessive token utilization on simple tasks while limiting capability on complicated tasks. To mitigate this challenge, we introduce RADAR, a redundancy-aware and query-adaptive generative framework that actively reduce communication overhead. Motivated by recent progress in conditional discrete graph diffusion models, we formulate communication topology design as a step-by-step generation process, guided by the effective size of the graph. Comprehensive experiments on six benchmarks demonstrate that RADAR consistently outperforms recent baselines, achieving higher accuracy, lower token consumption, and greater robustness across diverse scenarios. Our code and data are available at https://github.com/cszhangzhen/RADAR.

cs.AI↗

GIRL-DETR: Gradient-Isolated Reinforcement Learning for Video Moment Retrieval

Video Moment Retrieval (VMR) task requires accurately localizing temporal boundaries aligned with natural language queries, but many models suffer from a misalignment between continuous surrogate losses and non-differentiable metrics, leading to optimization stagnation during the late stages of training and trapping boundary predictions in suboptimal solutions. Although Reinforcement Learning (RL) post-training successfully optimizes localization results for large models, applying it directly to lightweight networks easily disrupts the fragile feature representations established during the supervised phase. To overcome this optimization bottleneck, we propose Gradient-Isolated Reinforcement Learning for DETR (GIRL-DETR), introducing RL post-training into a lightweight temporal localization framework for the first time. The input video and text features first establish early alignment through Cross-Modal Interaction (CMI) before entering the transformer encoder. Subsequently, a Text-Guided Gating (TGG) mechanism dynamically injects semantic priors into the queries before the transformer decoder generates candidate proposals, providing high signal-to-noise ratio inputs for temporal prediction. After the supervised training reaches convergence, the backbone network is frozen to protect the feature manifold, while the detection head directly optimizes the non-differentiable evaluation metric tIoU to enhance localization accuracy through a Three-stage Progressive Reinforcement Learning (TPRL) strategy. This approach achieves an orthogonal decoupling of state representation and metric optimization. Experiments on Charades-STA, QVHighlights, and TACoS demonstrate that GIRL-DETR effectively resolves surrogate loss degradation and achieves substantial accuracy improvements with minimal parameter updates, providing a robust new pathway for RL applications in lightweight VMR models.

cs.CV↗

LVSA: Training-Free Sparse Attention for Long Video Diffusion

Dense self-attention is the compute and quality bottleneck of long-video diffusion inference: cost grows quadratically with the sequence length, and beyond the training horizon the model converges to near-static output, that is, "frozen" repetitive video. State of the art approaches are either too costly, e.g., they require retraining, or fail to satisfy both performance and quality objectives in a scalable manner. To this end, we introduce Long Video Sparse Attention (LVSA), a training-free model-agnostic block-sparse attention for video diffusion transformers that combines a structured window pattern with rotating global anchors, thus removing the fixed-grid bias which causes long-range temporal artifacts. LVSA, combined with a FlashInfer kernel, reduces compute up to 3.17x on Wan 2.1 1.3B at a 6x horizon, 2.98x on Wan 2.1 14B at a 6x horizon, and 3.33x on HunyuanVideo 1.5 at a 1.5x horizon, compared to dense attention. Beyond reducing compute, LVSA enables HunyuanVideo 1.5 generation at a 2x horizon, which is otherwise out-of-memory on a single GPU. Moreover, LVSA provides speedups up to 2.41x compared to RIFLEx and 3.27x compared to UltraViCo on Wan 2.1 1.3B. To demonstrate applicability across diverse platforms, we apply LVSA on NPUs and achieve speedups up to 2.71x on Wan 2.2 A14B and 3.24x on Wan 2.1 1.3B compared to dense attention. To evaluate quality in a fair way, we introduce VQeval, a tool properly scoring loopy video failures, which instead are rewarded in state of the art evaluators like VBench-Long. LVSA is quality-neutral for generation at training horizon length and quality-positive at extended lengths.

cs.CV↗

Causal Disentanglement-Inspired Degradation Representation Learning for Full-Reference Image Quality Assessment

Existing deep network-based full-reference image quality assessment (FR-IQA) models typically work by performing pairwise comparisons of deep features from the reference and distorted images. In this paper, we approach this problem from a different perspective and propose a novel FR-IQA paradigm based on causal inference and decoupled representation learning. Unlike typical feature comparison-based FR-IQA models, our approach formulates degradation estimation as a causal disentanglement process guided by intervention on latent representations. We first decouple degradation and content representations by exploiting the content invariance between the reference and distorted images. Second, inspired by the human visual masking effect, we design a masking module to model the causal relationship between image content and degradation features, thereby extracting content-influenced degradation features from distorted images. Finally, quality scores are predicted from these degradation features using either supervised regression or label-free dimensionality reduction. Extensive experiments demonstrate that our method achieves highly competitive performance on standard IQA benchmarks across fully supervised, few-label, and label-free settings. Furthermore, we evaluate the approach on diverse non-standard natural image domains with scarce data, including underwater, radiographic, medical, neutron, and screen-content images. Benefiting from its ability to perform scenario-specific training and prediction without labeled IQA data, our method exhibits superior cross-domain generalization compared to existing training-free FR-IQA models.

cs.CV↗

Machine-learning-accelerated discovery of synthesizable high-temperature altermagnets with giant spin splitting

Altermagnets offer a route to spin-polarized electronic states without macroscopic magnetization, because compensated magnetic order can generate momentum-dependent spin splitting through crystal-symmetry-controlled exchange fields. However, experimentally viable altermagnets combining large spin splitting, thermodynamic stability and high magnetic ordering temperatures remain scarce. Here, we develop a machine-learning-accelerated high-throughput framework to explore the tetragonal AB$_2$C$_2$D compounds. Screening 8640 variants identifies 1347 compensated antiferromagnetic candidates satisfying altermagnetic symmetry. An interpretable XGBoost model trained on first-principles spin-splitting data then isolates 34 low-hull-energy candidates,including four previously reported, with giant non-relativistic spin splittings exceeding 1.5 eV near the Fermi level. Detailed first-principles calculations of the representative RbMn$_2$Te$_2$O confirm a maximum spin splitting of $\sim$1.88 eV with dynamical stability and an estimated Néel temperature of $\sim$390 K. The giant splitting originates from symmetry-locked Mn-sublattice exchange fields amplified by directional Mn-d/Te-p hybridization. Furthermore, we uncover a profound soft-mode-driven structural transition associated with an interlayer dimensionality crossover in SrMn$_2$Te$_2$O, yet the unfolded electronic structure demonstrates that the altermagnetic spin splitting remains robust after lattice reconstruction. Hydrostatic pressure provides an additional tuning route, producing non-monotonic modulation of the spin-split Fermi surface governed by local coordination and orbital hybridization. These results establish tetragonal AB$_2$C$_2$D compounds as a tunable materials platform for stray-field-free spintronic devices and provide a general data-driven strategy for discovering robust giant-splitting altermagnets.

cond-mat.mtrl-sci↗

Structural Alter-Phononics: Sublattice-Momentum Locking in Spinless Lattice Dynamics

The discovery of altermagnetism has shown that crystal symmetry can generate momentum-dependent internal polarization without net magnetization. Whether an analogous form of symmetry-organized momentum-space order can exist for spinless lattice vibrations remains unresolved. Here we identify a structural mechanism for $alter$-$phononics$, in which phonon eigenmodes formed from structurally equivalent sublattices acquire momentum-dependent sublattice polarization and frequency splitting in nonmagnetic crystals. The central quantity is the sublattice-resolved dynamical asymmetry $Δ(\mathbf q)=D_{AA}(\mathbf q)-D_{BB}(\mathbf q)$, which controls the associated eigenvector polarization. We show that this effect requires an alter-generator that maps equivalent sublattices onto one another while rotating the wave vector, together with the absence of inversion exchange and little-group sublattice-exchange constraints that would otherwise enforce sublattice equipartition. These symmetry rules generate nematic $d$-wave, tetragonal $d/g$-wave, and tripartite six-lobe phonon textures. First-principles calculations demonstrate the mechanism in representative nonmagnetic crystals and show how a symmetry-preserving structural distortion can unlock a hidden $d_{x^2-y^2}$-type texture by removing glide-induced equipartition traps while retaining the screw-axis alter-generator. We further show that the eigenvector texture is inherited by sublattice-projected electron-phonon coupling and anharmonic response functions. Our results establish structural alter-phononics as a spinless counterpart to altermagnetic momentum-space order and provide experimentally testable signatures in finite-$\mathbf q$ phonon spectra and displacement patterns.

cond-mat.mtrl-sci↗

Reflect-Guard: Enhancing LLM Safeguards against Adversarial Prompts via Logical Self-Reflection

Large language model (LLM) safety classifiers such as Llama Guard are effective at detecting overtly harmful prompts but remain vulnerable to adversarial jailbreak attacks that disguise malicious intent through role-play scenarios, fictional framing, and indirect requests. We present Reflect-Guard, a method that augments LLM-based safety classifiers with chain-of-thought self-reflection capabilities through parameter-efficient fine-tuning. Our approach distills analytical reasoning from GPT-4o-mini into structured reflection annotations, then trains Llama-Guard-3-8B via QLoRA to generate logical self-reflections before issuing safety verdicts. Using only 1000 training examples and updating just 0.5% of model parameters (~42M), Reflect-Guard achieves substantial improvements on two challenging benchmarks. On WildGuardTest, F1 score improves from 0.770 to 0.842 (+7.2 pp), with recall on adversarial prompts increasing from 0.513 to 0.921 (+40.8 pp). On JailbreakBench, the attack success rate drops from 10.3% to 1.8%, representing an 82.5% relative reduction. These gains are especially pronounced on adversarial inputs, where the explicit reasoning step enables the model to see through obfuscation techniques that defeat standard pattern-matching approaches. Our results demonstrate that teaching safety classifiers to reason about adversarial intent, rather than simply classify surface patterns, is a promising direction for robust LLM safety.

cs.CR↗

Argus: Evidence Assembly for Scalable Deep Research Agents

Deep research agents have achieved remarkable progress on complex information seeking tasks. Even long ReAct style rollouts explore only a single trajectory, while recent state of the art systems scale inference time compute via parallel search and aggregation. Yet deep research answers are composed of complementary pieces of evidence, which parallel rollouts often duplicate rather than complete, yielding diminishing returns while pushing the aggregation context toward the model's limit. We propose Argus, an agentic system in which a Searcher and a Navigator cooperate to treat deep research as assembling a jigsaw from complementary evidence pieces, rather than brute forcing the whole answer in parallel. The Searcher collects evidence traces for a given sub-query through ReAct-style interaction. The Navigator maintains a shared evidence graph, verifying which pieces are still missing, dispatching Searchers to gather them, and reasoning over the completed graph to produce a source-traced final answer. We train the Navigator with reinforcement learning to verify, dispatch, and synthesize, while independently training the Searcher to remain a standard ReAct agent. The resulting Navigator supports rollouts with a single Searcher or many in parallel without retraining. With both Searcher and Navigator built on a 35B-A3B MoE backbone, Argus gains 5.5 points with a single Searcher and 12.7 points with 8 parallel Searchers, averaged over eight benchmarks. With 64 Searchers it reaches 86.2 on BrowseComp, surpassing every proprietary agent we benchmark, while the Navigator's reasoning context stays under 21.5K tokens.

cs.CL↗

Tongyi DeepResearch Technical Report

We present Tongyi DeepResearch, an agentic large language model, which is specifically designed for long-horizon, deep information-seeking research tasks. To incentivize autonomous deep research agency, Tongyi DeepResearch is developed through an end-to-end training framework that combines agentic mid-training and agentic post-training, enabling scalable reasoning and information seeking across complex tasks. We design a highly scalable data synthesis pipeline that is fully automatic, without relying on costly human annotation, and empowers all training stages. By constructing customized environments for each stage, our system enables stable and consistent interactions throughout. Tongyi DeepResearch, featuring 30.5 billion total parameters, with only 3.3 billion activated per token, achieves state-of-the-art performance across a range of agentic deep research benchmarks, including Humanity's Last Exam, BrowseComp, BrowseComp-ZH, WebWalkerQA, xbench-DeepSearch, FRAMES and xbench-DeepSearch-2510. We open-source the model, framework, and complete solutions to empower the community.

cs.CL↗

Model Editing for New Document Integration in Generative Information Retrieval

Generative retrieval (GR) reformulates the Information Retrieval (IR) task as the generation of document identifiers (docIDs). Despite its promise, existing GR models exhibit poor generalization to newly added documents, often failing to generate the correct docIDs. While incremental training offers a straightforward remedy, it is computationally expensive, resource-intensive, and prone to catastrophic forgetting, thereby limiting the scalability and practicality of GR. In this paper, we identify the core bottleneck as the decoder's ability to map hidden states to the correct docIDs of newly added documents. Model editing, which enables targeted parameter modifications for docID mapping, represents a promising solution. However, applying model editing to current GR models is not trivial, which is severely hindered by indistinguishable edit vectors across queries, due to the high overlap of shared docIDs in retrieval results. To address this, we propose DOME (docID-oriented model editing), a novel method that effectively and efficiently adapts GR models to unseen documents. DOME comprises three stages: (1) identification of critical layers, (2) optimization of edit vectors, and (3) construction and application of updates. At its core, DOME employs a hybrid-label adaptive training strategy that learns discriminative edit vectors by combining soft labels, which preserve query-specific semantics for distinguishable updates, with hard labels that enforce precise mapping modifications. Experiments on widely used benchmarks, including NQ and MS MARCO, show that our method significantly improves retrieval performance on new documents while maintaining effectiveness on the original collection. Moreover, DOME achieves this with only about 60% of the training time required by incremental training, considerably reducing computational cost and enabling efficient, frequent model updates.

cs.IR↗

Effects of isovector spin-orbit interaction on the charge-weak form factor difference in $^{48}$Ca, $^{208}$Pb, $^{90}$Zr and $^{62}$Ni

The nucleon spin-orbit interaction is a cornerstone of nuclear structure theory, yet its isospin dependence remains insufficiently constrained within modern nuclear energy density functional (EDF) theory. It was recently shown that, within the framework of extended Skyrme EDFs, the charge-weak form factor difference $ΔF_{\rm CW}$ in $^{48}$Ca exhibits remarkable sensitivity to the effective isovector spin-orbit (IVSO) interaction, whereas $ΔF_{\rm CW}$ in $^{208}$Pb is much less sensitive to this channel. Extending this analysis to other nuclei, we find that $^{90}$Zr, with its ten spin-orbit unpaired $1\mathrm{g}_{9/2}$ neutrons, displays a $ΔF_{\rm CW}$ sensitivity to the IVSO strength similar to that of $^{48}$Ca, arising from modifications to the central mean-field potential rather than the one-body spin-orbit potential. In contrast, $^{62}$Ni, like $^{208}$Pb, remains largely insensitive to the IVSO interaction. This structure-driven distinction suggests an experimental strategy: future parity-violating electron scattering measurements, e.g., the MREX experiment at the MESA facility, on $^{48}$Ca and $^{90}$Zr would help constrain the effective IVSO strength, while measurements on $^{208}$Pb and $^{62}$Ni can provide a cleaner probe of the density dependence of the symmetry energy with reduced IVSO sensitivity.

nucl-th↗

A Survey on Generative Recommendation: Data, Model, and Tasks

Recommender systems serve as foundational infrastructure in modern information ecosystems, helping users navigate digital content and discover items aligned with their preferences. At their core, recommender systems address a fundamental problem: matching users with items. Over the past decades, the field has experienced successive paradigm shifts, from collaborative filtering and matrix factorization in the machine learning era to neural architectures in the deep learning era. Recently, the emergence of generative models, especially large language models (LLMs) and diffusion models, have sparked a new paradigm: generative recommendation, which reconceptualizes recommendation as a generation task rather than discriminative scoring. This survey provides a comprehensive examination through a unified tripartite framework spanning data, model, and task dimensions. Rather than simply categorizing works, we systematically decompose approaches into operational stages-data augmentation and unification, model alignment and training, task formulation and execution. At the data level, generative models enable knowledge-infused augmentation and agent-based simulation while unifying heterogeneous signals. At the model level, we taxonomize LLM-based methods, large recommendation models, and diffusion approaches, analyzing their alignment mechanisms and innovations. At the task level, we illuminate new capabilities including conversational interaction, explainable reasoning, and personalized content generation. We identify five key advantages: world knowledge integration, natural language understanding, reasoning capabilities, scaling laws, and creative generation. We critically examine challenges in benchmark design, model robustness, and deployment efficiency, while charting a roadmap toward intelligent recommendation assistants that fundamentally reshape human-information interaction.

cs.IR↗

VC-Soup: Value-Consistency Guided Multi-Value Alignment for Large Language Models

As large language models (LLMs) increasingly shape content generation, interaction, and decision-making across the Web, aligning them with human values has become a central objective in trustworthy AI. This challenge becomes even more pronounced when aligning multiple, potentially conflicting human values. Although recent approaches, such as reward reweighting, prompt-based supervised fine-tuning, and model merging, attempt to tackle multi-value alignment, they still face two major limitations: (1) training separate models for each value combination is prohibitively expensive; (2) value conflicts substantially degrade alignment performance. These limitations make it difficult to achieve favorable trade-offs across diverse human values. To address these challenges, we revisit multi-value alignment from the perspective of value consistency in data and propose VC-soup, a data filtering and parameter merging framework grounded in value-consistent learning. We first design a value consistency metric based on the cosine similarity between the reward-gap vector of each preference pair and an all-ones vector, which quantifies its cross-value coherence. We then filter out low-consistency preference pairs in each value dataset and train on the remaining data to obtain smooth, value-consistent policy models that better preserve linear mode connectivity. Finally, we linearly combine these policies and apply Pareto filtering across values to obtain solutions with balanced multi-value performance. Extensive experiments and theoretical analysis demonstrate that VC-soup effectively mitigates conflicts and consistently outperforms existing multi-value alignment methods.

cs.LG↗