Searcharxiv⌕ Search

arXiv subjects

Hao Zhou

Publications and source records attributed to Hao Zhou.

At least 55 records · Page 3Linked to original sources
arXiv2026

Terminal-Universe: Turning Agent Trajectories into Scalable Terminal Environments

As terminal-based code agents become prevalent, agent trajectories have accumulated at scale, while realistic, executable environments remain scarce. However, environments are what agent post-training actually requires: each can be re-queried into many verifiable tasks and provides execution feedback, whereas a trajectory is a single frozen demonstration. Rather than generating environments from scratch, we observe that the tool-execution history in existing trajectories exposes the structure and contents of the environments in which they ran, making it possible to reconstruct those environments from the trajectories themselves. Thus, we introduce Terminal-Universe, a framework which turns each trajectory into a reusable environment and explores it for synthesizing new tasks and continued interactions. Specifically, Terminal-Universe replays the file operations recorded in a trajectory to restore each file before the agent modified it, yielding a partial workspace; a completion agent then supplies the missing files and dependencies. On this recovered workspace, we both reconstruct the original intent task and synthesize entirely new ones. Besides, we also scale the tasks along two complementary axes: breadth and depth. For breadth, we mine directional dependency relations between related environments and synthesize cross-workspace queries spanning multiple codebases, as developers routinely do in real-world development. For depth, we extend the initial single-turn query into a multi-round session that captures iterative user feedback and requirement refinement via a user agent. Applied to public terminal agent trajectories, Terminal-Universe produces 37.3k task-sufficient environments. Supervised fine-tuning of Qwen3.5-27B on this corpus improves single-round performance on Terminal-Bench 2.1 by 11.9 points and multi-round performance on EvoCode-Bench v2 MT@4 by 13.8 points.

cs.AI↗
arXiv2026

Large Language Models (LLMs) for Telecom Root Cause Analysis (RCA): A Structured Reasoning Framework for Evidence-Grounded Diagnosis

Root cause analysis (RCA) is a critical task in telecom network operations, but diagnosing performance degradations in modern 5G and emerging 6G networks remains challenging due to complex cross-layer dependencies. While large language models (LLMs) offer promising capabilities for reasoning and knowledge integration, directly applying vanilla LLMs to telecom RCA often leads to hallucination, unstable reasoning, and poor alignment with structured network evidence. This work first reviews the evolution of telecom RCA from rule-based and machine learning (ML) approaches to emerging LLM-enabled techniques, and provides an overview of recent paradigms, including structured reasoning, retrieval-augmented knowledge grounding, agentic orchestration, and verifiable reasoning. Building upon these insights, we propose a structured reasoning framework for LLM-enabled telecom RCA that aligns diagnostic reasoning with telecom-specific evidence and domain knowledge. The proposed approach first organizes heterogeneous network telemetry into canonical contexts, and then enforces decision-path reasoning during diagnosis, and finally generates evidence-grounded explanations for reliable fault identification. Experimental results on two 5G RCA datasets, TeleLogs and TelecomTS, demonstrate that the proposed framework consistently improves diagnostic accuracy and decision consistency compared with baseline techniques. These cross-dataset results highlight the importance of structured reasoning design for practical LLM-based RCA systems in next-generation telecom networks.

cs.AI↗
arXiv2026

Investigating three-body resonances in $ααΩ/Ω_{ccc}$ clusters within the $^{9}_{Ω/Ω_{ccc}}{\mathrm{Be}}$ nucleus

We investigate the bound and resonant states of the $α+α+Ω$ and $α+α+Ω_{ccc}$ three-body systems, corresponding to $^{9}_Ω{\mathrm{Be}}$ and $^{9}_{Ω_{ccc}}{\mathrm{Be}}$, within the Gaussian expansion method combined with the complex scaling method. The $αΩ$ and $αΩ_{ccc}$ interactions are constructed by folding the $NΩ$ and $NΩ_{ccc}$ potentials obtained from lattice QCD calculations by the HAL QCD Collaboration with the nucleon density distribution of the $α$ particle. The uncertainty associated with the $α$-particle matter radius is also examined. For the $Ω$ sector, the strong $NΩ$ attraction generates deeply bound $0_1^+$, $2_1^+$, and $4_1^+$ states in $^{9}_Ω{\mathrm{Be}}$, accompanied by a pronounced contraction of the $αα$ core, demonstrating a strong gluelike effect of the $Ω$ baryon. An unconventional inversion between the $0_1^+$ and $4_1^+$ levels is also predicted. In contrast, the $Ω_{ccc}$ baryon produces considerably weaker attraction: the $0_1^+$ state of $^{9}_{Ω_{ccc}}{\mathrm{Be}}$ is weakly bound, whereas the $2_1^+$ and $4_1^+$ states remain resonances. Their resonance energies and widths exhibit a clear dependence on the strength of the $αΩ_{ccc}$ interaction. These results reveal qualitatively different gluelike behaviors of the $Ω$ and $Ω_{ccc}$ baryons and provide predictions for the spectroscopy of exotic multistrange and triply charmed hypernuclei.

