GR-Agent: Adaptive Graph Reasoning Agent under Incomplete Knowledge
University of Oslo(奥斯陆大学);Bosch Center for AI(博世人工智能中心);University of Stuttgart(斯图加特大学);University of Oxford(牛津大学);Amazon(亚马逊);The University of Manchester(曼彻斯特大学);University of Southampton(南安普顿大学)
Large language models (LLMs) achieve strong results on knowledge graph question answering (KGQA), but most benchmarks assume complete knowledge graphs (KGs) where direct supporting triples exist. This reduces evaluation to shallow retrieval and overlooks the reality of incomplete KGs, where many facts are missing and answers must be inferred from existing facts. We bridge this gap by proposing a methodology for constructing benchmarks under KG incompleteness, which removes direct supporting triples while ensuring that alternative reasoning paths required to infer the answer remain. Experiments on benchmarks constructed using our methodology show that existing methods suffer consistent performance degradation under incompleteness, highlighting their limited reasoning ability. To overcome this limitation, we present the Adaptive Graph Reasoning Agent (GR-Agent). It first constructs an interactive environment from the KG, and then formalizes KGQA as agent environment interaction within this environment. GR-Agent operates over an action space comprising graph reasoning tools and maintains a memory of potential supporting reasoning evidence, including relevant relations and reasoning paths. Extensive experiments demonstrate that GR-Agent outperforms non-training baselines and performs comparably to training-based methods under both complete and incomplete settings.
From Passive to Active Reasoning: Can Large Language Models Ask the Right Questions under Incomplete Information?
TMLR Group, Department of Computer Science, Hong Kong Baptist University;Stanford University;Mila - Qu\'ebec AI Institute;Cooperative Medianet Innovation Center, Shanghai Jiao Tong University
LEAD: Length-Efficient Adaptive and Dynamic Reasoning for Large Language Models
University of Texas at Dallas(德克萨斯大学达拉斯分校);Emory University(埃默里大学);Individual Researcher(独立研究员);University of Texas at Arlington(德克萨斯大学阿灵顿分校);University of Florida(佛罗里达大学)
Mixture-of-Visual-Thoughts: Exploring Context-Adaptive Reasoning Mode Selection for General Visual Reasoning
Fudan University(复旦大学);Alibaba Group Holding Limited(阿里巴巴集团控股有限公司);Future Living Lab of Alibaba(阿里巴巴未来生活实验室);University of Southern California(南加州大学);Shanghai Innovation Institute(上海创新研究院)
SwarmSys: Decentralized Swarm-Inspired Agents for Scalable and Adaptive Reasoning
The Hong Kong University of Science and Technology (Guangzhou)(香港科学与技术大学(广州));New York University(纽约大学);The Hong Kong University of Science and Technology(香港科学与技术大学);NYU Shanghai(纽约大学上海分校);Indiana University(印第安纳大学);The Chinese University of Hong Kong(香港中文大学)
DART: Difficulty-Adaptive Reasoning Truncation for Efficient Large Language Models
School of Artificial Intelligence, Shanghai Jiao Tong University(上海交通大学人工智能学院);CSE Department, The Chinese University of Hong Kong(香港中文大学计算机科学与工程系);Research and Development Department, SIMMIR Tech(Simmir科技研发部);School of Information Science and Technology, Xiamen University Tan Kah Kee College(厦门大学信息科学与技术学院);The University of Hong Kong(香港大学)
Locatability-Guided Adaptive Reasoning for Image Geo-Localization with Vision-Language Models
The University of Utah(犹他大学);The University of Oklahoma(俄克拉荷马大学);Worcester Polytechnic Institute(沃斯特理工学院);Rensselaer Polytechnic Institute(雷士利理工学院);University of Illinois Chicago(伊利诺伊大学芝加哥分校)
SelfBudgeter: Adaptive Token Allocation for Efficient LLM Reasoning
State Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University(多媒体信息处理国家重点实验室,计算机学院,北京大学);BandAI, Bytedance(字节跳动BandAI)
ReasoningV: Efficient Verilog Code Generation with Adaptive Hybrid Reasoning Model
National Key Laboratory of Spintronics, Hangzhou International Innovation Institute(国家磁电子重点实验室、杭州国际创新研究院);School of Integrated Circuit Science and Engineering, Beihang University(集成电路科学与工程学院、北京航空航天大学)
Incentivizing Dual Process Thinking for Efficient Large Language Model Reasoning
Gaoling School of Artificial Intelligence, Renmin University of China(中国人民大学人工智能学院);Department of Computer Science, National University of Singapore(新加坡国立大学计算机科学系);Ant Group(蚂蚁集团)
Teaching LLMs According to Their Aptitude: Adaptive Reasoning for Mathematical Problem Solving
The Hong Kong University of Science and Technology(香港科学与技术大学);Huawei Noah’s Ark Lab(华为诺亚实验室);Zhejiang University(浙江大学);Peking University(北京大学);The Hong Kong Polytechnic University(香港理工大学);University of Surrey(萨里大学)
Adaptive Look, Flexible Thought: Learning How and How Long to Think in Multimodal Reasoning
Sun Yat-sen University(中山大学);Shenzhen Loop Area Institute(深圳河套学院);Beijing Zhongguancun Academy(北京中关村研究院);Huawei Technologies Co., Ltd(华为技术有限公司);Harbin Institute of Technology(哈尔滨工业大学)
What Breaks Knowledge Graph based RAG? Benchmarking and Empirical Insights into Reasoning under Incomplete Knowledge
University of Oslo(奥斯陆大学);Bosch Center for AI(博世人工智能中心);University of Stuttgart(斯图加特大学);Amazon(亚马逊公司);University of Oxford(牛津大学);The University of Manchester(曼彻斯特大学);University of Southampton(南安普顿大学)
Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming
我们在[Son and Baral 2000]中将感知行为和不完全信息的0-近似扩展到具有静态因果律的行为理论,并证明了它在可能世界语义上的可靠性。我们还表明,关于这个近似的条件规划问题是NP完全的。然后,我们提出了一个答案集编程为基础的条件规划,称为ASCP,这是能够产生符合计划和条件计划中存在的传感行动,不完整的信息的初始状态,和静态因果关系的法律。我们证明了我们的实现的正确性,并认为我们的计划是健全的和完整的建议的近似。最后,我们提出的实验结果比较ASCP到其他规划。
ASLSL: Adaptive shared latent structure learning with incomplete multi-modal physiological data for multi-dimensional emotional feature selection
School of Information Science and Technology, Beijing University of Technology, Beijing 100124, China(信息科学与技术学院,北京理工大学,北京);School of Artificial Intelligence, Anhui University, Beijing 100124, China(人工智能学院,安徽大学,北京)