arXiv subjects

Hao Zhang

Publications and source records attributed to Hao Zhang.

At least 289 records · Page 16Linked to original sources

arXiv2026

Resonant Excitation of Surface Plasmon for Wakefield Acceleration by Beating GW Lasers on Smooth Cylindrical Surface

We present a theoretical and numerical study of resonant surface-plasmon (SP) excitation driven by the beating of two co-propagating laser pulses on a smooth cylindrical plasma-vacuum interface. Analytical expressions for the SP dispersion relation, field amplitude, geometric coupling factor, and resonance conditions are derived and validated by fully three-dimensional particle-in-cell simulations. We reveal that curvature-induced geometric effects can substantially modify the SP dispersion and enable resonant matching by laser beat waves. This is inaccessible in planar geometries or with a single laser. Under matched resonance conditions, a high-amplitude SP-based wakefield can be generated by a few gigawatt lasers, placing this mechanism within reach of state-of-the-art fibre lasers. It therefore opens a route toward portable laser-driven plasma wakefield accelerators.

physics.plasm-ph↗

arXiv2026

STaR: Scalable Task-Conditioned Retrieval for Long-Horizon Multimodal Robot Memory

Mobile robots are often deployed over long durations in diverse open, dynamic scenes, including indoor setting such as warehouses and manufacturing facilities, and outdoor settings such as agricultural and roadway operations. A core challenge is to build a scalable long-horizon memory that supports an agentic workflow for planning, retrieval, and reasoning over open-ended instructions at variable granularity, while producing precise, actionable answers for navigation. We present STaR, an agentic reasoning framework that (i) constructs a task-agnostic, multimodal long-term memory that generalizes to unseen queries while preserving fine-grained environmental semantics (object attributes, spatial relations, and dynamic events), and (ii) introduces a Scalable Task Conditioned Retrieval algorithm based on the Information Bottleneck principle to extract from long-term memory a compact, non-redundant, information-rich set of candidate memories for contextual reasoning. We evaluate STaR on NaVQA (mixed indoor/outdoor campus scenes) and WH-VQA, a customized warehouse benchmark with many visually similar objects built with Isaac Sim, emphasizing contextual reasoning. Across the two datasets, STaR consistently outperforms strong baselines, achieving higher success rates and markedly lower spatial error. We further deploy STaR on a real Husky wheeled robot in both indoor and outdoor environments, demonstrating robust long horizon reasoning, scalability, and practical utility. Project Website: https://trailab.github.io/STaR-website/

cs.RO↗

arXiv2026

Singpath-VL Technical Report

We present Singpath-VL, a vision-language large model, to fill the vacancy of AI assistant in cervical cytology. Recent advances in multi-modal large language models (MLLMs) have significantly propelled the field of computational pathology. However, their application in cytopathology, particularly cervical cytology, remains underexplored, primarily due to the scarcity of large-scale, high-quality annotated datasets. To bridge this gap, we first develop a novel three-stage pipeline to synthesize a million-scale image-description dataset. The pipeline leverages multiple general-purpose MLLMs as weak annotators, refines their outputs through consensus fusion and expert knowledge injection, and produces high-fidelity descriptions of cell morphology. Using this dataset, we then fine-tune the Qwen3-VL-4B model via a multi-stage strategy to create a specialized cytopathology MLLM. The resulting model, named Singpath-VL, demonstrates superior performance in fine-grained morphological perception and cell-level diagnostic classification. To advance the field, we will open-source a portion of the synthetic dataset and benchmark.

cs.CV↗

arXiv2026

DRACO: a Cross-Domain Benchmark for Deep Research Accuracy, Completeness, and Objectivity

We present DRACO (Deep Research Accuracy, Completeness, and Objectivity), a benchmark of complex deep research tasks. These tasks, which span 10 domains and draw on information sources from 40 countries, originate from anonymized real-world usage patterns within a large-scale deep research system. Tasks are sampled from a de-identified dataset of Perplexity Deep Research requests, then filtered and augmented to ensure that the tasks are anonymized, open-ended and complex, objectively evaluable, and representative of the broad scope of real-world deep research use cases. Outputs are graded against task-specific rubrics along four dimensions: factual accuracy (accuracy), breadth and depth of analysis (including completeness), presentation quality (including objectivity), and citation quality. DRACO is publicly available at https://hf.co/datasets/perplexity-ai/draco.

cs.LG↗

arXiv2026

Unveiling Super Experts in Mixture-of-Experts Large Language Models

