Sheaf-Laplacian Obstruction and Projection Hardness for Cross-Modal Compatibility on a Modality-Independent Site

• URL: http://arxiv.org/abs/2604.07632v1
• Date: Wed, 08 Apr 2026 22:20:25 GMT
• Title: Sheaf-Laplacian Obstruction and Projection Hardness for Cross-Modal Compatibility on a Modality-Independent Site
• Abstract summary: We develop a unified framework for analyzing cross-modal compatibility in learned representations.<n>For a directed modality pair $(ato b)$, we formalize two complementary incompatibility mechanisms.<n>We show, in a concrete ReLU setting, that an intermediate modality can strictly reduce effective hardness even when direct alignment remains infeasible.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a unified framework for analyzing cross-modal compatibility in learned representations. The core object is a modality-independent neighborhood site on sample indices, equipped with a cellular sheaf of finite-dimensional real inner-product spaces. For a directed modality pair $(a\to b)$, we formalize two complementary incompatibility mechanisms: projection hardness, the minimal complexity within a nested Lipschitz-controlled projection family needed for a single global map to align whitened embeddings; and sheaf-Laplacian obstruction, the minimal spatial variation required by a locally fit field of projection parameters to achieve a target alignment error. The obstruction invariant is implemented via a projection-parameter sheaf whose 0-Laplacian energy exactly matches the smoothness penalty used in sheaf-regularized regression, making the theory directly operational. This separates two distinct failure modes: hardness failure, where no low-complexity global projection exists, and obstruction failure, where local projections exist but cannot be made globally consistent over the semantic neighborhood graph without large parameter variation. We link the sheaf spectral gap to stability of global alignment, derive bounds relating obstruction energy to excess global-map error under mild Lipschitz assumptions, and give explicit constructions showing that compatibility is generally non-transitive. We further define bridging via composed projection families and show, in a concrete ReLU setting, that an intermediate modality can strictly reduce effective hardness even when direct alignment remains infeasible.

Related papers

• Wavelet Phase Diffusion for Structurally and Semantically Consistent Sim-to-Real Translation [8.622300381959768]
  Simulation-to-reality translation must bridge the appearance gap between synthetic and real domains.<n>We introduce Wavelet Phase Diffusion, which enables spatially adaptive phase injection without global spectral interference.<n>Ours outperforms prior methods in realism and semantic consistency while maintaining competitive structural alignment.
  arXiv  Detail & Related papers  (2026-07-08T13:30:26Z)
• SLAM: Structured and Localized Analytic Manifold Adaptation for Lifelong VPR [0.6882042556551609]
  We propose SLAM, a Structured and Localized Analytic Manifold adaptation framework.<n>Our framework unifies uncertainty-aware smoothing via Unscented transformation, topological space partitioning through a Gaussian Mixture Model (GMM)<n> Exhaustive ablation studies demonstrate that while the synergistic combination of uncertainty smoothing and localized mapping achieves the state-of-the-art nominal accuracy of 27.5%, the full deployment of the $H_infty$ bound does not require an architectural split.
  arXiv  Detail & Related papers  (2026-07-06T07:57:26Z)
• LAST: Bridging Vision-Language and Action Manifolds via Gromov-Wasserstein Alignment [71.3712075841632]
  LAST reconstructs the action space to establish local metric compatibility with the Vision-Language-Action modality.<n> LAST enables VLA models with superior convergence and generalizability.
  arXiv  Detail & Related papers  (2026-05-27T03:48:10Z)
• Hierarchical Consistency Learning for Test-time Adaptation in Camouflage Perception [50.278200968044665]
  Camouflaged object detection (COD) aims to localize targets that exhibit minimal perceptual differences from backgrounds through physical attributes.<n>Existing methods, constrained by the static train-then-freeze paradigm, suffer from domain rigidity and dependency annotation.<n>We propose the hierarchical consistency learning framework, which integrates test-time adaptation for dynamic representation recalibration.
  arXiv  Detail & Related papers  (2026-05-25T09:57:46Z)