hep-ph↗
arXiv2026

AgenticGen: Reward-Guided Agentic Video Generation for Advertising

Advertising video generation is not only a video synthesis task, but also a product-conditioned reasoning problem whose success is measured by online business metrics. Recent video foundation models can generate realistic clips from multimodal conditions, yet they do not optimize how a product should be transformed into an effective advertisement or how future generation should be improved from online business feedback. To close this loop, we propose AgenticGen, a reward-guided agentic framework that decomposes advertising video generation into two trainable reasoning stages, strategy selection and draft generation, thereby exposing optimization targets that online business feedback can supervise. AgenticGen learns a performance-based reward from accumulated online feedback and a complementary rubric-based reward aligned with human quality standards, then uses them to supervise policy optimization. DPO first moves the agentic policies toward online preferences, and GRPO further refines both stages with process and outcome rewards. Offline experiments validate the reward models and successive policy optimization. Online A/B experiments in the TikTok advertising system show that AgenticGen after DPO and GRPO improves CTR by 2.72%, CVR by 2.63%, and Advv by 9.61% over the SFT baseline.

cs.CV↗
arXiv2026

RAGDiffusion++: From Macro-Retrieval to Micro-Fidelity Alignment for Garment Generation

Standard clothing asset generation---restoring forward-facing flat-lay garment images from diverse real-world contexts---holds immense commercial value yet demands both macroscopic topological accuracy and microscopic physical fidelity. Although our previous work RAGDiffusion effectively eradicated large-scale structural hallucinations via retrieval-augmented macro-constraints, achieving industrial-grade micro-texture realism remains an unsolved bottleneck. We formally identify this limitation as High-Frequency Trajectory Collapse: supervised fine-tuning (SFT) converges to the conditional mean of the training distribution, which is dominated by smooth, low-frequency textures, causing high-frequency patterns (e.g., fabric weaves, intricate logos) to become nearly un-sampleable. Naively applying Reinforcement Learning (RL) post-training further triggers Artifact Hacking, where models exploit semantic biases in generic reward models by generating deceptive checkerboard noise. Our key insight is that RL can fundamentally reshape the sampling distribution of flow models---elevating the probability of high-fidelity trajectories under accurate reward guidance---while adversarial regularization prevents exploitation of reward blind spots. Realizing this principle requires three prerequisites: (i)inherent capacity, established through a 27,725-pair high-complexity garment dataset (STGarment-Plus) and a Dual-Image-Stream FLUX architecture upgrade; (ii)perceptive reward, provided by a novel attribute-aware reward model (Garment-RM) trained on 500K images via fine-grained contrastive learning, achieving 84.67% human preference accuracy; and (iii)hacking prevention, enforced by our Adversarial-Regularized GRPO (AR-GRPO) strategy that integrates a dynamic discriminator into the RL sampling trajectory to penalize artifacts while enriching authentic high-frequency details.

cs.CV↗
arXiv2026

Not Just Reason, Not Just Scan: Reinforcement Learning for Proactive Scientific Error Verification over Academic Paper

