Sheaf-Laplacian Obstruction and Projection Hardness for Cross-Modal Compatibility on a Modality-Independent Site
Cross-modal representations vary in how easily they can be aligned, and compatibility is generally non-transitive: two modalities may align through an intermediate modality at lower complexity than through a direct map. We introduce a reference formalism that evaluates all modalities on a fixed neighborhood site and defines two directed invariants. Projection hardness \(H_{a\to b}(\varepsilon)\) is the minimum complexity within a nested Lipschitz-controlled family required to reach error \(\varepsilon\). For a declared local projection family, sheaf-Laplacian obstruction \(C_{a\to b}(\varepsilon)\) is the minimum variation of locally fitted projection parameters required to reach the same error. Under identity restrictions, obstruction is the graph Dirichlet energy of a vector-valued parameter field; the sheaf formulation identifies zero energy with successful gluing and extends to edge-dependent transports and heterogeneous parameter spaces. We relate obstruction to the site spectral gap and excess global-map error, and construct ReLU examples showing non-transitive compatibility and a quadratic separation between staged and direct width. Controlled synthetic calibrations recover the predicted hardness separation, cut-induced obstruction scaling, and sensitivity to the fixed site graph.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Multi-Agent System Identification with Nonlinear Sheaf Diffusion
Local interaction laws governing multi-agent systems can be difficult to recover from trajectory data, even when the dynamics are observed faithfully. In systems governed by a nonlinear sheaf Laplacian -- a generalizatio…
Oversmoothing as Representation Degeneracy in Neural Sheaf Diffusion
Neural Sheaf Diffusion (NSD) generalizes diffusion-based Graph Neural Networks by replacing scalar graph Laplacians with sheaf Laplacians whose learned restriction maps define a task-adapted geometry. While the diffusion…
Cohomological Obstructions to Global Counterfactuals: A Sheaf-Theoretic Foundation for Generative Causal Models
Current continuous generative models (e.g., Diffusion Models, Flow Matching) implicitly assume that locally consistent causal mechanisms naturally yield globally coherent counterfactuals. In this paper, we prove that thi…
HOLOGRAPH: Active Causal Discovery via Sheaf-Theoretic Alignment of Large Language Model Priors
Causal discovery from observational data remains fundamentally limited by identifiability constraints. Recent work has explored leveraging Large Language Models (LLMs) as sources of prior causal knowledge, but existing a…
On the Necessity of Learnable Sheaf Laplacians
Sheaf Neural Networks (SNNs) were introduced as an extension of Graph Convolutional Networks to address oversmoothing on heterophilous graphs by attaching a sheaf to the input graph and replacing the adjacency-based oper…