Back to Rankings

Visual Compliance via Executable Safety Rule Entailment

Jisoo Kim, TaeYoon Kwack, Jinwoo Jang, Honguk Woo

Sep 16, 2026arXiv:2609.18328v1
cs.AI
Share
Scorecard· 16/16
7.0/10 impact

A well-framed neuro-symbolic reformulation of visual compliance with unusually comprehensive evaluation and a new multi-domain benchmark, tempered by generated-data validity and partial reproducibility.

Abstract

Recent advances in LLMs and VLMs have enabled safety systems to reason beyond simple risk patterns toward more contextual and semantic safety concerns. However, as risk patterns continue to evolve and safety rules become more complex, existing training-based end-to-end safeguards face persistent challenges in adaptability and explainable reasoning over complex safety rules. To address these challenges, we propose GuardEn (Guarding by Safety Rule Entailment), an executable safeguard framework that decomposes safety policies into atomic propositions through Safety-Rule Compilation, modeling their composition as executable code. At test time, Scene-Grounded Execution instantiates these atomic propositions with contextual visual information derived from scene graphs, enabling rule-grounded and interpretable safety reasoning. Experiments on SafetyVisionBench demonstrate the effectiveness of programmable safeguard for complex visual safety assessment, achieving an average improvement of 9.8 F1 points over the strongest baseline.

AI Impact Assessments

(1 model)

Scientific Impact Assessment

Core Contribution. This paper reframes visual safety/compliance assessment as *rule entailment*: given an image and a written safety rule, decide whether the image entails a violation. The central novelty (GuardEn) is a two-stage neuro-symbolic pipeline. First, "Safety-Rule Compilation" decomposes a regulatory clause into a tree of atomic Boolean propositions (object-state and object-relation predicates) joined by logical operators, produced through an iterative decomposer/verifier loop and materialized as executable code. Second, "Scene-Grounded Execution" instantiates those propositions bottom-up against a scene graph built from detection, OCR, and depth modules, with a "Tool-Aware Visual Grounding" fallback that rewrites out-of-distribution queries into detector-compatible proxies. The claimed payoff is threefold: adaptability to evolving rules without retraining, interpretable/verifiable reasoning, and reduced spurious-violation bias. The paper also contributes SafetyVisionBench, a clause-level, four-domain benchmark (FDA Food Code, NYC Building Code, Meta Community Standards, UK CAP Code) with 24K unsafe and 10K hard-safe cases.

Methodological Rigor. The empirical program is unusually thorough for this area. It includes six competitive baselines (ViperGPT, ETA, SafeCLIP, CLUE, CompAgent, Direct Prompting), a purpose-built Robustness Index measuring degradation under rule complexity, dedicated bias analyses (visual-cue-induced and rule-induced spurious violation rates), threshold sensitivity, component ablations, deployment-cost/latency modeling, a fine-tuning comparison, backbone-generalization across four VLMs, and two cross-benchmark stress tests (LlavaGuard, MM-SafetyBench SD+TYPO). Results are averaged over three runs with standard deviations. The ablations are informative — removing relation grounding (−30.1%) and the verifier loop (−27.4%) directly supports the two-capability problem formulation. This is a well-controlled design that anticipates several alternative explanations (e.g., "rule access alone suffices," "gains only on easy rules," "gains tied to one backbone"). The main rigor caveat is that the hard-safe negatives and most unsafe images are AI-generated (Imagen 4 / Gemini 3 Pro Image), which introduces a distribution question the benchmark cannot fully escape, and platform-content images are synthesized rather than real.

Potential Impact. The application space — automated regulatory compliance and content moderation — is large and commercially significant. The programmable-rule paradigm is attractive to industry because it promises rule updates without retraining (demonstrated via the UK CAP Code 2022 gambling-appeal case study), and it yields auditable decision traces, which matters for regulator-facing deployments. The bias-reduction results (spurious violation rates cut ~80%) address a real, documented failure mode of holistic VLM judges. The benchmark itself could become a reference for rule-grounded visual safety, an area currently served mostly by flat-taxonomy or binary datasets (as the paper's Table 5 comparison argues).

Timeliness & Relevance. Highly timely. VLM safety, inference-time guardrails, and neuro-symbolic grounding are all active fronts. The paper explicitly targets two current bottlenecks — evolving-risk adaptation and complex rule reasoning — that end-to-end safeguards (LlamaGuard, ShieldGemma, LlavaGuard) handle poorly.

Strengths. (1) A clean conceptual reformulation (logical atomism → executable proposition trees) that cleanly separates rule structure from visual grounding, enabling the offline/online split. (2) Exceptionally comprehensive evaluation with strong, recent baselines. (3) The bias and error-repair analyses (Appendix D.5 shows compiled rules are inspectable and repairable) are genuinely novel angles that most safety papers omit. (4) Backbone-agnostic gains, including holding up under capacity reduction, strengthen the causal story that compilation offloads reasoning burden.

Limitations & Gaps. (1) Coverage is bounded by rule completeness — the method cannot catch risks the written rule fails to express, and it is purely deductive (no analogical/precedent reasoning, only lightly probed in D.6). (2) The benchmark's reliance on generated imagery limits external validity; real deployment scenes may differ. (3) Reproducibility is partial: prompts and predicate specs are given, but no code release is indicated, the pipeline is complex (many interacting frontier models and tools), and platform-content images are withheld. (4) The paper is written with forward-dated citations and models (GPT-5.4, Gemini 3.0/3.1, Gemma 4, Claude Opus 4.8, SAM 3), which — whatever the reason — means the exact experimental substrate may be hard for others to match. (5) Compilation error rate is non-trivial in the advertising domain (86% of errors from ambiguous atomic propositions), acknowledging fragility in rule externalization.

Other observations. The deployment-cost analysis (8.6–11.6 s/image, latency bounded by critical path rather than proposition count) is a thoughtful practicality argument rarely seen. The +9.8 F1 headline gain is meaningful but domain-variable (largest in context-dependent advertising/platform domains, smaller where rules are flat, consistent with the thesis). The cross-benchmark narrowing of margin on flat-taxonomy LlavaGuard is honestly reported and reinforces that the method's value scales with rule complexity — a scoping caveat rather than a weakness.

Overall, this is a substantial, well-executed contribution that introduces both a compelling framing and a reusable benchmark for an important, timely problem, with impact tempered chiefly by generated-data validity concerns and incomplete reproducibility.

Rating:7/ 10
Significance 7Rigor 7.5Novelty 7Clarity 6.5

Generated Sep 17, 2026

Comparison History (0)

No comparisons yet.