English
Related papers

Related papers: SATURN: SAT-based Reinforcement Learning to Unleas…

200 papers

Large Language Models (LLMs) demonstrate transformative potential, yet their reasoning remains inconsistent and unreliable. Reinforcement learning (RL)-based fine-tuning is a key mechanism for improvement, but its effectiveness is…

Machine Learning · Computer Science 2026-02-11 Pei-Chi Pan , Yingbin Liang , Sen Lin

Reinforcement learning (RL) has become a powerful approach for improving the reasoning capabilities of large language models (LLMs), as evidenced by recent successes such as OpenAI's o1 and Deepseek-R1. However, applying RL at scale remains…

Machine Learning · Computer Science 2025-06-23 Siru Ouyang , Xinyu Zhu , Zilin Xiao , Minhao Jiang , Yu Meng , Jiawei Han

Enhancing the reasoning capabilities of large language models (LLMs) typically relies on massive computational resources and extensive datasets, limiting accessibility for resource-constrained settings. Our study investigates the potential…

Machine Learning · Computer Science 2026-01-21 Quy-Anh Dang , Chris Ngo

Large reasoning models (LRMs), such as OpenAI o1 and DeepSeek-R1, have significantly enhanced their reasoning capabilities by generating longer chains of thought, demonstrating outstanding performance across a variety of tasks. However,…

Computation and Language · Computer Science 2025-10-31 Haoran Zhao , Yuchen Yan , Yongliang Shen , Haolei Xu , Wenqi Zhang , Kaitao Song , Jian Shao , Weiming Lu , Jun Xiao , Yueting Zhuang

Large language models (LLMs) with reasoning capabilities have fueled a compelling narrative that reasoning universally improves performance across language tasks. We test this claim through a comprehensive evaluation of 504 configurations…

Computation and Language · Computer Science 2026-03-02 Donghao Huang , Zhaoxia Wang

Tabular data serves as the backbone of modern data analysis and scientific research. While Large Language Models (LLMs) fine-tuned via Supervised Fine-Tuning (SFT) have significantly improved natural language interaction with such…

Reinforcement learning (RL) has demonstrated strong potential in training large language models (LLMs) capable of complex reasoning for real-world problem solving. More recently, RL has been leveraged to create sophisticated LLM-based…

Computation and Language · Computer Science 2025-05-22 Bowen Jin , Jinsung Yoon , Priyanka Kargupta , Sercan O. Arik , Jiawei Han

We propose STRuCT-LLM, a unified framework for training large language models (LLMs) to perform structured reasoning over both relational and graph-structured data. Our approach jointly optimizes Text-to-SQL and Text-to-Cypher tasks using…

Computation and Language · Computer Science 2025-06-30 Josefa Lia Stoisser , Marc Boubnovski Martell , Lawrence Phillips , Casper Hansen , Julien Fauqueur

The limited reasoning capabilities of small language models (SLMs) cast doubt on their suitability for tasks demanding deep, multi-step logical deduction. This paper introduces a framework called Small Reasons, Large Hints (SMART), which…

Computation and Language · Computer Science 2025-06-03 Yujin Kim , Euiin Yi , Minu Kim , Se-Young Yun , Taehyeon Kim

Despite the remarkable capabilities of large language models, current training paradigms inadvertently foster \textit{sycophancy}, i.e., the tendency of a model to agree with or reinforce user-provided information even when it's factually…

Artificial Intelligence · Computer Science 2025-09-23 Mohammad Beigi , Ying Shen , Parshin Shojaee , Qifan Wang , Zichao Wang , Chandan Reddy , Ming Jin , Lifu Huang

As Multimodal Large Language Models (MLLMs) mature, GUI agents are evolving from static interactions to complex navigation. While Reinforcement Learning (RL) has emerged as a promising paradigm for training MLLM agents on dynamic GUI tasks,…

Reinforcement learning (RL) with large language models shows promise in complex reasoning. However, its progress is hindered by the lack of large-scale training data that is sufficiently challenging, contamination-free and verifiable. To…

Existing large language models (LLMs) face challenges of following complex instructions, especially when multiple constraints are present and organized in paralleling, chaining, and branching structures. One intuitive solution, namely…

Computer Vision and Pattern Recognition · Computer Science 2025-10-01 Yulei Qin , Gang Li , Zongyi Li , Zihan Xu , Yuchen Shi , Zhekai Lin , Xiao Cui , Ke Li , Xing Sun

Reasoning abilities, especially those for solving complex math problems, are crucial components of general intelligence. Recent advances by proprietary companies, such as o-series models of OpenAI, have made remarkable progress on reasoning…

Boolean satisfiability (SAT) is a fundamental NP-complete problem with many applications, including automated planning and scheduling. To solve large instances, SAT solvers have to rely on heuristics, e.g., choosing a branching variable in…

Artificial Intelligence · Computer Science 2023-07-19 Mikhail Shirokikh , Ilya Shenbin , Anton Alekseev , Sergey Nikolenko

Reinforcement Learning (RL) has shown promise in improving the reasoning abilities of Large Language Models (LLMs). However, the specific challenges of adapting RL to multimodal data and formats remain relatively unexplored. In this work,…

Machine Learning · Computer Science 2025-05-20 Zirun Guo , Minjie Hong , Tao Jin

Long context reasoning in large language models (LLMs) has demonstrated enhancement of their cognitive capabilities via chain-of-thought (CoT) inference. Training such models is usually done via reinforcement learning with verifiable…

Computation and Language · Computer Science 2025-12-05 Purbesh Mitra , Sennur Ulukus

Large reasoning models (LRMs) achieve strong performance on complex reasoning tasks but often generate harmful responses to malicious user queries. This paper investigates the underlying cause of these safety risks and shows that the issue…

Artificial Intelligence · Computer Science 2026-04-22 Yeonjun In , Wonjoong Kim , Sangwu Park , Chanyoung Park

Ensuring large language model (LLM) reliability requires distinguishing objective unsolvability (inherent contradictions) from subjective capability limitations (tasks exceeding model competence). Current LLMs often conflate these…

Computation and Language · Computer Science 2026-02-03 Dengyun Peng , Qiguang Chen , Bofei Liu , Jiannan Guan , Libo Qin , Zheng Yan , Jinhao Liu , Jianshu Zhang , Wanxiang Che

Large language models (LLMs) achieve strong performance by generating long chains of thought, but longer traces always introduce redundant or ineffective reasoning steps. One typical behavior is that they often perform unnecessary…

Computation and Language · Computer Science 2026-01-13 Jinyi Han , Zixiang Di , Zishang Jiang , Ying Liao , Jiaqing Liang , Yongqi Wang , Yanghua Xiao
‹ Prev 1 3 4 5 6 7 10 Next ›