Multimodal large language models (MLLMs) are increasingly capable scientific assistants, yet they remain far from fully autonomous research. This transition requires models to actively inspect academic papers, build global evidence views, and make traceable judgments without prespecified issues or evidence. However, existing work provides limited task paradigms or training studies for such issue- and evidence-absent verification. We study this challenge through scientific error detection, where models must determine whether errors exist and justify them with evidence-based reasoning. To fill this gap, we present VERA-RL, a reinforcement-learning formulation for scientific error detection over academic papers. Following a Reason--Verify--Scan progression, we construct VERA-13K, a 12,900-sample dataset organized into 4,300 matched chains, covering 6 scientific-error categories across the research workflow and broad natural-science domains. We further introduce fine-grained rewards for reasoning completeness, evidence alignment, and error precision. Training Qwen3-VL-8B with VERA-RL substantially improves verifiable reasoning, approaching flagship MLLMs such as Gemini 3 Pro and Qwen3-VL-235B-A22B on Scan.

cs.CL↗
arXiv2026

Scale-CDA: A Scalable Aftermarket Platform to Democratize Cooperative Driving Automation in Production Cars

Scaling cooperative driving automation (CDA) to production passenger vehicles requires an affordable retrofit platform that can accommodate heterogeneous OEM Controller Area Network (CAN) signals and advanced driver-assistance system (ADAS) commands. Scale-CDA addresses this challenge by building on OpenDBC and openpilot, which provide vehicle interfaces and Level-2 automation support for more than 300 car models. The proposed open-hardware and open-software prototype integrates commodity edge computing, camera sensing, Wi-Fi, cellular communication, and a CAN adapter for less than $1,000. It exchanges telemetry and cooperative messages through MQTT over Wi-Fi~6 or LTE, avoiding costly DSRC or C-V2X sidelink radios. In moving-vehicle experiments, Wi-Fi~6 achieved a mean round-trip time of 5.25~ms and mean negotiated physical-layer rates of 98.51~Mb/s for transmission and 109.17~Mb/s for reception, with approximately 2% of observations exceeding 50~ms. These results demonstrate feasibility for non-safety-critical CDA applications. Scale-CDA also introduces a Generative AI interface that combines camera observations, CAN data, and connectivity messages through the Model Context Protocol. The model generates semantic message intents and structured MetaActions, while deterministic adapters validate and encode cooperative messages and map admissible actions to existing Level-2 functions without allowing direct actuator control. An on-road construction-zone demonstration validates driver advisory, message generation, and speed-related MetaAction pathways. Scale-CDA provides a reproducible platform for connectivity and GenAI research on supported production vehicles.

cs.ET↗
arXiv2026

Analytical Framework for Evaluating Traffic Capacity Impacts of Electric Vehicles' Regenerative Braking Dynamics

Regenerative braking (RB) significantly influences electric vehicle (EV) car-following (CF) dynamics, yet traditional traffic-flow models rarely capture these effects. We introduce a comprehensive empirical dataset comprising 197.5 hours of driving data from 25 drivers across eight EV models to systematically investigate regen-induced CF behaviors. Two primary CF patterns emerge: (i) steady-state scenarios where EVs use regenerative braking and subsequently re-accelerate to equilibrium speeds with larger spacing, and (ii) dynamic scenarios involving lead oscillations, characterized by a distinctive three-phase CF process-regenerative deceleration, transitional plateau, and rapid re-acceleration. The paper's main contribution is the development of an analytical framework that models these EV-specific CF behaviors and quantifies their impacts on traffic capacity. We derive closed-form expressions for the established $η$ function from the literature, explicitly quantifying EV driving deviations from stable CF defined by Newell's CF model and assessing their implications for roadway capacity. Validation against empirical data and simulation confirm the model's accuracy ($R^2=0.96$) in replicating real-world $η$ trajectories. Sensitivity analyses demonstrate that increased RB intensity, prolonged transitions, and shorter reaction delays significantly raise values and cumulative capacity losses. These findings highlight a clear trade-off between enhanced energy recovery through RB and reduced traffic efficiency, providing critical insights for EV-aware traffic modeling, control strategies, and transportation policy.

physics.soc-ph↗
arXiv2026

Enhancing LLM Metacognition via Cognitive Pairwise Training

