Sign In

ReaComp: Compiling LLM Reasoning into Symbolic Solvers for Efficient Program Synthesis

์ž‘์„ฑ์ž
  • Haebom
์นดํ…Œ๊ณ ๋ฆฌ
Empty

์ €์ž

Atharva Naik, Yash Mathur, Prakam, Carolyn Rose, David Mortensen

๐Ÿ’ก ๊ฐœ์š”

๋ณธ ๋…ผ๋ฌธ์€ LLM์ด ํ”„๋กœ๊ทธ๋žจ ํ•ฉ์„ฑ์—์„œ ๊ฒช๋Š” ๋น„ํšจ์œจ์„ฑ๊ณผ ๋‚ฎ์€ ์‹ ๋ขฐ๋„๋ฅผ ํ•ด๊ฒฐํ•˜๊ธฐ ์œ„ํ•ด, ์†Œ์ˆ˜์˜ ์ถ”๋ก  ๊ณผ์ •์„ ๋ฐ”ํƒ•์œผ๋กœ ์žฌ์‚ฌ์šฉ ๊ฐ€๋Šฅํ•œ ๊ธฐํ˜ธ์  ํ”„๋กœ๊ทธ๋žจ ํ•ฉ์„ฑ๊ธฐ๋ฅผ ์ƒ์„ฑํ•˜๋Š” ReaComp ๋ฐฉ๋ฒ•๋ก ์„ ์ œ์•ˆํ•ฉ๋‹ˆ๋‹ค. ReaComp๋Š” LLM ํ˜ธ์ถœ ์—†์ด๋„ ๋›ฐ์–ด๋‚œ ์„ฑ๋Šฅ์„ ๋ณด์ด๋Š” ๋…๋ฆฝ์ ์ธ ์†”๋ฒ„๋ฅผ ๊ตฌ์ถ•ํ•˜๋ฉฐ, LLM์˜ ํƒ์ƒ‰ ๋Šฅ๋ ฅ์„ ๋ณด์™„ํ•˜์—ฌ ๋ณต์žกํ•œ ๋ฌธ์ œ ํ•ด๊ฒฐ ์ •ํ™•๋„๋ฅผ ๋†’์ด๊ณ  ์ถ”๋ก  ๋น„์šฉ์„ ํฌ๊ฒŒ ์ ˆ๊ฐํ•ฉ๋‹ˆ๋‹ค.

๐Ÿ”‘ ์‹œ์‚ฌ์  ๋ฐ ํ•œ๊ณ„

โ€ข
๋…๋ฆฝ์ ์ด๊ณ  ํšจ์œจ์ ์ธ ์†”๋ฒ„ ๊ตฌ์ถ•: LLM์— ์˜์กดํ•˜์ง€ ์•Š๊ณ ๋„ ๊ณ ์„ฑ๋Šฅ์˜ ๊ธฐํ˜ธ์  ์†”๋ฒ„๋ฅผ ๊ตฌ์ถ•ํ•  ์ˆ˜ ์žˆ์–ด, ์ถ”๋ก  ๋น„์šฉ ์—†์ด๋„ ๋ณต์žกํ•œ ๋ฌธ์ œ๋ฅผ ํ•ด๊ฒฐํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.
โ€ข
LLM๊ณผ์˜ ์‹œ๋„ˆ์ง€ ํšจ๊ณผ: ReaComp๋กœ ์ƒ์„ฑ๋œ ์†”๋ฒ„๋Š” LLM์˜ ํƒ์ƒ‰ ๊ณผ์ •์„ ๋ณด์™„ํ•˜์—ฌ ํ”„๋กœ๊ทธ๋žจ ํ•ฉ์„ฑ ์ •ํ™•๋„๋ฅผ ํ–ฅ์ƒ์‹œํ‚ค๊ณ  LLM์˜ ํ† ํฐ ์‚ฌ์šฉ๋Ÿ‰์„ ํš๊ธฐ์ ์œผ๋กœ ์ค„์ผ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.
โ€ข
์ƒˆ๋กœ์šด ๋ถ„์•ผ๋กœ์˜ ํ™•์žฅ์„ฑ: ์ƒ์„ฑ๋œ ์†”๋ฒ„๋Š” ์ž์—ฐ์–ด ๋ฐ์ดํ„ฐ์˜ ์Œ์„ฑ ๋ณ€ํ™” ์˜ˆ์ธก๊ณผ ๊ฐ™์€ ์‹ค์ œ ์–ธ์–ดํ•™ ๋ฌธ์ œ์—์„œ๋„ ๋†’์€ ์ •ํ™•๋„๋ฅผ ๋ณด์—ฌ, ๋„๋ฉ”์ธ ์ผ๋ฐ˜์ ์ธ ์†”๋ฒ„ ๊ตฌ์ถ•์˜ ๊ฐ€๋Šฅ์„ฑ์„ ์ œ์‹œํ•ฉ๋‹ˆ๋‹ค.
โ€ข
์ œํ•œ๋œ DSL (Domain-Specific Language)์—์„œ์˜ ์„ฑ๋Šฅ: ๋…ผ๋ฌธ์—์„œ ์ œ์‹œ๋œ ๋ฐฉ๋ฒ•๋ก ์€ ํŠน์ • ์ œ์•ฝ ์กฐ๊ฑด์ด ์žˆ๋Š” DSL์—์„œ ์ฃผ๋กœ ๊ฒ€์ฆ๋˜์—ˆ์œผ๋ฉฐ, ๋” ๊ด‘๋ฒ”์œ„ํ•˜๊ณ  ๋ณต์žกํ•œ DSL์— ๋Œ€ํ•œ ํ™•์žฅ์„ฑ ์—ฐ๊ตฌ๊ฐ€ ํ•„์š”ํ•ฉ๋‹ˆ๋‹ค.
๐Ÿ‘
Made with Slashpage