In this study, we report, for the first time, the discovery and systematic investigation of a distinct subset of experts that play a pivotal role in the MoE LLMs' forward inference. These experts are prevalent in open-source MoE LLMs, and despite their extremely limited number, pruning them results in a substantial decline in model performance (e.g., prune just three out of 6,144 causes Qwen3-30B-A3B to generate repetitive and uninformative outputs).We refer to these experts as Super Experts (SEs). Our comprehensive analysis provides progressively deeper insights into SEs: (i) SEs are characterized by rare but extreme activation outliers in the output of the down_proj, which give rise to massive activations in the hidden states between decoder layers. Moreover, the distribution of SEs is model-specific, data-agnostic, and remains unaffected by post-training processes. (ii) By pruning SEs, we assess their significance across a variety of tasks, revealing their considerable impact on the model's overall performance, particularly in mathematical reasoning. (iii) We further investigate why compressing SEs exerts such a pronounced impact. We show that, in MoE LLMs, SEs serve as the primary source of the systematic outlier mechanism in Transformers, and that compressing them profoundly disrupts this process, ultimately causing the collapse of attention sinks. These findings advance the understanding of the internal dynamics of MoE LLMs, filling an important gap in the current knowledge. The code is provided in https://github.com/ZunhaiSu/Super-Experts-Profilling.

cs.CL↗

arXiv2026

REG4Rec: Reasoning-Enhanced Generative Model for Large-Scale Recommendation Systems

Sequential recommendation aims to predict a user's next action in large-scale recommender systems. While traditional methods often suffer from insufficient information interaction, recent generative recommendation models partially address this issue by directly generating item predictions. To better capture user intents, recent studies have introduced a reasoning process into generative recommendation, significantly improving recommendation performance. However, these approaches are constrained by the singularity of item semantic representations, facing challenges such as limited diversity in reasoning pathways and insufficient reliability in the reasoning process. To tackle these issues, we introduce REG4Rec, a reasoning-enhanced generative model that constructs multiple dynamic semantic reasoning paths alongside a self-reflection process, ensuring high-confidence recommendations. Specifically, REG4Rec utilizes an MoE-based parallel quantization codebook (MPQ) to generate multiple unordered semantic tokens for each item, thereby constructing a larger-scale diverse reasoning space. Furthermore, to enhance the reliability of reasoning, we propose a training reasoning enhancement stage, which includes Preference Alignment for Reasoning (PARS) and a Multi-Step Reward Augmentation (MSRA) strategy. PARS uses reward functions tailored for recommendation to enhance reasoning and reflection, while MSRA introduces future multi-step actions to improve overall generalization. During inference, Consistency-Oriented Self-Reflection for Pruning (CORP) is proposed to discard inconsistent reasoning paths, preventing the propagation of erroneous reasoning. Lastly, we develop an efficient offline training strategy for large-scale recommendation. Experiments on real-world datasets and online evaluations show that REG4Rec delivers outstanding performance and substantial practical value.

cs.IR↗

arXiv2026

Gopakumar-Vafa invariants associated to $cA_n$ singularities

This paper describes Gopakumar-Vafa (GV) invariants associated to $cA_n$ singularities. We (1) generalize GV invariants to crepant partial resolutions of $cA_n$ singularities, (2) show that generalized GV invariants also satisfy Toda's formula and are determined by their associated contraction algebra, (3) give filtration structures on the parameter space of contraction algebras associated to $cA_n$ crepant resolutions with respect to generalized GV invariants, and (4) numerically constrain the possible tuples of GV invariants that can arise. We further give all the tuples that arise from GV invariants of $cA_2$ crepant resolutions.

math.AG↗

arXiv2026

Constructing 3D Rotational Invariance and Equivariance with Symmetric Tensor Networks

Symmetry-aware architectures are central to geometric deep learning. We present a systematic approach for constructing continuous rotationally invariant and equivariant functions using symmetric tensor networks. The proposed framework supports inputs and outputs given as a tuple of Cartesian tensors of different rank as well as spherical tensors of different type. We introduce tensor network generators for invariant maps and obtain equivariant maps via differentiation. Specifically, we derive general continuous equivariant maps from vector inputs to Cartesian or spherical tensor output. Finally, we clarify how common equivariant primitives in geometric graph neural networks arise within our construction.

cs.LG↗

arXiv2026

Prior-Guided Residual Diffusion: Calibrated and Efficient Medical Image Segmentation

