5 citations · 5 across the 12 of their papers we have counts for
4 papers · 1 filter
TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs
Burak S. Akbudak, Zeynel A. Uluşan, Can S. Erer +1
Tree search algorithms enable systematic exploration of the proof space in neural theorem proving. Existing LLM tree search libraries primarily target natural language reasoning an…
Just Ask for a Table: A Thirty-Token User Prompt Defeats Sponsored Recommendations in Twelve LLMs
Andreas Maier, Jeta Sopa, Gozde Gul Sahin +2
Wu et al. (2026) showed that most frontier large language models (LLMs) recommend a sponsored, roughly twice-as-expensive flight when their system prompt contains a soft sponsorshi…
FormalRewardBench: A Benchmark for Formal Theorem Proving Reward Models
Zeynel A. Uluşan, Burak S. Akbudak, Can S. Erer +1
Recent neural theorem provers use reinforcement learning with verifiable rewards (RLVR), where proof assistants provide binary correctness signals. While verifiable rewards are che…
Visual Reasoning through Tool-supervised Reinforcement Learning
Qihua Dong, Gozde Sahin, Pei Wang +4
In this paper, we investigate the problem of how to effectively master tool-use to solve complex visual reasoning tasks for Multimodal Large Language Models. To achieve that, we pr…