MasterControl Seventeen Every Time

• URL: http://arxiv.org/abs/2609.03209v1
• Date: Wed, 02 Sep 2026 22:49:35 GMT
• Title: MasterControl Seventeen Every Time
• Abstract summary: governed approach to enterprise analytics: a language model interprets the question, while deterministic policy selects and runs a pre-approved analytical program that returns both results and evidence.<n>We show that this restriction can remain expressive within a defined analytical class, using relational operations plus aggregation, comparison, windows, ranking, and similarity.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study a governed approach to enterprise analytics: a language model interprets the question, while deterministic policy selects and runs a pre-approved analytical program that returns both results and evidence. We show that this restriction can remain expressive within a defined analytical class, using relational operations plus aggregation, comparison, windows, ranking, and similarity. Fixed meaning, policy, data, and execution rules also make results replayable. Across 440 runs, three 8B models generated SQL and selected tools at runtime, while Qwen3-8B interpreted intent only and policy executed the approved program. None of 330 runtime-planning episodes matched the full answer-and-evidence contract across all test datasets; the policy-executed analyzer matched 110 of 110. This is a configuration-specific result, not evidence that runtime agents cannot succeed under other designs.

Related papers

• text2ql: Multi-Target Natural Language Querying via a Language-Agnostic Intermediate Representation [0.9927219503124457]
  This paper presents text2ql, an open-source Python architecture for natural language interfaces.<n>It addresses three structural limitations of natural language interfaces to databases.<n>It is based on a language-agnostic Intermediate Representation (QueryIR) architecture.
  arXiv  Detail & Related papers  (2026-09-02T05:09:51Z)
• Evaluating Enterprise Analytics Agents: An End-to-End, Trace-Backed Methodology [10.411056951115214]
  We present an end-to-end evaluation methodology for analytics agents.<n> Grading uses question banks with human-written golden answers, repeated runs, and runtime traces.<n>We instantiate the methodology on a controlled internal analytics agent at a large online marketplace.
  arXiv  Detail & Related papers  (2026-08-28T20:57:45Z)
• Bounded Semantic Planning and Deterministic Compilation for Reliable Enterprise Text-to-SQL [0.0]
  We evaluate a semantic path compilation system against direct DDL-to-sided generation on the ACME insurance benchmark.<n>SPC answered all 38 questions correctly at least once and produced one refusal and no adjudicated wrong-but-executed run across 114 run outcomes.
  arXiv  Detail & Related papers  (2026-08-17T14:54:51Z)
• HANDBOOK.md: A Benchmark for Long-Context Agentic Instruction Following [0.8998688639218773]
  Handbook_md is a benchmark of 65 agentic tasks modeled on how employees follow company handbooks.<n>Tasks span five domains (finance, medical billing, insurance, logistics, and HR) and 10 fictional companies.<n> Grading is fully deterministic: each task carries a rubric of programmatic criteria that check both that required actions occurred and that prohibited actions did not.
  arXiv  Detail & Related papers  (2026-07-28T07:58:07Z)
• Spider 2.0-AIFunc: Extending Real-World Text-to-SQL to AI-Native SQL Workflows [54.49251107006261]
  We introduce Spider 2.0-AIFunc, a benchmark of 465 verified instances across 125 real-world databases covering six types of AI functions on the Snowflake platform.<n>We find that the strongest proprietary models reach 67-70% execution accuracy while the best open-source model achieves 58.1%.
  arXiv  Detail & Related papers  (2026-07-07T12:54:08Z)
• It's not the Language Model, it's the Tool: Deterministic Mediation for Scientific Workflows [0.27998963147546146]
  Language models can produce convincing scientific analyses, but repeated generations on the same data do not guarantee the same result.<n>We propose typed mediation, a pattern in which the model orchestrates deterministic tools rather than generating analytical code.<n>We deploy this pattern on two instruments serving users over approximately six months, with very positive user feedback.
  arXiv  Detail & Related papers  (2026-05-13T09:30:56Z)
• Sigma: A dataset for text-to-code semantic parsing with statistical analysis [9.781031411221395]
  SIGMA comprises 6000 questions with corresponding Python code labels, spanning across 160 databases.<n>Half of the questions involve query types, which return information in its original format.<n>The Python code labels in our dataset cover 4 types of query types and 40 types of statistical analysis patterns.
  arXiv  Detail & Related papers  (2025-04-05T23:30:20Z)
• CLOVER: A Test Case Generation Benchmark with Coverage, Long-Context, and Verification [71.34070740261072]
  This paper presents a benchmark, CLOVER, to evaluate models' capabilities in generating and completing test cases.<n>The benchmark is containerized for code execution across tasks, and we will release the code, data, and construction methodologies.
  arXiv  Detail & Related papers  (2025-02-12T21:42:56Z)
• Few-shot Policy (de)composition in Conversational Question Answering [54.259440408606515]
  We propose a neuro-symbolic framework to detect policy compliance using large language models (LLMs) in a few-shot setting.<n>We show that our approach soundly reasons about policy compliance conversations by extracting sub-questions to be answered, assigning truth values from contextual information, and explicitly producing a set of logic statements from the given policies.<n>We apply this approach to the popular PCD and conversational machine reading benchmark, ShARC, and show competitive performance with no task-specific finetuning.
  arXiv  Detail & Related papers  (2025-01-20T08:40:15Z)
• UQE: A Query Engine for Unstructured Databases [71.49289088592842]
  We investigate the potential of Large Language Models to enable unstructured data analytics. We propose a new Universal Query Engine (UQE) that directly interrogates and draws insights from unstructured data collections.
  arXiv  Detail & Related papers  (2024-06-23T06:58:55Z)
• Proton: Probing Schema Linking Information from Pre-trained Language Models for Text-to-SQL Parsing [66.55478402233399]
  We propose a framework to elicit relational structures via a probing procedure based on Poincar'e distance metric. Compared with commonly-used rule-based methods for schema linking, we found that probing relations can robustly capture semantic correspondences. Our framework sets new state-of-the-art performance on three benchmarks.
  arXiv  Detail & Related papers  (2022-06-28T14:05:25Z)
• Taming the Expressiveness and Programmability of Graph Analytical Queries [74.65487393973993]
  Graph database has enjoyed a boom in the last decade, and graph queries gain a lot of attentions. We focus on analytical queries in this paper. Motivated by this, we propose the flash DSL, which is named after the three primitive operators Filter, LocAl and PuSH.
  arXiv  Detail & Related papers  (2020-04-20T04:08:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.