Reinforcement learning with verifiable rewards (RLVR) has become central to LLM reasoning, but its outcome-level rewards can make models more willing to give confident answers when evidence or reasoning is unreliable. Existing SFT or RL methods mainly teach LLMs to refuse or express uncertainty at the response level, which can overfit abstention behavior rather than improve reasoning reliability. To address this limitation, we propose Cognitive Pairwise Training (CPT), a cognitive mid-training alignment stage that turns pairwise comparisons over reasoning traces into a reusable alignment signal. By learning to distinguish trustworthy from flawed reasoning, CPT encourages the model to internalize a reasoning-quality discrimination boundary rather than memorize surface refusal patterns. Across five model scales and three model families, CPT improves the reasoning--metacognition trade-off. At 14B, CPT+RL outperforms the standard SFT+RL pipeline by +2.2 math-average points and +5.6 abstention-F1 points. Further analyses show that CPT improves trace quality and exhibits strong robustness and scalability across evaluation and training settings. Code and models are released at https://github.com/Tsinghua-dhy/CPT.

cs.LG↗
arXiv2026

Open-MOPD: Diagnosing and Fixing Capability Imbalance in Multi-Teacher On-Policy Distillation

Multi-teacher on-policy distillation (M-OPD) has emerged as a promising paradigm for consolidating domain-specialized reinforcement learning (RL) experts into a single generalist student via dense, token-level reward supervision. Despite its practical success, the optimization dynamics governing multi-teacher capability integration remain poorly understood, and open, rigorously reproducible recipes are conspicuously lacking. In this work, we establish a controlled M-OPD benchmark on SmolLM3-3B-Base with oracle routing, isolating capability integration from routing ambiguity. Our investigation reveals a pronounced capability integration gap: standard M-OPD captures only 35.6% of the available headroom relative to a domain-routed oracle ensemble, with concise tasks such as instruction following suffering severe degradation and premature stagnation. Crucially, we show that this failure stems not from gradient conflict, but from a severe misallocation of the token-level optimization budget. This pathology is driven by three orthogonal factors: structural sequence-length disparities across domains, dynamic convergence drift due to non-uniform learning rates, and multi-step reward staleness from asynchronous policy updates. To resolve these imbalances, we introduce Open-MOPD, a principled framework incorporating token-share balancing, gap-aware dynamic budget allocation, and student reward refresh. Together, these mechanisms systematically restore cross-domain balance, elevating headroom recovery from 35.6% to 83.4% in a single deployable student. We fully open-source our end-to-end post-training recipe, training trajectories, and evaluation suites on an academically accessible hardware budget.

cs.LG↗
arXiv2026

Diffusion Models for Smarter UAVs: Decision-Making and Modeling

Uncrewed Aerial Vehicles (UAVs) are increasingly used in modern communication networks. However, challenges in decision-making and digital modeling continue to hinder their rapid development. Reinforcement Learning (RL) algorithms face limitations such as low sample efficiency and limited data versatility, which are further amplified in UAV communications scenarios. Additionally, Digital Twin (DT) modeling presents significant challenges in decision-making and data management. RL models, often integrated into DT frameworks to address these issues, require large amounts of training data to make accurate predictions. Unlike traditional approaches that focus on class boundaries, Diffusion Models (DMs)-a new class of generative AI-learn the underlying probability distribution from training data and can generate reliable new patterns based on this learned distribution. DT and RL have complementary roles in enabling intelligent, data-driven UAV operations. DMs further enhance this synergy by addressing data scarcity, improving modeling accuracy, and generating realistic scenarios, which benefit both DT simulations and RL training. In this paper, we explore the integration of DMs with RL and DT. Simulation results confirm the effectiveness and benefits of DMs in generating neighbor velocity estimates in a four-UAV swarm coordination task using Deep Reinforcement Learning (DRL).

cs.LG↗
arXiv2026

LAPF: LLM-Agent-Based Path Finder Using the UAVScenes Dataset

Uncrewed aerial vehicles (UAVs) are increasingly deployed for autonomous navigation in complex outdoor environments, where dynamic conditions and mission requirements require intelligent adaptive decision-making. Existing optimization-based, Machine Learning (ML), and Reinforcement Learning (RL) approaches often rely on predefined models or task-specific training, limiting their generalization and adaptability in uncertain scenarios. Recent Large Language Model (LLM)-assisted approaches offer promising reasoning capabilities but remain constrained by limited agentic functionality, including insufficient memory, planning, and tool interaction mechanisms.This paper proposes an LLM-Agent-Based Path Finder (LAPF) framework for autonomous UAV navigation in town-scale outdoor environments. LAPF extends LLM-assisted navigation by integrating perception, memory, planning, and action modules into a closed-loop cognitive architecture. The proposed agent leverages prior navigation experiences, performs Chain-of-Thought (CoT) reasoning, couples each detected hazard to a bounded corrective action, and dynamically refines waypoint decisions based on environmental feedback.The three independent trials per method demonstrate that LAPF achieves mean path lengths of 512.83 m and 506.37 m, compared to the straight-line optimum of 497.33 m, corresponding to path length reductions of 17.2% and 15.6% relative to CoT prompting and absolute path efficiencies of 97.1% and 98.1% in open-field and obstacle-injected scenarios, respectively. Furthermore, LAPF is the only evaluated approach that couples every detected hazard to a bounded, metric-neutral corrective action while maintaining near-goal stability, with zero clamp events in both scenarios, whereas CoT prompting increases from 9.7 to 14.0 events.

