Pricing the Risk of Runtime Compression: Anytime-Valid Admission and a Served-Output Law for Compressed Serving State

• URL: http://arxiv.org/abs/2608.15810v1
• Date: Sun, 16 Aug 2026 15:37:44 GMT
• Title: Pricing the Risk of Runtime Compression: Anytime-Valid Admission and a Served-Output Law for Compressed Serving State
• Abstract summary: We show a union budget exhausts on every long request in a production serving stack (100% of requests)<n>We replace it with an anytime-valid, physically accounted ledger whose bound holds at every one of 352,333 admission calls on live traffic.<n>A priced bound is worth nothing on a request one has not seen, so the third link is the quantifier.
• Score: 6.272878315342466
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Runtime compression of serving state trades quality for capacity with no priced guarantee: systems adapt precision on load signals with no soundness statement, and certified approaches budget request-level risk by a union bound over a pre-declared event count. We show the union budget exhausts on every long request in a production serving stack (100% of requests), and replace it with an anytime-valid, physically accounted ledger whose bound holds at every one of 352,333 admission calls on live traffic and which, in a pre-registered held-out confirmatory round, halves the exact-fallback rate at matched risk (0.30 -> 0.14) -- coverage is bought at a price the account states. We then price the remaining distance from the certified witness to what a user experiences: a machine-checked design law (TV <= tanh(a_q w_thr)) turns the served-TV target into a threshold knob, and a three-layer audit of its instantiation -- an operator-norm query envelope measured 1.5x from tight, a measured-ellipsoid replacement for the Cauchy-Schwarz ball that buys nothing (0.89x, held-out sound), and the gate's operating point (~700x) -- localizes the entire 1064x gap to the operating point, a price the law now states rather than an unknown. A priced bound is worth nothing on a request one has not seen, so the third link is the quantifier: exchangeable extrapolation across 80 serving histories replaces binary conformal prediction's vacuous certificates with order-statistic bounds that discriminate (0.41 against 0.51 calibration risk). All probabilistic kernels are Lean 4-checked (228 exported theorems, no sorry); which object deserves this machinery at all is settled empirically in a companion paper that adjudicates -- and rejects -- the natural alternative of certifying routing. What ships is an account: risk you can spend, a gap you can read off a law, and a bound that survives the request you have not seen.

Related papers

• Generator-Independent Runtime Assurance under Partial Observation [2.7954473524479275]
  Proposal-based controllers are increasingly deployed behind runtime verification gates.<n>We ask when the closed-loop safety guarantee decouples from the generator.
  arXiv  Detail & Related papers  (2026-09-05T11:40:42Z)
• Repeated-Game Security for Restaking-Based Verifiable Inference [2.9661360665913574]
  This paper shows that a one-round slashing condition can overstate security when inference is supplied repeatedly under the same stake.<n>We propose a deployable mechanism combining history-dependent challenges, reputation-weighted slashing, and stake vesting.
  arXiv  Detail & Related papers  (2026-08-10T03:03:56Z)
• Agents That Certify Their Own Exploits: Confidence-Scheduled Restricted Responses for Safe Opponent Exploitation [38.06569764716213]
  We introduce emphbudget-constrained confidence-scheduled restricted responses (CS-RNR)<n>CS-RNR is the first opponent-exploitation method whose safety guarantee is a certificate the agent computes on the strategy it actually deploys.
  arXiv  Detail & Related papers  (2026-07-30T16:57:57Z)
• Beyond Accuracy: Auditing Spatial Provenance in Visual Token Pruning for OCR-Critical MLLM Inference [22.335515110971475]
  Visual-token pruning is judged by answer quality at a fixed retention budget.<n>We turn this blind spot into an evidence-risk audit that couples answer behavior with geometric token-origin provenance.<n>We show that favorable target-verification points do not imply task-general compression.
  arXiv  Detail & Related papers  (2026-07-29T13:45:31Z)
• Looping Is Not Reliability: State-Bound Evidence and Typed Revision Contracts for Agentic Code Repair [36.56438114281786]
  We study the gap between finding a correct patch and retaining, verifying, and submitting it.<n>We derive an evidence-bound typed loop contract and instantiate its mechanically enforceable subset in a reference implementation.
  arXiv  Detail & Related papers  (2026-07-27T16:05:23Z)
