arXiv (All)
open access
Query-Centric Optimization of AI Workflows via Approximate Query Processing and Proxy Models
Many modern AI workflows -- ranging from LLM post-training pipelines to agentic reasoning tasks -- can be expressed as declarative queries whose expensive predicate is evaluated by a large model or reward function. We propose a query-centric formulation of these workflows and show that classical dat
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
- CADENZA: Compiling Natural-Language Intent into Task-Specific Operator DAGs for Semantic Query Processing#324988
- Human-like Knowledge Invention: A Non Monotonic Reasoning framework#699174
- Horrila: Cost-Based Placement of Semantic Operators in Hybrid Query Plans#10460
- Training Advisors for LLM Agents from Task Outcomes#1234225
- When Plans Change Answers: Formalizing Cost-Accuracy Optimization for Semantic Queries#1217824
Record · ID 1326337
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