๊ฐ€์ž… ํ›„ ์ดˆ๋Œ€ ๋งํฌ๋ฅผ ๊ณต์œ ํ•˜๋ฉด ๋™์˜์ƒ ์žฌ์ƒ ๋ฐ ์ดˆ๋Œ€ ๋ณด์ƒ์„ ๋ฐ›์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

cv usk
@cv_usk
AI / Software Research Notes AI Agent, LLMOps, MLOps, Software Architecture ๆŠ•็จฟใฏๅ€‹ไบบใฎๆ„่ฆ‹ใงใ™ใ€‚
๊ฐ€์ž… May 2026
270 ํŒ”๋กœ์ž‰ ์ค‘    316 ํŒฌ
TL;DR A new method runs a large teacher LLM just once to "compile by training" a small, dedicated neural function straight from a natural-language spec. It pushes accuracy on a hard benchmark way up in just minutes. Title: Compile by Training: Turning Natural-Language Specifications into Local Neural Functions URL: ๐ŸŽฏ A teacher mix of GPT-5.4-mini and GPT-5.5 (2:1) auto-generates input-output examples, which are baked into Qwen3-0.6B on the spot via LoRA (rank 64) โšก On the hard FuzzyBench-Hard benchmark, LEM accuracy jumps from 0.224 for the fast compiler to 0.836 ๐Ÿ•’ Compiling takes about 51 seconds on a B300 GPU, but running teacher data synthesis and training in parallel keeps the GPU from sitting idle ๐ŸŒ Validated across real use cases: a QA assistant spanning 4 sites (28 of 30 compiled programs in production) and a natural-language-to-3D-DSL controller (43 of 44 commands succeeded) ๐Ÿ“ˆ Ablations on teacher mixing and data scale show accuracy saturating around 2,400-3,600 unique pairs ๐Ÿ’ฌ Instead of calling a giant model every single time, training it once and carrying home a small function seems like a great fit for medium-complexity tasks that run often #LLM# #LoRA#
๋” ๋ณด๊ธฐ