Mapping correlations and coherence: adjacency-based approach to data visualization and regularity discovery

• URL: http://arxiv.org/abs/2506.05758v1
• Date: Fri, 06 Jun 2025 05:31:16 GMT
• Title: Mapping correlations and coherence: adjacency-based approach to data visualization and regularity discovery
• Authors: Guang-Xing Li,
• Abstract summary: Correlation is a most commonly-used and effective approach to describe regularities in data.<n>We present an algorithm to derive maps representing the type and degree of correlations.<n>The method should facilitate the development of new computational approaches to regularity discovery.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The development of science has been transforming man's view towards nature for centuries. Observing structures and patterns in an effective approach to discover regularities from data is a key step toward theory-building. With increasingly complex data being obtained, revealing regularities systematically has become a challenge. Correlation is a most commonly-used and effective approach to describe regularities in data, yet for complex patterns, spatial inhomogeneity and complexity can often undermine the correlations. We present an algorithm to derive maps representing the type and degree of correlations, by taking the two-fold symmetry of the correlation vector into full account using the Stokes parameter. The method allows for a spatially resolved view of the nature and strength of correlations between physical quantities. In the correlation view, a region can often be separated into different subregions with different types of correlations. Subregions correspond to physical regimes for physical systems, or climate zones for climate maps. The simplicity of the method makes it widely applicable to a variety of data, where the correlation-based approach makes the map particularly useful in revealing regularities in physical systems and alike. As a new and efficient approach to represent data, the method should facilitate the development of new computational approaches to regularity discovery.

Related papers

• Revealing hidden correlations from complex spatial distributions: Adjacent Correlation Analysis [0.0]
  Correlations between quantities are the most reliable approach to describe relationships between different variables.<n>For complex patterns, directly searching for correlations is often impractical, as complexity and spatial inhomogeneity can obscure correlations.<n>We develop a new method, adjacent correlation analysis, to extract such correlations and represent them in phase space.
  arXiv  Detail & Related papers  (2025-06-06T05:31:29Z)
• HLSAD: Hodge Laplacian-based Simplicial Anomaly Detection [6.629765271909503]
  We propose HLSAD, a novel method for detecting anomalies in time-evolving simplicial complexes.<n>Our approach leverages the spectral properties of Hodge Laplacians of simplicial complexes to effectively model multi-way interactions among data points.
  arXiv  Detail & Related papers  (2025-05-30T12:41:08Z)
• Causal Discovery on Dependent Binary Data [6.464898093190062]
  We propose a decorrelation-based approach for causal graph learning on dependent binary data.<n>We develop an EM-like iterative algorithm to generate and decorrelate samples of the latent utility variables.<n>We demonstrate that the proposed decorrelation approach significantly improves the accuracy in causal graph learning.
  arXiv  Detail & Related papers  (2024-12-28T21:55:42Z)
• Learning Divergence Fields for Shift-Robust Graph Representations [73.11818515795761]
  In this work, we propose a geometric diffusion model with learnable divergence fields for the challenging problem with interdependent data. We derive a new learning objective through causal inference, which can guide the model to learn generalizable patterns of interdependence that are insensitive across domains.
  arXiv  Detail & Related papers  (2024-06-07T14:29:21Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• Gradient-Based Feature Learning under Structured Data [57.76552698981579]
  In the anisotropic setting, the commonly used spherical gradient dynamics may fail to recover the true direction. We show that appropriate weight normalization that is reminiscent of batch normalization can alleviate this issue. In particular, under the spiked model with a suitably large spike, the sample complexity of gradient-based training can be made independent of the information exponent.
  arXiv  Detail & Related papers  (2023-09-07T16:55:50Z)
• Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data [64.96984404868411]
  We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm. The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources. It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
  arXiv  Detail & Related papers  (2022-12-06T12:42:11Z)
• Amortized Inference for Causal Structure Learning [72.84105256353801]
  Learning causal structure poses a search problem that typically involves evaluating structures using a score or independence test. We train a variational inference model to predict the causal structure from observational/interventional data. Our models exhibit robust generalization capabilities under substantial distribution shift.
  arXiv  Detail & Related papers  (2022-05-25T17:37:08Z)
• ICON: Learning Regular Maps Through Inverse Consistency [19.27928605302463]
  We explore what induces regularity for spatial transformations, e.g., when computing image registrations. We find that deep networks combined with an inverse consistency loss and randomized off-grid yield well behaved, approximately diffeomorphic, spatial transformations. Despite the simplicity of this approach, our experiments present compelling evidence, on both synthetic and real data, that regular maps can be obtained without carefully tuned explicit regularizers and competitive registration performance.
  arXiv  Detail & Related papers  (2021-05-10T15:52:12Z)
• Out-of-distribution Generalization via Partial Feature Decorrelation [72.96261704851683]
  We present a novel Partial Feature Decorrelation Learning (PFDL) algorithm, which jointly optimize a feature decomposition network and the target image classification model. The experiments on real-world datasets demonstrate that our method can improve the backbone model's accuracy on OOD image classification datasets.
  arXiv  Detail & Related papers  (2020-07-30T05:48: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.