Stationary Processes, Wiener-Granger Causality, and Matrix Spectral Factorization

• URL: http://arxiv.org/abs/2412.18901v1
• Date: Wed, 25 Dec 2024 13:29:39 GMT
• Title: Stationary Processes, Wiener-Granger Causality, and Matrix Spectral Factorization
• Abstract summary: We provide a detailed overview of Granger causality, trace its historical development, and explore how recent computational advancements can enhance its application in various fields.<n>We discuss potential future directions for the method, particularly in the context of largescale data analysis.
• Score: 0.3626013617212666
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Granger causality has become an indispensable tool for analyzing causal relationships between time series. In this paper, we provide a detailed overview of its mathematical foundations, trace its historical development, and explore how recent computational advancements can enhance its application in various fields. We will not hesitate to present the proofs in full if they are simple and transparent. For more complex theorems on which we rely, we will provide supporting citations. We also discuss potential future directions for the method, particularly in the context of largescale data analysis.

Related papers

• On Multi-Step Theorem Prediction via Non-Parametric Structural Priors [50.16583672681106]
  In this work, we explore training-free theorem prediction through the lens of in-context learning (ICL)<n>We propose Theorem Precedence Graphs, which encode temporal dependencies from historical solution traces as directed graphs, and impose explicit topological constraints that effectively prune the search space during inference.<n>Experiments on the FormalGeo7k benchmark show that our method achieves 89.29% accuracy, substantially outperforming ICL baselines and matching state-of-the-art supervised models.
  arXiv  Detail & Related papers  (2026-03-05T06:08:50Z)
• Large-Scale Multidimensional Knowledge Profiling of Scientific Literature [46.15403461273178]
  We compile a unified corpus of more than 100,000 papers from 22 major conferences between 2020 and 2025.<n>Our analysis highlights several notable shifts, including the growth of safety, multimodal reasoning, and agent-oriented studies.<n>These findings provide an evidence-based view of how AI research is evolving and offer a resource for understanding broader trends and identifying emerging directions.
  arXiv  Detail & Related papers  (2026-01-21T16:47:05Z)
• Measuring and Analyzing Intelligence via Contextual Uncertainty in Large Language Models using Information-Theoretic Metrics [0.0]
  We introduce a novel, task-agnostic approach to probe dynamics by creating a quantitative Cognitive Profile" for any given model.<n>Applying this methodology to several state-of-the-art LLMs across diverse texts, we uncover unique and consistent cognitive profiles that are sensitive to both model scale and text complexity.
  arXiv  Detail & Related papers  (2025-07-21T20:14:25Z)
• Cross-Modal State-Space Graph Reasoning for Structured Summarization [1.7766350477173578]
  Cross-modal summarization is critical for numerous applications, ranging from video analytics to medical reports. We propose a textitCross-Modal State-Space Graph Reasoning (textbfCSS-GR) framework that incorporates a state-space model with graph-based message passing. We demonstrate that our approach significantly improves summarization quality and interpretability while maintaining computational efficiency, as validated on standard multimodal summarization benchmarks.
  arXiv  Detail & Related papers  (2025-03-26T21:06:56Z)
• Relational Learning in Pre-Trained Models: A Theory from Hypergraph Recovery Perspective [60.64922606733441]
  We introduce a mathematical model that formalizes relational learning as hypergraph recovery to study pre-training of Foundation Models (FMs) In our framework, the world is represented as a hypergraph, with data abstracted as random samples from hyperedges. We theoretically examine the feasibility of a Pre-Trained Model (PTM) to recover this hypergraph and analyze the data efficiency in a minimax near-optimal style.
  arXiv  Detail & Related papers  (2024-06-17T06:20:39Z)
• A Survey on Deep Learning for Theorem Proving [16.28502772608166]
  Theorem proving is a fundamental aspect of mathematics, spanning from informal reasoning in natural language to rigorous derivations in formal systems. Deep learning, especially the emergence of large language models, has sparked a notable surge of research exploring these techniques to enhance the process of theorem proving.
  arXiv  Detail & Related papers  (2024-04-15T17:07:55Z)
