DARS: Dynamic Action Re-Sampling to Enhance Coding Agent Performance by Adaptive Tree Traversal (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to developing LLM-powered coding agents struggle with sub-optimal decision-making. |
| Approach: | They propose a novel inference time compute scaling approach that recovers from sub-optimal decisions by branching out a trajectory at certain key decision points by taking an alternative action given the history of the trajectory and execution feedback of the previous attempt. |
| Outcome: | The proposed approach achieves a pass@1 rate of 47% on the SWE-Bench Lite benchmark, outperforming state-of-the-art (SOTA) open-source frameworks. |
Similar Papers
When Life Gives You Samples: The Benefits of Scaling up Inference Compute for Multilingual LLMs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in large language models have shifted focus toward scaling inference-time compute. |
| Approach: | They propose to scale inference-time compute in a multilingual, multi-task setting . they propose to use m-ArenaHard-v2.0 prompts to sample multiple outputs in parallel . |
| Outcome: | The proposed solutions achieve an average +6.8 jump in win-rates for 8B models on m-ArenaHard-v2.0 prompts in non-English languages against proprietary models like Gemini. |
Benchmark Self-Evolving: A Multi-Agent Framework for Dynamic LLM Evaluation (2025.coling-main)
Copied to clipboard
| Challenge: | Recent advances in Large Language Models have demonstrated remarkable performance across tasks. |
| Approach: | They propose a benchmark self-evolving framework to dynamically evaluate rapidly advancing Large Language Models. |
| Outcome: | The proposed framework extends existing benchmarks to extend models across tasks and tasks. |
DR-Arena: an Automated Evaluation Framework for Deep Research Agents (2026.acl-long)
Copied to clipboard
| Challenge: | Existing benchmarks for evaluating deep research capabilities rely on static datasets. |
| Approach: | They propose a fully automated evaluation framework that pushes DR agents to their capability limits through dynamic investigation. |
| Outcome: | DR-Arena achieves a Spearman correlation of 0.94 with the LMSYS Search Arena leaderboard. |
CodeTree: Agent-guided Tree Search for Code Generation with Large Language Models (2025.naacl-long)
Copied to clipboard
| Challenge: | coding tasks require generated code to be fully executable and functionally correct . current agentic approaches struggle with multi-stage planning, generating, and debugging . |
| Approach: | They propose a framework for LLM agents to efficiently explore the search space in different stages of the code generation process. |
| Outcome: | The proposed framework achieves top results on 7 code generation benchmarks and a 31.9% solving rate on the SWEBench benchmark. |
FLAIRR-TS - Forecasting LLM-Agents with Iterative Refinement and Retrieval for Time Series (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Effective time series forecasting with large language models often relies on extensive pre-processing and fine-tuning. |
| Approach: | a new time series prompt optimization framework is developed to optimize time series forecasts. |
| Outcome: | The proposed framework improves forecasting over static prompting and retrieval-augmented baselines. |
AgentV-RL: Scaling Reward Modeling with Agentic Verifier (2026.findings-acl)
Copied to clipboard
Jiazheng Zhang, Ziche Fu, Zhiheng Xi, Wenqing Jing, Mingxu Chai, Wei He, Guoqiang Zhang, Chenghao Fan, Chenxin An, Wenxiang Chen, Zhicheng Liu, Haojie Pan, Dingwei Zhu, Tao Gui, Qi Zhang, Xuanjing Huang
| Challenge: | Existing approaches to improve LLM reasoning are limited in complex domains and lack external grounding makes verifiers unreliable on computation-intensive tasks. |
| Approach: | They propose a framework that transforms reward modeling into a multi-turn, tool-augmented deliberative process. |
| Outcome: | The proposed framework surpasses state-of-the-art ORMs by 25.2% under parallel and sequential TTS. |
Scaling LLM Inference Efficiently with Optimized Sample Compute Allocation (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing methods to optimize sample allocations for large language models fail to account for the optimal sampling configuration. |
| Approach: | They propose an algorithm that optimizes sample allocation by finding an optimal mix of different inference configurations. |
| Outcome: | The proposed algorithm achieves better accuracy on SWE-Bench with 3x less compute than the default configuration. |
Regression Aware Inference with LLMs (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown strong results on a range of applications, including regression and scoring tasks. |
| Approach: | They propose alternative inference strategies that estimate the Bayes-optimal solution for regression and scoring metrics in closed-form from sampled responses. |
| Outcome: | The proposed approach significantly improves over baselines across datasets and models. |
Tree of Agents: Improving Long-Context Capabilities of Large Language Models through Multi-Perspective Reasoning (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models face persistent challenges when handling long-context tasks . existing methods that reduce input have the risk of discarding key information . |
| Approach: | To address this issue, we propose a multi-agent reasoning framework called Tree of Agents . the framework segments input into chunks processed by independent agents . |
| Outcome: | The proposed model outperforms baseline models on long-context tasks. |
Training Turn-by-Turn Verifiers for Dialogue Tutoring Agents: The Curious Case of LLMs as Your Coding Tutors (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing studies have focused on coding tutoring, but their capabilities in guiding users to solve complex tasks remain underexplored. |
| Approach: | They propose a novel agent workflow, Trace-and-Verify, which combines knowledge tracing to estimate a student’s knowledge state and turn-by-turn verification to ensure effective guidance toward task completion. |
| Outcome: | The proposed agent workflow achieves significantly higher success rates than existing tutoring agents. |