Empowering Smaller Models: Tuning LLaMA and Gemma with Chain-of-Thought for Ukrainian Exam Tasks
专题命中 复杂问题求解 :chain-of-thought(title,abstract);reasoning(abstract);分类 cs.CL、cs.AI
Comments 12 pages, 6 tables, 2 figures
AI 大模型
大模型数学、逻辑、规划、多步推理和测试时计算能力。
专题命中 复杂问题求解 :chain-of-thought(title,abstract);reasoning(abstract);分类 cs.CL、cs.AI
Comments 12 pages, 6 tables, 2 figures
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
Comments Accepted by NAACL 2025 main conference
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
Comments Supplementary materials, including code, is available on our GitHub: https://github.com/emcie-co/parlant/tree/arqs-a-systematic-method-for-optimizing-instruction-following-in-llms
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
Comments 21 pages, 7 figures, 3 tables
专题命中 复杂问题求解 :reasoning(title,abstract);logical reasoning(abstract);分类 cs.AI、cs.LG
Comments ICLR 2025 Poster;23 pages, 7 figures
专题命中 复杂问题求解 :reasoning(title,abstract);logical reasoning(abstract);分类 cs.CL、cs.AI
专题命中 复杂问题求解 :reasoning(title,abstract);CoT(abstract);分类 cs.CL、cs.AI
专题命中 复杂问题求解 :CoT(title,abstract);reasoning(abstract);分类 cs.CL、cs.AI
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
Comments This paper has been accepted by AAAI 2025
专题命中 复杂问题求解 :reasoning(title,abstract);CoT(abstract);分类 cs.CL、cs.AI
专题命中 复杂问题求解 :reasoning(title,abstract);planning(abstract);分类 cs.CL、cs.AI
Comments Accepted in EMNLP 2024 main conference
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
Comments 10 pages, 5 figures
专题命中 复杂问题求解 :self-correction(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
专题命中 复杂问题求解 :reasoning(title,abstract);CoT(abstract);分类 cs.CL、cs.AI
Comments Findings of ACL 2024
专题命中 复杂问题求解 :reasoning(title,abstract);planning(abstract);分类 cs.CL、cs.AI
Comments ICLR 2024
专题命中 复杂问题求解 :chain-of-thought(title,abstract);reasoning(abstract);分类 cs.AI、cs.LG
Comments 9 pages. In the Proceedings of the 41st International Conference on Machine Learning (ICML' 24)
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
专题命中 复杂问题求解 :reasoning(title,abstract);verifier(abstract);分类 cs.CL、cs.AI
专题命中 复杂问题求解 :reasoning(title,abstract);planning(abstract);分类 cs.AI、cs.LG
Comments Accepted by ICLR 2024
专题命中 复杂问题求解 :reasoning(title,abstract);self-correction(abstract);分类 cs.CL、cs.AI
Comments ICLR 2024
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
Comments AAAI 2024
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.AI、cs.LG
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
Comments Published as a conference paper at NeurIPS 2023
专题命中 复杂问题求解 :reasoning(title,abstract);planning(abstract);分类 cs.CL、cs.AI
专题命中 复杂问题求解 :reasoning(title,abstract);CoT(abstract);分类 cs.CL、cs.AI
Comments ACL 2023 (short, findings)
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.CL、cs.AI
专题命中 复杂问题求解 :reasoning(title,abstract);CoT(abstract);分类 cs.CL、cs.LG
Comments Accepted at ACL 2023 (Findings)
回答之前先解释:组合视觉推理综述
机构 * Monash University(墨尔本大学) ; Stanford University(斯坦福大学) ; University of Washington(华盛顿大学) ; Griffith University(格里菲斯大学) ; Princeton University(普林斯顿大学) ; Allen Institute for Artificial Intelligence(人工智能研究院)
专题命中 复杂问题求解 :reasoning(title,abstract);chain-of-thought(abstract);分类 cs.AI
AI总结 综述2023年至2025年组合视觉推理文献,形式化核心定义,追溯范式转变,编目基准指标,提炼见解、识别挑战并概述方向,为该领域提供统一分类、历史路线图和批判性展望。
Comments Project Page: https://github.com/pokerme7777/Compositional-Visual-Reasoning-Survey
表征、评估与优化复杂推理
机构 * School of Artificial Intelligence, Shanghai Jiao Tong University, Shanghai, China(上海交通大学人工智能学院) ; Shanghai Artificial Intelligence Laboratory, Shanghai, China(上海人工智能实验室) ; University of Science and Technology of China, Hefei, Anhui, China(中国科学技术大学) ; The Chinese University of Hong Kong, Hong Kong, China(香港中文大学) ; Nanjing University, Suzhou, Jiangsu, China(南京大学) ; Peking University, Beijing, China(北京大学)
专题命中 复杂问题求解 :reasoning(title,abstract);分类 cs.CL
AI总结 本文提出ME$^2$原则来表征推理质量,基于有向无环图(DAG)的成对评估方法,并构建TRM-Preference数据集训练Thinking Reward Model(TRM),以优化推理过程。
Comments Code and data are available at https://github.com/Simplified-Reasoning/TRM
机构 * Barcelona Supercomputing CenterSpain(巴塞罗那超级计算中心西班牙) ; Universitat Politècnica de CatalunyaSpain(巴塞罗那理工大学西班牙)
专题命中 复杂问题求解 :CoT(title,abstract);chain-of-thought(abstract);分类 cs.CL
Comments Accepted at Interspeech 2025