FuseSearch: Learning Adaptive Parallel Execution for Efficient Code Localization (2026.findings-acl)
Copied to clipboard
Ke Xu, Siyang Xiao, Ming Liang, Yichen Yu, Zhixiang Wang, Jingxuan Xu, Dajun Chen, Wei Jiang, Yong Li
| Challenge: | Existing parallel code localization agents suffer from a 34.9% redundant tool invocation rate . specialized localization agent that operate as dedicated search components is needed to achieve high localization accuracy. |
| Approach: | They propose a parallel code localization system that reframes parallel code execution as a quality–efficiency co-optimization problem. |
| Outcome: | The proposed method matches SOTA performance while being 93.6% faster. |
Similar Papers
PExA: Parallel Exploration Agent for Complex Text-to-SQL (2026.acl-short)
Copied to clipboard
| Challenge: | Recent work in text-to-SQL has explored toolaugmented LLMs, deep planning, and agentic workflows to address complex challenges. |
| Approach: | They validated a framework for text-to-SQL, Spider 2.0, with 70.2% execution accuracy. |
| Outcome: | The proposed framework achieves 70.2% execution accuracy on a state-of-the-art benchmark for text-to-SQL, Spider 2.0. |
TRACE: Evaluating Execution Efficiency of LLM-Based Code Translation (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have improved the functional correctness of code translation, but execution efficiency remains overlooked. |
| Approach: | They propose a benchmark to explicitly assess execution efficiency in LLM-translated code. |
| Outcome: | The proposed benchmark identifies that execution efficiency is an essential dimension of code translation . the results highlight that correctness and efficiency are often misaligned . |
Exploring Data Augmentation for Code Generation Tasks (2023.findings-eacl)
Copied to clipboard
| Challenge: | Recent advances in natural language processing have impacted how models are trained for programming language tasks. |
| Approach: | They propose to use augmentation methods that yield consistent improvements in code translation and summarization by up to 6.9% and 7.5% respectively. |
| Outcome: | The proposed methods improve translation and summarization by 6.9% and 7.5% respectively. |
FusionFlow: Enabling Deep Structural Exploration for Automated Agentic Workflow Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Existing workflow generation methods rely on incremental refinement or tree-based search over a single evolving workflow. |
| Approach: | They propose a framework centered on workflow fusion that synthesizes multiple independently evolved workflows and allows exploration of deeper regions of the workflow space within a finite budget. |
| Outcome: | Experiments show that FusionFlow outperforms existing workflow generation methods on six reasoning benchmarks. |
Training Mixed-Domain Translation Models via Federated Learning (2022.naacl-main)
Copied to clipboard
| Challenge: | Experimental results show that neural machine translation engines built via FL can be easily adapted when an FL-based aggregation is applied to fuse different domains. |
| Approach: | They propose to use federated learning to fuse mixed-domain translation models with a centralized aggregation to improve their performance. |
| Outcome: | The proposed model can be easily adapted to a mixed-domain translation model with slight modifications in the training process and perform on par with state-of-the-art training models. |
AutoSearch: Adaptive Search Depth for Efficient Agentic RAG via Reinforcement Learning (2026.findings-acl)
Copied to clipboard
Jingbo Sun, Wenyue Chong, Songjun Tu, Qichao Zhang, Yaocheng Zhang, Jiajun Chai, Xiaohan Wang, Wei Lin, Guojun Yin, Dongbin Zhao
| Challenge: | Prior work limits search depth to reduce cost, but this often leads to underexploration of complex questions. |
| Approach: | They propose a reinforcement learning framework that evaluates each search step via self-generated intermediate answers. |
| Outcome: | Extensive experiments on multiple benchmarks show that AutoSearch achieves a superior accuracy-efficiency trade-off, alleviating over-searching while preserving search quality. |
PEGRL: Improving Machine Translation by Post-Editing Guided Reinforcement Learning (2026.findings-acl)
Copied to clipboard
| Challenge: | Reinforcement learning (RL) has shown strong promise for LLM-based machine translation . however, translation-oriented RL remains challenged by high-variance policy gradients induced by Monte Carlo baselines and large trajectory space that favors global exploration over fine-grained local optimization. |
| Approach: | They propose a two-stage RL framework that uses post-editing as an auxiliary task to stabilize training and guide overall optimization. |
| Outcome: | The proposed framework supports global exploration and fine-grained optimization while supporting global exploration. |
LocAgent: Graph-Guided LLM Agents for Code Localization (2025.acl-long)
Copied to clipboard
Zhaoling Chen, Robert Tang, Gangda Deng, Fang Wu, Jialong Wu, Zhiwei Jiang, Viktor Prasanna, Arman Cohan, Xingyao Wang
| Challenge: | Existing approaches struggle to efficiently navigate complex codebases when identifying relevant code snippets. |
| Approach: | They propose a graph-guided agent framework that addresses code localization through a distributed graph-based agent. |
| Outcome: | The proposed framework improves accuracy on real-world benchmarks and can be used to locate code snippets at a cost of 86%. |
ALPS: Attention Localization and Pruning Strategy for Efficient Adaptation of Large Language Models (2025.findings-acl)
Copied to clipboard
Hao Chen, Haoze Li, Zhiqing Xiao, Lirong Gao, Qi Zhang, Xiaomeng Hu, Ningtao Wang, Xing Fu, Junbo Zhao
| Challenge: | Prior research has focused on optimizing general-purpose large language models to downstream tasks . however, these approaches inherently introduce data dependency, which hinders generalization and reusability. |
| Approach: | They propose an algorithm that localizes the most task-sensitive attention heads and prunes by restricting attention training updates to these heads, thereby reducing alignment costs. |
| Outcome: | The proposed algorithm achieves 2% performance improvement over baselines on three tasks while localizing the most task-sensitive attention heads. |
Improving the Quality Trade-Off for Neural Machine Translation Multi-Domain Adaptation (2021.emnlp-main)
Copied to clipboard
| Challenge: | Building neural machine translation systems to perform well on a specific target domain remains a challenge. |
| Approach: | They propose to train a single NMT system per language pair that performs well across multiple domains. |
| Outcome: | The proposed approach improves the Pareto frontier on this task. |