Ambiguity in medical image segmentation calls for models that capture full conditional distributions rather than a single point estimate. We present Prior-Guided Residual Diffusion (PGRD), a diffusion-based framework that learns voxel-wise distributions while maintaining strong calibration and practical sampling efficiency. PGRD embeds discrete labels as one-hot targets in a continuous space to align segmentation with diffusion modeling. A coarse prior predictor provides step-wise guidance; the diffusion network then learns the residual to the prior, accelerating convergence and improving calibration. A deep diffusion supervision scheme further stabilizes training by supervising intermediate time steps. Evaluated on representative MRI and CT datasets, PGRD achieves higher Dice scores and lower NLL/ECE values than Bayesian, ensemble, Probabilistic U-Net, and vanilla diffusion baselines, while requiring fewer sampling steps to reach strong performance.

cs.CV↗

arXiv2026

High-resolution wide-field magnetic imaging with sparse sampling using nitrogen-vacancy centers

Nitrogen-vacancy (NV) centers in diamond enable quantitative magnetic imaging, yet practical implementations must balance spatial resolution against acquisition time (and thus per-pixel sensitivity). Single-NV scanning magnetometry achieves genuine nanoscale resolution, nonetheless requires typically a slow pixel-by-pixel acquisition. Meanwhile, wide-field NV-ensemble microscopy provides parallel readout over a large field of view, however is jointly limited by the optical diffraction limit and the sensor-sample standoff. Here, we present a sparse-sampling strategy for reconstructing high-resolution wide-field images from only a small number of measurements. Using simulated NV-ensemble detection of ac magnetic fields, we show that a mean-adjusted Bayesian estimation (MABE) framework can reconstruct 10000-pixel images from only 25 sampling points, achieving SSIM values exceeding 0.999 for representative smooth field distributions, while optimized dynamical-decoupling pulse sequences yield an approximately twofold improvement in magnetic-field sensitivity. The method further clarifies how sampling patterns and sampling density affect reconstruction accuracy and suggests a route toward faster and more scalable magnetic-imaging architectures that may extend to point-scanning NV sensors and other magnetometry platforms, such as SQUIDs, Hall probes, and magnetic tunnel junctions.

quant-ph↗

arXiv2026

Stronger-MAS: Multi-Agent Reinforcement Learning for Collaborative LLMs

Multi-agent systems (MAS) and reinforcement learning (RL) are widely used to enhance the agentic capabilities of large language models (LLMs). MAS improves task performance through role-based orchestration, while RL uses environmental rewards to learn stronger policies, such as GRPO-style optimization. However, applying on-policy RL to MAS remains underexplored and presents unique challenges. Algorithmically, standard GRPO grouping assumptions break down because prompts vary by role and by turn. System-wise, the training stack must support MAS-workflow rollouts and on-policy updates for both single-policy and multi-policy models. We propose AT-GRPO, which includes (i) an agent- and turn-wise grouped RL algorithm tailored to MAS and (ii) a training system that supports both single- and multi-policy regimes. Across game, planning, coding, and math tasks, AT-GRPO delivers substantial gains. On long-horizon planning, it increases accuracy from a 14.0 to 47.0 percent single-agent RL baseline to 96.0 to 99.5 percent. It also improves reasoning performance, with average gains of 3.87 to 7.62 percent on coding tasks and 9.0 to 17.93 percent on math. Code and environments are available at: https://github.com/pettingllms-ai/PettingLLMs.

cs.LG↗

arXiv2026

SkyReels-V3 Technique Report

Video generation serves as a cornerstone for building world models, where multimodal contextual inference stands as the defining test of capability. In this end, we present SkyReels-V3, a conditional video generation model, built upon a unified multimodal in-context learning framework with diffusion Transformers. SkyReels-V3 model supports three core generative paradigms within a single architecture: reference images-to-video synthesis, video-to-video extension and audio-guided video generation. (i) reference images-to-video model is designed to produce high-fidelity videos with strong subject identity preservation, temporal coherence, and narrative consistency. To enhance reference adherence and compositional stability, we design a comprehensive data processing pipeline that leverages cross frame pairing, image editing, and semantic rewriting, effectively mitigating copy paste artifacts. During training, an image video hybrid strategy combined with multi-resolution joint optimization is employed to improve generalization and robustness across diverse scenarios. (ii) video extension model integrates spatio-temporal consistency modeling with large-scale video understanding, enabling both seamless single-shot continuation and intelligent multi-shot switching with professional cinematographic patterns. (iii) Talking avatar model supports minute-level audio-conditioned video generation by training first-and-last frame insertion patterns and reconstructing key-frame inference paradigms. On the basis of ensuring visual quality, synchronization of audio and videos has been optimized. Extensive evaluations demonstrate that SkyReels-V3 achieves state-of-the-art or near state-of-the-art performance on key metrics including visual quality, instruction following, and specific aspect metrics, approaching leading closed-source systems. Github: https://github.com/SkyworkAI/SkyReels-V3.

