arXiv subjects

Runkai Zhu

Publications and source records attributed to Runkai Zhu.

3 recordsLinked to original sources

arXiv2026

AONA: A Comprehensive Architecture and Workflow Design for Global Agentic Collaboration

The rapid advancement of Large Language Models (LLMs) has established autonomous agents as the core vehicles for artificial intelligence applications. However, existing Internet infrastructures, primarily relying on TCP/IP and DNS, are designed for human-centric, host-to-host data transmission, inherently lacking the semantic awareness, dynamic capability discovery, and decentralized trust mechanisms required for autonomous agent interactions. To address these limitations and break the closed ecosystems of single vendors, this paper proposes AONA (Agentic Overlay Network Architecture), a novel overlay network architecture for the Internet of Agents (IoA). We first provide a multi-disciplinary scientific defense for multi-agent collaboration, demonstrating its theoretical necessity over single super-intelligence through the lenses of organizational economics, scaling principles, and the Price of Anarchy. AONA is then structured as a four-layer logical blueprint comprising the Base, Interconnection, Collaboration, and Application layers, which facilitates cross-protocol and cross-platform interoperability without disrupting the underlying physical network. To physically instantiate this blueprint, we design a distributed node infrastructure anchored by Management Root Nodes, Registry Service Nodes, Discovery Service Nodes, and Enterprise Intelligent Service Hubs for private domain integration. Finally, we detail the dynamic operational workflows-including zero-trust identity issuance, globally coordinated semantic taxonomy synchronization, intent-driven semantic discovery, and trusted metering for commercial settlement-that drive the network. This comprehensive architecture provides a robust, scalable, and secure foundation for the future of global agentic collaboration.

cs.NI↗

arXiv2025

Graph-guided Cross-composition Feature Disentanglement for Compositional Zero-shot Learning

Disentanglement of visual features of primitives (i.e., attributes and objects) has shown exceptional results in Compositional Zero-shot Learning (CZSL). However, due to the feature divergence of an attribute (resp. object) when combined with different objects (resp. attributes), it is challenging to learn disentangled primitive features that are general across different compositions. To this end, we propose the solution of cross-composition feature disentanglement, which takes multiple primitive-sharing compositions as inputs and constrains the disentangled primitive features to be general across these compositions. More specifically, we leverage a compositional graph to define the overall primitive-sharing relationships between compositions, and build a task-specific architecture upon the recently successful large pre-trained vision-language model (VLM) CLIP, with dual cross-composition disentangling adapters (called L-Adapter and V-Adapter) inserted into CLIP's frozen text and image encoders, respectively. Evaluation on three popular CZSL benchmarks shows that our proposed solution significantly improves the performance of CZSL, and its components have been verified by solid ablation studies. Our code and data are available at:https://github.com/zhurunkai/DCDA.

cs.CV↗

arXiv2023

MUST: An Effective and Scalable Framework for Multimodal Search of Target Modality

We investigate the problem of multimodal search of target modality, where the task involves enhancing a query in a specific target modality by integrating information from auxiliary modalities. The goal is to retrieve relevant objects whose contents in the target modality match the specified multimodal query. The paper first introduces two baseline approaches that integrate techniques from the Database, Information Retrieval, and Computer Vision communities. These baselines either merge the results of separate vector searches for each modality or perform a single-channel vector search by fusing all modalities. However, both baselines have limitations in terms of efficiency and accuracy as they fail to adequately consider the varying importance of fusing information across modalities. To overcome these limitations, the paper proposes a novel framework, called MUST. Our framework employs a hybrid fusion mechanism, combining different modalities at multiple stages. Notably, we leverage vector weight learning to determine the importance of each modality, thereby enhancing the accuracy of joint similarity measurement. Additionally, the proposed framework utilizes a fused proximity graph index, enabling efficient joint search for multimodal queries. MUST offers several other advantageous properties, including pluggable design to integrate any advanced embedding techniques, user flexibility to customize weight preferences, and modularized index construction. Extensive experiments on real-world datasets demonstrate the superiority of MUST over the baselines in terms of both search accuracy and efficiency. Our framework achieves over 10x faster search times while attaining an average of 93% higher accuracy. Furthermore, MUST exhibits scalability to datasets containing more than 10 million data elements.

cs.DB↗