cs.RO↗
arXiv2026

Envs-FORGE: Frontier-Optimized Reward-Grounded Environment Synthesis for Agent RL

Reinforcement learning (RL) for terminal agents needs executable training environments with reliable rewards and useful difficulty. Fixed recipes such as few-shot, Self-Instruct, and Evol-Instruct apply the same prompting policy to every seed, even when the current policy would benefit from a harder, easier, or simply different task. We present Envs-FORGE, a prompting policy that converts verifier rewards into per-seed environment-synthesis actions. Envs-FORGE estimates seed pass rates, scores six projection--direction actions around a target learning frontier, and solves a per-seed mixed-integer linear program (MILP) to choose the action that conditions generation. The selected action drives synchronized rewriting of the instruction, fixtures, oracle solution, tests, and Docker environment; only gold-verified bundles enter RL training. The indexed MILP form also supports optional soft skill coverage for portfolio planning. On Qwen 3.5 35B, Envs-FORGE improves Pass@1 over Base by 9.2 percentage points on tb-core (40.0% to 49.2%) and 6.4 points on tb-2.0 (23.0% to 29.4%), exceeding the strongest fixed-recipe baseline by 2.4 and 2.1 points. It reaches 77.1% on SWE-bench Verified versus 73.4% for Base, and improves tb-core by 6.8--9.2 points across the evaluated 4B--35B models. All synthesis methods export 100 verified environments and use 2.27M--2.88M synthesis tokens, placing the comparison at the same downstream training-set size and the same operational scale. The source code is available at https://github.com/DataArcTech/DataArc-SynData-Toolkit/.

cs.CL↗
arXiv2026

Evo-Bench: Can Language Models Improve Agent Harness?

Large Language Models (LLMs) have driven rapid progress in autonomous agents, yet standard evaluations remain confined to static task solving. An emerging frontier is harness evolution---the agent's capacity to autonomously optimize its own operating harness. However, systematically benchmarking this capability remains challenging, as existing evaluations fail to isolate harness improvements from base model strength, prevent task-specific overfitting, or capture long-horizon iterative research. To address these challenges, we introduce Evo-Bench, the first benchmark designed to evaluate models' intrinsic harness-evolving capabilities across Search, Office, and General agent domains. To rigorously isolate this capability, Evo-Bench employs a novel harness-guided construction framework: it leverages auxiliary-task evolution to identify tasks genuinely sensitive to framework improvements, followed by sensitivity-aware stratified splitting to ensure robust cross-suite generalization. Extensive evaluations across nine frontier and open-weight models reveal that top models achieve massive absolute gains reaching 16.6 points, closely approaching state-of-the-art human-engineered baselines. Crucially, while autonomous evolution outpeforms artificial harness in General tasks and excels in Search tasks, it struggles in Office tasks that demand highly specific processing workflows. Furthermore, our analysis exposes critical temporal anomalies like early saturation, while demonstrating that the synthesized harnesses act as highly transferable reasoning structures, consistently boosting diverse policy models.

cs.CL↗
arXiv2026

AIC-VDS: Attention-Based In-Context Learning for Joint Velocity Control and Data Collection Scheduling in Multi-UAV-Assisted Pipeline Monitoring