cs.CV↗

arXiv2026

Neuro Symbolic Knowledge Reasoning for Procedural Video Question Answering

In this work we present Knowledge Module Learning (KML) to understand and reason over procedural tasks that requires models to learn structured and compositional procedural knowledge. KML is a neurosymbolic framework that learns relation categories within a knowledge graph as neural knowledge modules and composes them into executable reasoning programs generated by large language models (LLMs). Each module encodes a specific procedural relation capturing how each entity type such as tools are related to steps, purpose of each tool, and steps of each task. Given a question conditioned on a task shown in a video, then KML performs multistep reasoning with transparent, traceable intermediate states. Our theoretical analysis demonstrated two desired properties of KML. KML satisfy strong optimal conditions for modelling KG relations as neural mappings, providing strong foundations for generalizable procedural reasoning. It also shows a bound on the expected error when it performs multistep reasoning. To evaluate this model, we construct a large procedural knowledge graph (PKG) consisting of diverse instructional domains by integrating the COIN instructional video dataset, and COIN ontology, commonsense relations from ConceptNet, and structured extractions from LLMs, followed by expert verification. We then generate question and answer pairs by applying graph traversal templates over the PKG, constructing the PKR-QA benchmark for procedural knowledge reasoning. Experiments show that KML improves structured reasoning performance while providing interpretable step-by-step traces, outperforming LLM-only and black-box neural baselines. Code is publicly available at https://github.com/LUNAProject22/KML.

cs.CV↗

arXiv2026

Hierarchical Transformers for Unsupervised 3D Shape Abstraction

We introduce HiT, a novel hierarchical neural field representation for 3D shapes that learns general hierarchies in a coarse-to-fine manner across different shape categories in an unsupervised setting. Our key contribution is a hierarchical transformer (HiT), where each level learns parent-child relationships of the tree hierarchy using a compressed codebook. This codebook enables the network to automatically identify common substructures across potentially diverse shape categories. Unlike previous works that constrain the task to a fixed hierarchical structure (e.g., binary), we impose no such restriction, except for limiting the total number of nodes at each tree level. This flexibility allows our method to infer the hierarchical structure directly from data, over multiple shape categories, and representing more general and complex hierarchies than prior approaches. When trained at scale with a reconstruction loss, our model captures meaningful containment relationships between parent and child nodes. We demonstrate its effectiveness through an unsupervised shape segmentation task over all 55 ShapeNet categories, where our method successfully segments shapes into multiple levels of granularity.

cs.CV↗

arXiv2026

ShieldedCode: Learning Robust Representations for Virtual Machine Protected Code

Large language models (LLMs) have achieved remarkable progress in code generation, yet their potential for software protection remains largely untapped. Reverse engineering continues to threaten software security, while traditional virtual machine protection (VMP) relies on rigid, rule-based transformations that are costly to design and vulnerable to automated analysis. In this work, we present the first protection-aware framework that learns robust representations of VMP-protected code. Our approach builds large-scale paired datasets of source code and normalized VM implementations, and introduces hierarchical dependency modeling at intra-, preceding-, and inter-instruction levels. We jointly optimize language modeling with functionality-aware and protection-aware contrastive objectives to capture both semantic equivalence and protection strength. To further assess resilience, we propose a protection effectiveness optimization task that quantifies and ranks different VM variants derived from the same source. Coupled with a two-stage continual pre-training and fine-tuning pipeline, our method enables models to generate, compare, and reason over protected code. Extensive experiments show that our framework significantly improves robustness across diverse protection levels, opening a new research direction for learning-based software defense. In this work, we present ShieldedCode, the first protection-aware framework that learns robust representations of VMP-protected code. Our method achieves 26.95% Pass@1 on L0 VM code generation compared to 22.58% for GPT-4o., and improves binary similarity detection Recall@1 by 10% over state of art methods like jTrans.

cs.CL↗

arXiv2026

Schubert line defects in 3d GLSMs, part I: Complete flag manifolds and quantum Grothendieck polynomials

