Compute-Bounded Security Assurance - Coverage, Verification, and Response under Resource Constraints

• URL: http://arxiv.org/abs/2609.09229v1
• Date: Mon, 07 Sep 2026 13:07:55 GMT
• Title: Compute-Bounded Security Assurance - Coverage, Verification, and Response under Resource Constraints
• Abstract summary: Additional inference compute can increase the number of correctly resolved security-assurance tasks.<n>We develop a resource-constrained framework that separates success, unique coverage, accepted evidence, and operational protection.<n>A conceptual defensive architecture separates evidence analysis, adjudication, and operational authority.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Additional inference compute can increase the number of correctly resolved security-assurance tasks, but repeated success, unique coverage, accepted evidence, and operational protection are different quantities. We develop a resource-constrained framework that separates them. For repeated conditionally independent attempts with latent success probability $Θ$, coverage is $C_n = 1 - E[(1-Θ)^n]$, and its limiting value is $1 - P(Θ= 0)$. Positive pairwise outcome correlation does not by itself imply a ceiling below one: we construct two models with the same mean success and pairwise correlation but different limiting coverage. We distinguish this result from the effective sample size used to estimate a mean, and show why finite-budget observations cannot generally identify an asymptotic support ceiling. We then connect coverage to fallible evidence checking, proper scoring of factual grounding, complete resource accounting, service capacity, and a response model that includes mitigation delay. A conceptual defensive architecture separates evidence analysis, adjudication, and operational authority. An evaluation protocol specifies held-out tasks, paired comparisons, negative cases, and uncertainty reporting. The contribution is a consistent theoretical synthesis and a set of counterexamples to invalid extrapolations, rather than an empirical scaling law. All numerical illustrations are analytic; no model-parity result, hardware benchmark, or general attacker-defender equilibrium is claimed.

Related papers

• Finite Constant Frontiers and Auditable Regret Certificates for Average-Reward Reinforcement Learning [0.9558392439655014]
  We introduce a constant-aware comparison protocol and derive an explicit finite lower certificate for communicating MDPs.<n>A common closed-form envelope improves the published coefficient $0.015$ across a finite frontier.
  arXiv  Detail & Related papers  (2026-08-07T19:28:58Z)
• When benchmark inferences do not compose: Projectibility in AI evaluation [0.0]
  An AI benchmark result rarely reaches a consequential claim in one step.<n>Evaluators generalize it to further cases, interpret it as evidence of capability, extrapolate it to new tasks, transport it to another system or site.<n>This paper identifies a further problem: warranted links don't automatically make a warranted chain.
  arXiv  Detail & Related papers  (2026-07-28T18:07:04Z)
• Tight Convergence Rates for Online Distributed Linear Estimation with Adversarial Measurements [66.94250413799232]
  We study mean estimation of a random vector $X$ in a distributed parameter-server-worker setup.<n>Key challenges are adversarial measurements and asynchrony.<n>Results provide a unified finite-time characterization of robustness, identifiability, and statistical efficiency in distributed linear estimation with adversarial workers.
  arXiv  Detail & Related papers  (2026-04-07T11:45:55Z)
• Cross-World Assumption and Refining Prediction Intervals for Individual Treatment Effects [6.083038976289835]
  For high-stakes decision-making, individual treatment effect estimates must be accompanied by valid prediction intervals.<n>For high-stakes decision-making, individual treatment effect estimates must be accompanied by valid prediction intervals.
  arXiv  Detail & Related papers  (2025-07-16T18:58:18Z)
• On the Precise Asymptotics of Universal Inference [1.0878040851638]
  This manuscript studies the gap between validity and conservativeness, using universal inference (Wasserman et al., 2020)<n>We identify the source of conservativeness and propose a general remedy based on studentization and bias correction.<n>The resulting method attains exact coverage at the nominal $1-alpha$ level, even under model misspecification.
  arXiv  Detail & Related papers  (2025-03-18T20:41:00Z)
• Counterfactual Realizability [52.85109506684737]
  We introduce a formal definition of realizability, the ability to draw samples from a distribution, and then develop a complete algorithm to determine whether an arbitrary counterfactual distribution is realizable.<n>We illustrate the implications of this new framework for counterfactual data collection using motivating examples from causal fairness and causal reinforcement learning.
  arXiv  Detail & Related papers  (2025-03-14T20:54:27Z)
• Sequential Manipulation Against Rank Aggregation: Theory and Algorithm [119.57122943187086]
  We leverage an online attack on the vulnerable data collection process. From the game-theoretic perspective, the confrontation scenario is formulated as a distributionally robust game. The proposed method manipulates the results of rank aggregation methods in a sequential manner.
  arXiv  Detail & Related papers  (2024-07-02T03:31:21Z)
• Neuro-Symbolic Entropy Regularization [78.16196949641079]
  In structured prediction, the goal is to jointly predict many output variables that together encode a structured object. One approach -- entropy regularization -- posits that decision boundaries should lie in low-probability regions. We propose a loss, neuro-symbolic entropy regularization, that encourages the model to confidently predict a valid object.
  arXiv  Detail & Related papers  (2022-01-25T06:23:10Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• Measuring Model Fairness under Noisy Covariates: A Theoretical Perspective [26.704446184314506]
  We study the problem of measuring the fairness of a machine learning model under noisy information. We present a theoretical analysis that aims to characterize weaker conditions under which accurate fairness evaluation is possible.
  arXiv  Detail & Related papers  (2021-05-20T18:36:28Z)
• A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
  We propose a weaker assumption that we call $2$-adjacency faithfulness. We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
  arXiv  Detail & Related papers  (2020-10-27T13:04:08Z)

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.