Elimination Geometry

• URL: http://arxiv.org/abs/2608.17646v2
• Date: Sun, 23 Aug 2026 08:35:27 GMT
• Title: Elimination Geometry
• Abstract summary: Monograph synthesizes tools from geometry, optimization, information theory, statistics, and machine learning into interfaces for integrability, representation admissibility, resource constraints, observational overlap, and common deployment.<n> Applications include sparse model selection, distribution-free prediction, observational treatment policies, routed expert and retrieval systems, and learned score fields.
• Score: 2.7823528791601686
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: This monograph develops elimination geometry (EG), a typed, native-loss, audit-oriented framework for studying when locally optimal objects can be realized by a shared deployment rule. Elimination and compression may erase distinctions required by prediction, inference, control, or representation. EG asks which distinctions are lost, whether the induced defect is visible to the declared task, and whether changing information, architecture, action space, or deployment domain can repair it. EG separates local solvability, global realizability, and finite-sample certifiability. It derives native defects from the original objective and distinguishes architecture obstruction from model approximation, generalization, and implementation error. The monograph synthesizes tools from geometry, optimization, information theory, statistics, and machine learning into interfaces for integrability, representation admissibility, resource constraints, observational overlap, and common deployment. Formal results address regular, coordination, singular, compositional, and resource-limited mechanisms with explicit antecedents and claim boundaries. Applications include sparse model selection, distribution-free prediction, observational treatment policies, routed expert and retrieval systems, and learned score fields. Obstruction-Aware Learning and Inference links structural diagnosis to finite-data authorization, mechanism-matched intervention, and independent validation. Reproducible synthetic and real-data studies illustrate how certificates can guide architecture repair while recording failed gates and unresolved cases. The framework requires the deployment contract, native endpoint, competing explanations, information and compute budgets, and validation rule to be fixed before a persistent performance floor is attributed to architecture.

Related papers

• Building Trustworthy Graph-Agentic RAG for Social Good: Architectures, Failure Propagation, and Assurance by Construction [0.0]
  Graph-agentic retrieval-augmented generation combines structured evidence with adaptive controllers that can plan retrieval, traverse relations, verify intermediate claims, delegate subtasks, and use tools.<n>We examine how such systems should be designed and evaluated for social-good settings in which freshness, authorization, traceability, oversight, and recourse matter alongside answer quality.
  arXiv  Detail & Related papers  (2026-09-06T05:04:06Z)
• SEAM: Global consistency beyond local accuracy in scientific machine learning [3.1861308132183375]
  We introduce Scientific Explanation-Admissibility Machines (SEAM), a generator-agnostic framework that makes local-to-global consistency question computable across regions, sensors, regimes, and model components.<n>SEAM detects incompatible explanations even when local predictions are accurate, and attributes failures to specific channels and overlaps.<n>It adds a global explanation-consistency audit to existing solvers and learning models, testing whether their local explanations form a coherent scientific account.
  arXiv  Detail & Related papers  (2026-08-06T07:45:23Z)
• Modular Diffusion Models for Structured Visual Recognition [52.38687800325397]
  We present Modular Diffusion Models (MDMs), a simple and novel framework that learns a distribution over structured outputs for a given input image.<n>MDMs decompose the diffusion process into distinct, task-specific modules, each focused on capturing a different aspect of the structured information space.<n>This modular design allows each component to be learned independently, with seamless integration at inference without additional training.
  arXiv  Detail & Related papers  (2026-06-21T22:38:35Z)
• Enabling Scalable Topology Inference in Distribution Systems via Constrained Multi-Source Inference [10.602779718858965]
  Distribution system topology is essential for outage localization, voltage analytics, and operation of distribution grids.<n>Existing topology identification methods rely primarily on electrical similarity or spatial records alone.<n>This paper formulates distribution topology identification as a constrained inference problem that refines a utility-provided base topology.
  arXiv  Detail & Related papers  (2026-05-30T06:00:34Z)
• Hylos: Operability Contracts for Model-Native Spatial Intelligence [0.0]
  This paper introduces Hylos, a systems architecture for contract-bounded spatial intelligence.<n>Hylos maintains scene-scale operability state over objects, assemblies, assets, surface anchors, assertions, action candidates, solver jobs, shared actuator invocations, capability gaps, and effect diffs.<n>The study examines causal repair: a visible misalignment appears on a dependent component, while the supported repair lies upstream in the placement structure that controls it.
  arXiv  Detail & Related papers  (2026-05-23T20:47:05Z)
• VerifyMAS: Hypothesis Verification for Failure Attribution in LLM Multi-Agent Systems [79.51005192758262]
  Large language model-driven multi-agent systems excel at complex tasks.<n>However, unreliable agents remain a key bottleneck to system-level reliability.<n>We propose a hypothesis verification framework for agent failure attribution.
  arXiv  Detail & Related papers  (2026-05-17T14:09:35Z)
• Architecture-Aware Explanation Auditing for Industrial Visual Inspection [1.3054033103300278]
  This paper operationalizes an architecture-aware explanation audit protocol grounded in the native-readout hypothesis.<n>On WM-811K wafer maps (9 classes, 172k images) under a three-seed zero-fill perturbation protocol, ViT-Tiny + Attention Rollout attains Deletion AUC 0.211 against 0.432-0.525 for Swin-Tiny.
  arXiv  Detail & Related papers  (2026-05-14T01:48:00Z)
• Short Version of VERIFAI2026 Paper -- Learning Infused Formal Reasoning: Contract Synthesis, Artefact Reuse and Semantic Foundations [0.0]
  This paper outlines a research vision called Learning-Infused Formal Reasoning (LIFR), which integrates machine learning techniques with formal verification.<n>The framework focuses on three complementary research directions: automated contract synthesis from natural language requirements, semantic reuse of verification artifacts using graph matching and learning-based embeddings, and mathematically grounded semantic foundations based on the Unifying Theories of Programming (UTP) and the Theory of Institutions.
  arXiv  Detail & Related papers  (2026-04-14T13:58:14Z)
• Adapting, Fast and Slow: Transportable Circuits for Few-Shot Learning [54.930879235929204]
  Generalization across the domains is not possible without asserting a structure that constrains the unseen target domain w.r.t.<n>We design an algorithm for zero-shot compositional generalization which relies on access to qualitative domain knowledge.<n>Our theoretical results characterize classes of few-shot learnable tasks in terms of graphical circuit transportability criteria.
  arXiv  Detail & Related papers  (2025-12-28T04:38:43Z)
• Partial Transportability for Domain Generalization [56.37032680901525]
  Building on the theory of partial identification and transportability, this paper introduces new results for bounding the value of a functional of the target distribution.<n>Our contribution is to provide the first general estimation technique for transportability problems.<n>We propose a gradient-based optimization scheme for making scalable inferences in practice.
  arXiv  Detail & Related papers  (2025-03-30T22:06:37Z)
• Identifiable Exchangeable Mechanisms for Causal Structure and Representation Learning [54.69189620971405]
  We provide a unified framework, termed Identifiable Exchangeable Mechanisms (IEM), for representation and structure learning.<n>IEM provides new insights that let us relax the necessary conditions for causal structure identification in exchangeable non-i.i.d. data.<n>We also demonstrate the existence of a duality condition in identifiable representation learning, leading to new identifiability results.
  arXiv  Detail & Related papers  (2024-06-20T13:30:25Z)
• Relation Matters: Foreground-aware Graph-based Relational Reasoning for Domain Adaptive Object Detection [81.07378219410182]
  We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR) FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations. Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
  arXiv  Detail & Related papers  (2022-06-06T05:12:48Z)

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.