Departure from Regularity: Degree Heterogeneity and Eigengap as the Structural Drivers of ASE-LSE Latent Subspace Disagreement

• URL: http://arxiv.org/abs/2605.22346v1
• Date: Thu, 21 May 2026 11:30:37 GMT
• Title: Departure from Regularity: Degree Heterogeneity and Eigengap as the Structural Drivers of ASE-LSE Latent Subspace Disagreement
• Abstract summary: Two methods for analysing graph data, Adjacency Spectral Embedding and Laplacian Spectral Embedding, often produce different results when applied to the same network.<n>We show that regularity is a sufficient condition for perfect agreement.<n>We prove an explicit bound whose two terms suggest the structural ingredients controlling it: degree heterogeneity, which pushes the methods apart, and community structure strength, which pulls them back together.
• Score: 2.2201528765499416
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Two of the most widely used methods for analysing graph data, Adjacency Spectral Embedding and Laplacian Spectral Embedding, often produce different results when applied to the same network. Yet the structural reasons behind this disagreement remain incompletely understood. This paper provides a structural account. We show that regularity is a sufficient condition for perfect agreement: when every node has the same number of connections, the two methods produce identical latent subspaces. Any departure from this regularity introduces disagreement, and we prove an explicit bound whose two terms suggest the structural ingredients controlling it: degree heterogeneity, which pushes the methods apart, and community structure strength, which pulls them back together. We validate both drivers empirically across thousands of simulated networks, confirming that heterogeneity drives disagreement up, community strength suppresses it, and their ratio provides a strong predictor of when the two embeddings can be treated as interchangeable and when they cannot.

Related papers

• The Trade-off Between Covariate Dependence and Latent Structure in Representation Learning [0.0]
  Disentangled representation learning seeks latent representations whose indicidual dimensions each align with a distinct covariate.<n>We introduce a unified, supervised framework that couples latent dimension-covariate dependence with constraints on the latent structure.<n>We show that both post-hoc alignment and iFA enable controllability of structured latent representations.
  arXiv  Detail & Related papers  (2026-08-17T08:20:40Z)
• Measuring What Persists: Conditioning Mechanisms and a Geometric Framework for AI Agent Identity [0.0]
  AI agents in long-context applications drift from their specified identity.<n>Current methods detect this only after qualitative degradation is visible.<n>We present a geometric framework for measuring identity structure using $sqrtmathrmJSD$ metric spaces.
  arXiv  Detail & Related papers  (2026-06-20T02:38:43Z)
• What Accuracy and Gradient Cosine Miss: Evaluating Feedback Alignment via Scale Stability, Reference Validity, and Depth Utility [48.10132234701036]
  We propose a diagnostic evaluation protocol based on three checks -- scale stability, reference validity, and depth utility -- together with per-layer rather than aggregate cosine reporting.<n>Across multiple architectures and methods, our protocol identifies all failures with wide calibration margins.
  arXiv  Detail & Related papers  (2026-06-19T06:04:17Z)
• 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)
• Dual-Stance Evaluation of Sycophancy: The Structure of Agreement and the Limits of Intervention [0.0]
  We introduce dual-stance evaluation, which tests both stances of each topic, and apply it to centroid-difference steering on Llama-3-8B-Instruct.<n>We find a dissociation: the model represents sycophantic and factual agreement in geometrically distinct subspaces, yet the steering direction projects equally onto both and cannot differentially target either.
  arXiv  Detail & Related papers  (2026-04-22T13:49:34Z)
• On the Structural Non-Preservation of Epistemic Behaviour under Policy Transformation [51.56484100374058]
  We formalise such information-conditioned interaction patterns as behavioural dependency.<n>This induces a probe-relative notion of $$-behavioural equivalence and a within-policy behavioural distance.<n>Results identify structural conditions under which probe-conditioned behavioural separation is not preserved under common policy transformations.
  arXiv  Detail & Related papers  (2026-02-24T22:55:21Z)
• Cross-Modal Redundancy and the Geometry of Vision-Language Embeddings [11.831077025246664]
  Vision-language models (VLMs) align images and text with remarkable success, yet the geometry of their shared embedding space remains poorly understood.<n>We operationalize the Iso-Energy Assumption, which exploits cross-modal redundancy, with an Aligned Sparse Autoencoder (SAE)<n>We find that this inductive bias changes the SAE solution without harming reconstruction, giving us a representation that serves as a tool for geometric analysis.
  arXiv  Detail & Related papers  (2026-02-05T21:56:26Z)
• Identification of Causal Direction under an Arbitrary Number of Latent Confounders [54.76982125821112]
  In real-world scenarios, observed variables may be affected by multiple latent variables simultaneously.<n>We make use of the joint higher-order cumulant matrix of the observed variables constructed in a specific way.<n>We show that, surprisingly, causal asymmetry between two observed variables can be directly seen from the rank deficiency properties of such higher-order cumulant matrices.
  arXiv  Detail & Related papers  (2025-10-26T15:10:00Z)
• 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)
• Certified Pruning from Counterfactual Consistency: Exact Certificates and Structured SAT Families [0.0]
  We formalize epsilon-counterfactual instrumentation and epsilon-stability, capturing noisy but testable constraints in laboratory contextuality experiments.<n>We extend these constraints to networks of contexts, yielding contextuality-type inequalities that apply globally across a CNF-SAT instance.<n>We implement a propagate-and-prune solver in which every learned clause is certified by a dual Farkas certificate verified in exact arithmetic.
  arXiv  Detail & Related papers  (2025-09-04T21:13:31Z)
• A Signed Graph Approach to Understanding and Mitigating Oversmoothing in GNNs [54.62268052283014]
  We present a unified theoretical perspective based on the framework of signed graphs.<n>We show that many existing strategies implicitly introduce negative edges that alter message-passing to resist oversmoothing.<n>We propose Structural Balanced Propagation (SBP), a plug-and-play method that assigns signed edges based on either labels or feature similarity.
  arXiv  Detail & Related papers  (2025-02-17T03:25:36Z)
• Understanding and Constructing Latent Modality Structures in Multi-modal Representation Learning [53.68371566336254]
  We argue that the key to better performance lies in meaningful latent modality structures instead of perfect modality alignment. Specifically, we design 1) a deep feature separation loss for intra-modality regularization; 2) a Brownian-bridge loss for inter-modality regularization; and 3) a geometric consistency loss for both intra- and inter-modality regularization.
  arXiv  Detail & Related papers  (2023-03-10T14:38:49Z)
• The Sample Complexity of One-Hidden-Layer Neural Networks [57.6421258363243]
  We study a class of scalar-valued one-hidden-layer networks, and inputs bounded in Euclidean norm. We prove that controlling the spectral norm of the hidden layer weight matrix is insufficient to get uniform convergence guarantees. We analyze two important settings where a mere spectral norm control turns out to be sufficient.
  arXiv  Detail & Related papers  (2022-02-13T07:12:02Z)
• 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)

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.