• SFGA: A Statistics-First Gating Architecture with Adjudicative Escalation for Trustworthy SFT Data Procurement [2.8129261352670003]
  We present sys, a statistics-first gating architecture that treats procurement as a cost-aware routing problem.<n>Gate accepts a decision only when intervals are tight, sample sizes are adequate, and the axes agree.<n>We report honest negative diagnostics of the debate path: a con-side win rate of 0.80 and a 52% position-flip rate under advocate swapping.
  arXiv  Detail & Related papers  (2026-07-21T10:52:04Z)
• Look Again Before You Abstain:Budgeted Conformal Evidence Acquisition for Reliable Vision-Language Model [31.082191748525137]
  A principled remedy is selective prediction with a distribution-free guarantee-verify each claim and abstain when the claim is not grounded.<n>We show, however, that this guarantee is bought at a brutal price: to keep the hallucination rate below $5%$ on a balanced object-existence benchmark, a state-of-the-art conformal filter must abstain on more than $80%$ of claims.<n>We introduce Budgeted Conformal Evidence Acquisition (BCEA), which replaces the binary answer/abstain decision with a three-way choice: answer, abstain, or acquire additional visual evidence.
  arXiv  Detail & Related papers  (2026-06-15T13:02:50Z)
• Catching One in Five: LLM-as-Judge Blind Spots in Production Multi-Turn Transaction Agents [45.148328075418156]
  We study a deployed multi-turn food-and-beverage ordering agent and measure how many genuine quality problems it catches.<n>Our blind-spot taxonomy shows the failure is structured, not random.<n>For production multi-turn agents, automated judging is a regression floor, not a substitute for human review.
  arXiv  Detail & Related papers  (2026-06-09T02:11:01Z)
• A Joint Finite-Sample Certificate for Adaptive Selective Conformal Risk Control [0.9668407688201359]
  We give a certificate for bounded, possibly non-monotone losses by treating the selected risk directly as a ratio.<n>Relative to the range-only Hoeffding-ratio construction this sharpens the acceptance-floor dependence from $1/pmin$ to $1/sqrtpmin$.<n>The certificate opens a $+22$ pp certified-acceptance frontier over Hoeffding--CRC.
  arXiv  Detail & Related papers  (2026-06-07T08:55:44Z)
• Hierarchical Certified Semantic Commitment for Byzantine-Resilient LLM-Agent Collaboration [30.310793549183117]
  We introduce Hierarchical Certified Semantic Commitment (H-CSC), a BFT-inspired protocol that converts embedding-derived finality signals over verdict-emitting proposal groups into one of three typed outcomes.<n>H-CSC commits with low angular deviation on BFT-feasible buckets (0.31 to 2.04 degrees) and aborts 100% of beyond-BFT rounds (n3f+1) as intended.
  arXiv  Detail & Related papers  (2026-06-05T14:35:58Z)
• Knowing but Not Correcting: Routine Task Requests Suppress Factual Correction in LLMs [26.062372963777452]
  LLMs reliably correct false claims when presented in isolation, yet when the same claims are embedded in task-oriented requests, they often comply rather than correct.<n>We term this failure mode emphcorrection suppression and construct a benchmark of 300 false premises to systematically evaluate it across eight models.<n> Suppression rates range from 19% to 90%, with four models exceeding 80%, establishing correction suppression as a prevalent and severe phenomenon.
  arXiv  Detail & Related papers  (2026-05-07T10:04:39Z)
• Probabilistically Tightened Linear Relaxation-based Perturbation Analysis for Neural Network Verification [83.25968588249776]
  We present a novel framework that combines over-approximation techniques from LiRPA-based approaches with a sampling-based method to compute tight intermediate reachable sets.<n>With negligible computational overhead, $textttPT-LiRPA$ exploiting the estimated reachable sets, significantly tightens the lower and upper linear bounds of a neural network's output.
  arXiv  Detail & Related papers  (2025-07-07T18:45:53Z)

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.