arXiv (All)
open access
MOSAIC: More LLMs, Less Cost through Collaborative Reasoning for Compiler Optimizations
LLM-guided compiler optimization has recently shown promise. However, current LLM-guided optimizers query a single LLM at every search step, so their cost grows with both that model's price and the search budget. A smaller model is cheaper but degrades the search: in our experiments, a recent single
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- FeatLens: Feature-Guided Dynamic Code Graph Construction and Retrieval for Repository-Level Code Generation#1062371
- FeatLens: Feature-Guided Dynamic Code Graph Construction and Retrieval for Repository-Level Code Generation#1043143
- Why Do LLMs Fail at OCL Generation? A Graph Reasoning Perspective#1062025
- Improving the Energy-Efficiency of the Code Generated by LLMs through Effective Prompting#1186885
- Improving the Energy-Efficiency of the Code Generated by LLMs through Effective Prompting#1181711
Record · ID 1389187
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive