Wei Zhang

Jincheng Ren, Siwei Wu, Yizhi Li et al.

As model capabilities advance, research has increasingly shifted toward long-horizon, multi-turn terminal-centric agentic tasks, where raw environment feedback is often preserved in the interaction history to support future decisions. However, repeatedly retaining such feedback introduces substantial redundancy and causes cumulative token cost to grow quadratically with the number of steps, hindering long-horizon reasoning. Although observation compression can mitigate this issue, the heterogeneity of terminal environments makes heuristic-based or fixed-prompt methods difficult to generalize. We propose TACO, a plug-and-play, self-evolving Terminal Agent Compression framework that automatically discovers and refines compression rules from interaction trajectories for existing terminal agents. Experiments on TerminalBench (TB 1.0 and TB 2.0) and four additional terminal-related benchmarks (i.e., SWE-Bench Lite, CompileBench, DevEval, and CRUST-Bench) show that TACO consistently improves performance across mainstream agent frameworks and strong backbone models. With MiniMax-2.5, it improves performance on most benchmarks while reducing token overhead by around 10%. On TerminalBench, it brings consistent gains of 1%-4% across strong agentic models, and further improves accuracy by around 2%-3% under the same token budget. These results demonstrate the effectiveness and generalization of self-evolving, task-aware compression for terminal agents.

Wenchi Cheng, Jingqing Wang, Zhuohui Yao et al.

To support mission-critical services in emergency scenarios, wireless networks are required to provide stringent guarantees under massive Ultra-Reliable Low-Latency Communications (mURLLC) constraints. Distributed unmanned aerial vehicle (UAV)-based massive multiple-input multiple-output (MIMO) architectures have recently emerged as a promising solution for rapidly deployable emergency communication systems. However, how to fundamentally characterize and guarantee statistical quality-of-service (QoS) for such systems in the finite blocklength regime remains largely unexplored. To overcome these challenges, in this paper we develop a fundamental analytical framework for delay and reliability bounded QoS guarantees in distributed UAV-based massive MIMO emergency networks under finite blocklength coding (FBC). By rigorously modeling the stochastic service process of distributed massive MIMO fading channels, we derive statistical characterizations the delay and error-rate bounded QoS exponents. We also establish QoS-driven controlling functions, including the $ε$-effective capacity and the feasible QoS region. Finally, the obtained simulation results validate and evaluate our developed modeling techniques and asymptotic formulations to support mURLLC.

Jinyu Chen, Long Shi, Taotao Wang et al.

The rapid growth of Web3.0 is transforming the Internet from a centralized structure to decentralized, which empowers users with unprecedented self-sovereignty over their own data. However, in the context of decentralized data access within Web3.0, it is imperative to cope with efficiency concerns caused by the replication of redundant data, as well as security vulnerabilities caused by data inconsistency. To address these challenges, we develop a Trustworthy Decentralized Cooperative Caching (TDC-Cache) framework for Web3.0 to ensure efficient caching and enhance system resilience against adversarial threats. This framework features a two-layer architecture, wherein the Decentralized Oracle Network (DON) layer serves as a trusted intermediary platform for decentralized caching, bridging the contents from decentralized storage and the content requests from users. In light of the complexity of Web3.0 network topologies and data flows, we propose a Deep Reinforcement Learning-Based Decentralized Caching (DRL-DC) for TDC-Cache to dynamically optimize caching strategies of distributed oracles. Furthermore, we develop a Proof of Cooperative Learning (PoCL) consensus to maintain the consistency of decentralized caching decisions within DON. Experimental results show that, compared with existing approaches, the proposed framework reduces average access latency by 20%, increases the cache hit rate by at most 18%, and improves the average success consensus rate by 10%. Overall, this paper serves as a first foray into the investigation of decentralized caching framework and strategy for Web3.0.