• Beyond DAGs: A Latent Partial Causal Model for Multimodal Learning [80.44084021062105]
  We propose a novel latent partial causal model for multimodal data, featuring two latent coupled variables, connected by an undirected edge, to represent the transfer of knowledge across modalities.<n>Under specific statistical assumptions, we establish an identifiability result, demonstrating that representations learned by multimodal contrastive learning correspond to the latent coupled variables up to a trivial transformation.<n>Experiments on a pre-trained CLIP model embodies disentangled representations, enabling few-shot learning and improving domain generalization across diverse real-world datasets.
  arXiv  Detail & Related papers  (2024-02-09T07:18:06Z)
• Position: What Can Large Language Models Tell Us about Time Series Analysis [69.70906014827547]
  We argue that current large language models (LLMs) have the potential to revolutionize time series analysis. Such advancement could unlock a wide range of possibilities, including time series modality switching and question answering.
  arXiv  Detail & Related papers  (2024-02-05T04:17:49Z)
• Fine-Grained Zero-Shot Learning: Advances, Challenges, and Prospects [84.36935309169567]
  We present a broad review of recent advances for fine-grained analysis in zero-shot learning (ZSL) We first provide a taxonomy of existing methods and techniques with a thorough analysis of each category. Then, we summarize the benchmark, covering publicly available datasets, models, implementations, and some more details as a library.
  arXiv  Detail & Related papers  (2024-01-31T11:51:24Z)
• Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds [77.4346324549323]
  We show that a step size agnostic to the curvature of the manifold achieves a curvature-independent and linear last-iterate convergence rate. To the best of our knowledge, the possibility of curvature-independent rates and/or last-iterate convergence has not been considered before.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• Machine Learning and the Future of Bayesian Computation [15.863162558281614]
  We discuss the potential to improve posterior computation using ideas from machine learning. Concrete future directions are explored in vignettes on normalizing flows, Bayesian coresets, distributed Bayesian inference, and variational inference.
  arXiv  Detail & Related papers  (2023-04-21T21:03:01Z)
• Generalization Bounds with Data-dependent Fractal Dimensions [5.833272638548154]
  We prove fractal geometry-based generalization bounds without requiring any Lipschitz assumption. Despite introducing a significant amount of technical complications, this new notion lets us control the generalization error.
  arXiv  Detail & Related papers  (2023-02-06T13:24:48Z)
• An Empirical Study: Extensive Deep Temporal Point Process [61.14164208094238]
  We first review recent research emphasis and difficulties in modeling asynchronous event sequences with deep temporal point process. We propose a Granger causality discovery framework for exploiting the relations among multi-types of events.
  arXiv  Detail & Related papers  (2021-10-19T10:15:00Z)
• Bayesian Quadrature on Riemannian Data Manifolds [79.71142807798284]
  A principled way to model nonlinear geometric structure inherent in data is provided. However, these operations are typically computationally demanding. In particular, we focus on Bayesian quadrature (BQ) to numerically compute integrals over normal laws. We show that by leveraging both prior knowledge and an active exploration scheme, BQ significantly reduces the number of required evaluations.
  arXiv  Detail & Related papers  (2021-02-12T17:38:04Z)
• A New Perspective on Learning Context-Specific Independence [18.273290530700567]
  Local structure such as context-specific independence (CSI) has received much attention in the probabilistic graphical model (PGM) literature. In this paper, we provide a new perspective on how to learn CSIs from data.
  arXiv  Detail & Related papers  (2020-06-12T01:11:02Z)
• On Geometry of Information Flow for Causal Inference [0.0]
  This paper takes the perspective of information flow, which includes the Nobel prize winning work on Granger-causality. Our main contribution will be to develop analysis tools that will allow a geometric interpretation of information flow as a causal inference indicated by transfer entropy.
  arXiv  Detail & Related papers  (2020-02-06T02:46: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.