5 papers
Tree Equivalence of Higher-Order Recursion Schemes Is Undecidable
Mingkun Xiao, Yixuan Sun
Higher-order recursion schemes (HORS) are finite, simply typed recursive programs that generate potentially infinite trees. Their monadic second-order model-checking problem is dec…
Beyond Expert Rankings: Contrast Calibration for Mixed-Precision MoE Quantization
Renjie Xie, Juncheng Yang, Aoting Hu +5
Mixture-of-experts (MoE) language models activate only a few experts per token, yet all expert weights must be stored. Mixed-precision quantization reduces this storage cost by ass…
An Explicit Ordinal Bound for System T Dialogue Trees
MingKun Xiao, YiXuan Sun
Escardó's dialogue interpretation assigns to each closed term of Gödel's System~T a well-founded, countably branching tree , where is the natural-number t…
SWE-AGI: Benchmarking Specification-Driven Software Construction with MoonBit in the Era of Autonomous Agents
Zhirui Zhang, Hongbo Zhang, Haoxiang Fei +11
Although large language models (LLMs) have demonstrated impressive coding capabilities, their ability to autonomously build production-scale software from explicit specifications r…
ComAgent: Multi-LLM based Agentic AI Empowered Intelligent Wireless Networks
Haoyun Li, Ming Xiao, Kezhi Wang +3
Emerging 6G networks rely on complex cross-layer optimization, yet manually translating high-level intents into mathematical formulations remains a bottleneck. While Large Language…