HintPilot: LLM-based Compiler Hint Synthesis for Code Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to optimize source code rely on invasive transformations that can introduce semantic errors and miss fine-grained compiler-level optimization opportunities. |
| Approach: | They propose a method that bridges LLM-based reasoning with traditional compilers by synthesizing compiler hints. |
| Outcome: | HintPilot achieves 6.88x speedup over -Ofast while preserving program correctness. |
Similar Papers
PLD+: Accelerating LLM Inference by Leveraging Language Model Artifacts (2025.findings-naacl)
Copied to clipboard
| Challenge: | speculative decoding is a novel decoding paradigm for large language models . however, its use is limited by its computational resources and fine-tuning requirements . |
| Approach: | They propose a tuning-free approach that accelerates inference of large language models . they use draft and verify principle to accelerate inference process . |
| Outcome: | The proposed approach outperforms tuning-free approaches on input-guided tasks and outperformed state-of-the-art EAGLE on four of the tasks. |
Can docstring reformulation with an LLM improve code generation? (2024.eacl-srw)
Copied to clipboard
| Challenge: | Existing approaches focus on training, fine-tuning or prompting LLMs to generate better outputs given the same input. |
| Approach: | They propose to optimize part of the input, the docstring, via reformulation with an LLM to improve code generation. |
| Outcome: | The proposed methods improve code generation on the original HumanEval benchmark and multiple curated variants on the same input. |
Efficient Inference for Large Language Models –Algorithm, Model, and System (2025.emnlp-tutorials)
Copied to clipboard
| Challenge: | Inference of LLMs incurs high computational costs, memory access overhead, and memory usage, leading to inefficiencies in terms of latency, throughput, power consumption, and storage. |
| Approach: | This tutorial introduces the basics of efficient inference for LLMs and explains how to diagnose efficiency bottlenecks for a given workload on specific hardware. |
| Outcome: | The tutorial introduces the basic concepts of modern LLMs, software and hardware. |
PlanE: Meta Planning of Data, Tuning, and Inference for Extractive-based LLMs (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for optimizing LLMs for task-specific tasks are limited due to the sheer volume of data. |
| Approach: | They propose a Planning framework for constructing Extractive-based LLMs called PlanE . they propose 'data decomposition', instruction tuning, prompt inference and a 'Data-Tuning-Inference' planner . |
| Outcome: | The proposed framework improves performance across different datasets and on different dataset. |
UniSpec: Training-Free Speculative Decoding for Robust LLM Acceleration Across Languages and Hardware (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for speculative decoding ignore device-specific verification costs and lack of mechanisms to assess draft token quality. |
| Approach: | They propose a training-free, lossless speculative decoding framework that enables robust, plug-and-play LLM acceleration across diverse hardware configurations and languages. |
| Outcome: | The proposed framework outperforms existing training-free methods while maintaining identical output quality across different hardware environments. |
SPECTRA: Faster Large Language Model Inference with Optimized Internal and External Speculation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to inference with Large Language Models (LLMs) are expensive and time-consuming. |
| Approach: | They propose a framework for accelerating large language model inference without additional training or modification to the original LLM. |
| Outcome: | The proposed framework outperforms state-of-the-art methods and achieves 4.08x speedups across benchmarks and LLM architectures. |
CodecLM: Aligning Language Models with Tailored Synthetic Data (2024.findings-naacl)
Copied to clipboard
Zifeng Wang, Chun-Liang Li, Vincent Perot, Long Le, Jin Miao, Zizhao Zhang, Chen-Yu Lee, Tomas Pfister
| Challenge: | Recent work on generating diverse instructions and applying LLM to increase instruction complexity neglects downstream use cases. |
| Approach: | They propose a framework for generating high-quality synthetic data for LLM alignment with different downstream instruction distributions and LLMs. |
| Outcome: | Experiments on four open-domain instruction using the proposed framework validate the effectiveness of CodecLM over the current state-of-the-art. |
InstructGraph: Boosting Large Language Models via Graph-centric Instruction Tuning and Preference Alignment (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing large language models (LLMs) can solve graph reasoning and generation tasks with parameter updates without sacrificing performance. |
| Approach: | They propose a structured format verbalizer to unify all graph data into a universal code-like format, which can simply represent the graph without any external graph-specific encoders. |
| Outcome: | The proposed framework outperforms GPT-4 and LLaMA2 in graph reasoning and generation tasks by more than 13% and 38%, respectively. |
Tree-of-Evolution: Tree-Structured Instruction Evolution for Code Generation in Large Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Data synthesis is a key research area in large language models (LLMs). |
| Approach: | They propose a framework that models code instruction synthesis process with a tree structure and optimization-driven evolution to alleviate constraints of unidirectional synthesis and randomness-driven generation. |
| Outcome: | The proposed framework outperforms open-weight code LLMs on five widely-used benchmarks. |
Mastering the Craft of Data Synthesis for CodeLLMs (2025.naacl-long)
Copied to clipboard
Meng Chen, Philip Arthur, Qianyu Feng, Cong Duy Vu Hoang, Yu-Heng Hong, Mahdi Kazemi Moghaddam, Omid Nezami, Duc Thien Nguyen, Gioacchino Tangari, Duy Vu, Thanh Vu, Mark Johnson, Krishnaram Kenthapadi, Don Dharmasiri, Long Duong, Yuan-Fang Li
| Challenge: | Large language models (LLMs) have shown impressive performance in code understanding and generation. |
| Approach: | They propose a systematic review of large language models and their taxonomy and propose specialized LLMs for code-related tasks. |
| Outcome: | The proposed models have shown to be highly effective in coding tasks. |