Guided Tensor Lifting
summary
Automatic lifting from C to Taco uses an LLM to generate 10 candidate tensor expressions, extracts a probabilistic grammar from those samples, and drives enumerative synthesis (both a top-down enumerator and a bottom-up variant) with that guidance. Verification runs IO tests and bounded model checking with CBMC/CProver. Results: 99% coverage with the top-down path, up to 12x faster synthesis than prior tools, and example code shows 1.79x multicore and 24.1x GPU speedups over original C.
AI-written summary · about
chapters (22)
- 0:00Guided tensor lifting intro
- 0:23Program lifting & hardware specialization
- 1:51Automating language lifting
- 2:56Synthesis challenges & LLM approach
- 4:21LLM + enumerative search
- 5:02LLM in pipeline & prompting
- 6:06Probabilistic grammar & dimensional analysis
- 7:31Left-hand side tensor determination
- 8:12Extracting grammar from LLM
- 9:17Search with star enumeration
- 10:45Top-down vs bottom-up enumerators
- 11:47Verification with model checking
- 12:31Validation step for input-output equivalence
- 13:15Bounded model checking
- 14:00Benchmarks & baseline comparisons
- 15:02Results on coverage & speed
- 15:46Conclusion & future work
- 16:07Q&A
- 16:28Top-down vs bottom-up benefits
- 17:10Complex examples & limitations
- 18:17Handling unsolved benchmarks
- 19:00Closing remarks
related talks
28mC2TACO: Lifting Tensor Code to TACO
15mEnabling Tensor Language Model to Assist in Generating High-Performance Tensor...
24mVerified Tensor-Program Optimization Via High-Level Scheduling Rewrites
15mTACCL: Guiding Collective Algorithm Synthesis using Communication Sketches
11mQiMeng-Xpiler: Transcompiling Tensor Programs for Deep Learning Systems with a...
28mFunctional Sparse Tensor Compilation
22mTileLoom: Automatic Dataflow Planning for Tile-Based Languages on Spatial Dataflow Accel…
12mCoding Agents for Compiler Construction: Beyond the...
