It is proved that for non-oversubscribed networks, there exists an optimal communication scheduling scheme capable of completely avoiding bandwidth contention among the scheduled flows in each collective-communication stage and achieves up to 77.5% reduction in iteration time compared to state-of-the-art methods.
Jian-Feng Bao, Wen-Peng Zhu, Gong-Ming Zhao et al.· IEEE Transactions on Network...· 0 citations
A lightweight utility-guided orchestration framework that formulates agent control as a costaware sequential decision problem over a compact action space, intended as an inspectable control layer for practical LLM services rather than a universally dominant accuracy optimizer.
Bo-Yang Liu, Gong-Ming Zhao, Hong-Liu Xu et al.· Fall Joint Computer Conferen...· 4 citations
Tool-augmented large language model (LLM) services can solve complex tasks through retrieval and external tools, but current execution paradigms often trade adaptability for efficiency. Fixed workflows are predictable but rigid, while freeform reasoning loops such as ReAct may over-execute and issue redundant tool call...
Bo-Yang Liu, Gongming Zhao, Hongliu Xu et al.· Fall Joint Computer Conferen...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.