arrow
Return

ELTC: An End-to-End Large Language Model-Based Tensor Compilation Optimization Framework

delete2026-01-01
delete0
PRE
AI
W
Wenbo Ma
Q
Qingzeng Song *
F
Fei Qiao
X
Xue, YongJiang
S
Sun, MingZe
DOI:10.1007/978-981-95-3585-9_12delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Tensor program optimization is a non-convex optimization problem, and efficiently solving it while balancing optimization efficiency and execution performance remains a challenging task. Search-based tensor program compilers have proven effective by constructing large-scale exploration spaces that include potentially high-performance program variants, thus overcoming the performance bottlenecks of traditional program optimization methods. However, these approaches still face significant challenges in search strategies, as existing compilers often require hours or even days to identify the optimal program representation. This paper proposes ELTC, an end-to-end tensor program compilation framework based on large language models (LLMs), designed for efficient optimization of tensor programs in deep neural networks. ELTC formulates the tensor program exploration problem as a generation task for language models. By training a large language model offline, it generates transformation sequences for tensor programs in an end-to-end manner based on their feature representations. While preserving the broad search space, this approach significantly improves optimization efficiency. Moreover, we introduce a language-model-friendly intermediate representation, which encodes key features of tensor programs using structured textual formats. Based on this representation, we construct a tensor program dataset tailored for language models. Experimental results demonstrate that ELTC achieves superior performance in both optimization quality and tuning speed. Compared with the fully converged AnsorTenSet, ELTC achieves a 34.07x compilation speedup and an average performance improvement of 1.06x under convergence conditions. Furthermore, ELTC outperforms the manually optimized kernel library TensorRT, achieving a 1.3x performance gain.
Keywords:
Program Transformation
Compiler
Large Language Models

Journal

P
PROGRAMMING LANGUAGES AND SYSTEMS, APLAS 2025
IF:
0
Papers:
13
Citations:
0

Organization

T
tsinghua university
Scholars:
11.9W
Papers: 10.0W
Citations: 137
T
tiangong university
Scholars:
2.6K
Papers: 804
Citations: 0
Cited Papers

Cited Papers

Augmented Reality meets Deep Learning
err2017-01-01
err0
errOAAI
errHassan Abu Abu; Siva Karthik Mustikovela; Lars Mescheder; Andreas Geiger; Carsten Rother
errShare
errSave
Halide
err2013-06-16
err0
errOAAI
errJonathan Ragan-Kelley; Connelly Barnes; Andrew Adams; Sylvain Paris; Frédo Durand; Saman Amarasinghe
errShare
errSave
Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code
err2019-02-01
err0
errOAAI
errRiyadh Baghdadi; Jessica Ray; Malek Ben Romdhane; Emanuele Del Sozzo; Abdurrahman Akkas; Yunming Zhang; Patricia Suriana; Shoaib Kamil; Saman Amarasinghe
errShare
errSave
MLIR: Scaling Compiler Infrastructure for Domain Specific Computation
err2021-02-27
err0
PREAI
errChris Lattner; Mehdi Amini; Uday Bondhugula; Albert Cohen; Andy Davis; Jacques Pienaar; River Riddle; Tatiana Shpeisman; Nicolas Vasilache; Oleksandr Zinenko
errShare
errSave
no more