arXiv — cs.AI preprintsInternational7 October 2026
When Plans Change Answers: Formalizing Cost-Accuracy Optimization for Semantic Queries
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.08089v1 Announce Type: cross Abstract: In semantic query engines, predicates are evaluated by machine-learned models, and the choice of a query plan affects not only the cost of a query but also its result. Existing systems either apply a fixed threshold to each semantic operator or tune accuracy per operator, without accounting for how errors propagate through joins. We give a formal problem definition for cost-accuracy optimization of such queries. Our starting point is the calibrated confidence that decision models such as Jev attach to each decision. It yields an expected error
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- GAMEGO: Training Game-Dev Agents with Synthetic Trajectories Anchored in Real-World Assets7 October 2026
- Text2Dashboard: A Governed Agent Architecture for Natural-Language Dashboard Generation over Enterprise DataBrain7 October 2026
- FluidPD: In-Place Elasticity for SLO-Aware Prefill-Decode Disaggregated LLM Serving7 October 2026
- Anchor Divergence for Semantic Geometry in Contrastive Learning7 October 2026
- RadOnc-Agent: An LLM-Orchestrated Framework for AI Workflows Across the Radiotherapy Care Pathway7 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.