We construct new half-BPS line defects in 3d $\mathcal{N}=2$ supersymmetric quiver gauge theories whose Higgs branches are complete flag manifolds $X = {\rm Fl}(n)$. Upon circle compactification, the bulk theory flows to a non-linear sigma model (NLSM) with target space $X$ and the line defects flow to objects supported on Schubert varieties $X_w \subseteq X$. These Schubert line defects form an important basis of the quantum K-theory of $X$. They are realized as $\mathcal{N}=2$ supersymmetric quantum mechanics (SQM) quivers coupled to the 3d gauge theory. We show that the insertion of the Schubert line defect restricts the target space of the 3d gauged linear sigma model (GLSM) to the Schubert variety $X_w$, with the 1d degrees of freedom physically realizing a Bott--Samelson resolution of $X_w$. Moreover, we verify in examples that the 1d flavored Witten index of the quiver SQM reproduces the (equivariant) Chern character of the structure sheaf $\mathcal{O}_{X_w}$ as a (double) quantum Grothendieck polynomial, generalizing previous results for $X$ a Grassmannian manifold. Our construction thus provides a more direct realization of the 3d GLSM/quantum K-theory correspondence for complete flag manifolds. Finally, in the small-circle limit, we obtain a 0d-2d coupled system that realizes the Schubert classes $[X_w]$ in the quantum cohomology ring of $X$.

hep-th↗

arXiv2026

Video-KTR: Reinforcing Video Reasoning via Key Token Attribution

Reinforcement learning (RL) has shown strong potential for enhancing reasoning in multimodal large language models, yet existing video reasoning methods often rely on coarse sequence-level rewards or single-factor token selection, neglecting fine-grained links among visual inputs, temporal dynamics, and linguistic outputs, limiting both accuracy and interpretability. We propose Video-KTR, a modality-aware policy shaping framework that performs selective, token-level RL by combining three attribution signals: (1) visual-aware tokens identified via counterfactual masking to reveal perceptual dependence; (2) temporal-aware tokens detected through frame shuffling to expose temporal sensitivity; and (3) high-entropy tokens signaling predictive uncertainty. By reinforcing only these key tokens, Video-KTR focuses learning on semantically informative, modality-sensitive content while filtering out low-value tokens. Across five challenging benchmarks, Video-KTR achieves state-of-the-art or highly competitive results, achieving 42.7\% on Video-Holmes (surpassing GPT-4o) with consistent gains on both reasoning and general video understanding tasks. Ablation studies verify the complementary roles of the attribution signals and the robustness of targeted token-level updates. Overall, Video-KTR improves accuracy and interpretability, offering a simple, drop-in extension to RL for complex video reasoning. Our code and models are available at https://github.com/zywang0104/Video-KTR.

cs.CV↗

arXiv2026

Schubert line defects in 3d GLSMs, part II: Partial flag manifolds and parabolic quantum polynomials

We construct Schubert line defects in the 3d $\mathcal{N}=2$ supersymmetric gauged linear sigma model (GLSM) with target space a partial flag manifold $X={\rm Fl}({\boldsymbol{k}};n)$, generalizing our construction for complete flag manifolds given in a companion paper arXiv:2512.19802 (part I). In the context of the 3d GLSM/quantum K-theory correspondence, the Schubert line defects are constructed as 1d $\mathcal{N}=2$ supersymmetric gauge theories coupled to the 3d field theory, and they flow to objects supported on Schubert varieties $X_w \subseteq X$ in the quantum K-theory. The flavored Witten index of the 1d defect is expected to compute the Chern character of $[\mathcal{O}_w]$ -- more precisely, it gives us a polynomial representative of the Schubert class in the quantum K-theory ring. We give strong evidence for this claim by showing in examples that the Witten indices of Schubert defects indeed reproduce a recently-defined set of polynomials that represent the Schubert classes in the Whitney presentation, which we call the parabolic Whitney polynomials. Moreover, upon using the quantum ring relations, we can convert these polynomials into seemingly new polynomials in the Toda presentation, which we call the parabolic quantum Grothendieck polynomials. These new polynomials specialize to known polynomials in various limits, including to the quantum Grothendieck polynomials in the case of the complete flag. In the 2d limit, our construction also realizes the Schubert classes $[X_w]$ in the quantum cohomology ring of the partial flag manifold, and the parabolic quantum Grothendieck polynomials then reduce to previously known parabolic quantum Schubert polynomials.

hep-th↗