• GeoFlowVLM: Geometry-Aware Joint Uncertainty for Frozen Vision-Language Embedding [3.0708725114491293]
  We propose textbfGeoFlowVLM as a post-hoc adapter that learns the joint distribution of paired $ell$-normalised dual-encoder VLM embeddings.<n>A consistency result shows that, in the population limit, the trained network exposes the joint flow and both cross-modal conditional flows.<n>We derive two quantities from this single model: a conditional retrieval entropy that quantifies aleatoric ambiguity with a decision-theoretic interpretation via a Fano-type bound, and a marginaltypicality score justified by an exact chain-rule decomposition of the joint NLL
  arXiv  Detail & Related papers  (2026-05-13T11:12:18Z)
• Keep It CALM: Toward Calibration-Free Kilometer-Level SLAM with Visual Geometry Foundation Models via an Assistant Eye [34.902300948471314]
  CAL2M is a plug-and-play framework compatible with arbitrary VGFMs.<n>It uses an "assistant eye" solely to leverage the prior of constant physical spacing.<n>It can effectively rectify rotation and translation errors caused by inaccurate intrinsics.
  arXiv  Detail & Related papers  (2026-04-16T08:58:57Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• MirrorLA: Reflecting Feature Map for Vision Linear Attention [49.41670925034762]
  Linear attention significantly reduces the computational complexity of Transformers from quadratic to linear, yet it consistently lags behind softmax-based attention in performance.<n>We propose MirrorLA, a geometric framework that substitutes passive truncation with active reorientation.<n>MirrorLA achieves state-of-the-art performance across standard benchmarks, demonstrating that strictly linear efficiency can be achieved without compromising representational fidelity.
  arXiv  Detail & Related papers  (2026-02-04T09:14:09Z)
• UAGLNet: Uncertainty-Aggregated Global-Local Fusion Network with Cooperative CNN-Transformer for Building Extraction [83.48950950780554]
  Building extraction from remote sensing images is a challenging task due to the complex structure variations of buildings.<n>Existing methods employ convolutional or self-attention blocks to capture the multi-scale features in the segmentation models.<n>We present an Uncertainty-Aggregated Global-Local Fusion Network (UAGLNet) to exploit high-quality global-local visual semantics.
  arXiv  Detail & Related papers  (2025-12-15T02:59:16Z)
• On the Collapse of Generative Paths: A Criterion and Correction for Diffusion Steering [29.633206995806542]
  In-time steering enables pretrained diffusion/flow models to be adapted to new tasks without retraining.<n>This construction harbors a critical and previously unformalized failure mode: Marginal Path Collapse.<n>We introduce Adaptive path Correction with Exponents (ACE), which extends Feynman-Kac steering to time-varying exponents.
  arXiv  Detail & Related papers  (2025-12-11T06:44:08Z)
• Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations [57.179679246370114]
  We identify the distribution of random perturbations that minimizes the estimator's variance as the perturbation stepsize tends to zero.<n>Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length.
  arXiv  Detail & Related papers  (2025-10-22T19:06:39Z)
• Fundamental limits to contrast reversal of self-fidelity correlations [0.0]
  In measurement design, it is common to engineer anti-contrast readouts.<n>We ask whether two evolutions can be made uniformly opposite over a broad input ensemble.<n>We adopt the Pearson correlation coefficient as a device-agnostic measure of global opposition between two evolutions.
  arXiv  Detail & Related papers  (2025-09-30T15:07:28Z)
• Every Subtlety Counts: Fine-grained Person Independence Micro-Action Recognition via Distributionally Robust Optimization [36.230001277076376]
  Micro-action Recognition is vital for psychological assessment and human-computer interaction.<n>Existing methods often fail in real-world scenarios because inter-person variability causes the same action to manifest differently.<n>We propose the Person Independence Universal Micro-action Recognition Framework, which integrates Distributionally Robust Optimization principles to learn person-agnostic representations.
  arXiv  Detail & Related papers  (2025-09-25T14:54:24Z)
• Cross-modal Full-mode Fine-grained Alignment for Text-to-Image Person Retrieval [54.90229711181207]
  Text-to-Image Person Retrieval (TIPR) aims to retrieve the most relevant person images based on a given text query.<n>The key challenge in TIPR lies in achieving effective alignment between textual and visual modalities.<n>We propose FMFA, a cross-modal Full-Mode Fine-grained Alignment framework.
  arXiv  Detail & Related papers  (2025-09-17T07:12:05Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)

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.