Uncrewed aerial vehicles (UAVs) are increasingly deployed for autonomous inspection and sensor data collection in large-scale infrastructure monitoring applications, such as pipeline monitoring, where timely anomaly detection is critical. Jointly optimizing data-collection schedules and flight velocities is a critical challenge, as inefficiencies can increase packet loss and inspection latency. While online deep reinforcement learning (DRL) is a widely investigated approach, it suffers from low sample efficiency, substantial training requirements, and simulation-to-reality gaps in time-sensitive scenarios. Large language models (LLMs) offer a promising alternative through in-context learning (ICL); however, their substantial input requirements can introduce considerable computational and communication overhead. To address this, we propose Attention-Based In-Context Learning for Velocity Control and Data Collection Scheduling (AIC-VDS), a joint optimization framework designed to minimize packet loss under partial and potentially outdated local network-state information. AIC-VDS utilizes an attention module to process real-time network-state data, including sensor battery levels, sensor queue lengths, communication channel conditions, UAV locations, time since the previous sensor visit, and sensor urgency scores. This module extracts task-relevant features to reduce input overhead before querying the LLM. The LLM leverages these compressed natural-language prompts to generate adaptive data-collection schedules and velocity-control decisions for UAV execution. Simulation results show that the attention-based representation reduces the average prompt length by 50\%, while AIC-VDS rapidly stabilizes packet loss in the considered scenario.

cs.AI↗
arXiv2026

JoVA: Unified Multimodal Learning for Joint Video-Audio Generation and Editing

In this paper, we present JoVA, a streamlined framework that unifies joint video-audio generation and editing. While existing methods often rely on fragmented, task-specific architectures or complex fusion mechanisms, JoVA employs native joint representation learning for direct video, audio, and text interaction in a dual-branch architecture. This design eliminates redundant alignment modules and effectively unifies diverse multimodal tasks within a single model. Furthermore, we utilize channel-wise conditioning for flexible image and video reference to avoid massive token expansion, alongside a mouth-area loss to enhance lip alignment. To fully empower and systematically evaluate this framework, we construct a comprehensive training corpus encompassing video-audio generation and editing datasets, and introduce unified benchmarks tailored for these multimodal tasks. Extensive experiments demonstrate that JoVA achieves state-of-the-art performance across benchmarks, establishing it as an extensible framework for versatile content creation. Project page: https://visual-ai.github.io/jova

cs.CV↗
arXiv2026

MemAgent: Reshaping Long-Context LLM with Multi-Conv RL-based Memory Agent

Despite improvements by length extrapolation, efficient attention and memory modules, handling infinitely long documents with linear complexity without performance degradation during extrapolation remains the ultimate challenge in long-text processing. We directly optimize for long-text tasks in an end-to-end fashion and introduce a novel agent workflow, MemAgent, which reads text in segments and updates the memory using an overwrite strategy. We extend the DAPO algorithm to facilitate training via independent-context multi-conversation generation. MemAgent has demonstrated superb long-context capabilities, being able to extrapolate from an 8K context trained on 32K text to a 3.5M QA task with performance loss < 5% and achieves 95%+ in 512K RULER test.

cs.CL↗
arXiv2026

Readability-Robust Code Summarization via Meta Curriculum Learning

Code summarization has emerged as a fundamental technique in the field of program comprehension. While code language models have shown significant advancements, the current models and benchmarks are confined to high-readability code, which contains sufficient semantic cues such as function and variable names. In the real world, however, code is often poorly structured or obfuscated, significantly degrading model performance. In this paper, we first empirically evaluate the robustness of state-of-the-art language models on poor-readability code for the task of code summarization, focusing on (1) their effectiveness, (2) the impact of prompt engineering, and (3) the robustness of different variants. Experimental results reveal that state-of-the-art models-including GPT-4o and DeepSeek-V3 experience a substantial performance drop when faced with poorly readable code, and that prompt engineering and reasoning-enhanced models offer limited improvements. Motivated by these findings, we propose RoFTCodeSum, a novel fine-tuning method that enhances the robustness of code summarization against poorly readable code. RoFTCodeSum marries the concepts of curriculum learning and meta-learning: based on the original dataset for fine-tuning, it creates curricular training sets, e.g., obfuscating function names and identifiers from the code, respectively, that have progressive difficulty in code comprehension. In each training step, the approach meta-updates the gradients using these progressively challenging datasets, thereby optimizing both accuracy and readability robustness simultaneously. Experimental results demonstrate that RoFTCodeSum exhibits increased robustness against semantic perturbation while enhancing performance on the original code.

cs.SE↗