Rethinking Chronological Causal Discovery with Signal Processing

arXiv:2602.19903 · eess.SP, cs.LG, stat.ML · Submitted 2026-02-23 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.

Rosa: We're looking at the paper: "Rethinking Chronological Causal Discovery with Signal Processing".

Dev: Here's the gist of the paper. Causal discovery problems use a set of observations to deduce causality between variables in the real world, typically to answer questions about biological or physical systems In this paper, we examine the sensitivity of causal discovery methods to this potential mismatch We demonstrate that both classical and recent causal discovery methods exhibit sensitivity to these hyperparameters, and we discuss how ideas from signal processing may help us understand these phenomena Causal information is important because it allows us to reason about the world and the effects of how we interact with the world One such task is causal discovery, a detection-theoretic task in which one attempts to perform graph topology inference of a causal system In this work, our particular interest is in the chronological causal discovery (CCD) task, where the goal is to detect causal influences between signals or time series The gold standard for modelling how natural systems evolve in time, and by extension their causal relationships, is differential equations Many recent works in the causal machine learning (causal ML) literature have focused on discrete-time models, without questioning how faithful these models are to the underlying continuous-time dynamics If we consider the CCD task to be a problem of understanding the generative process behind a data set, then the mismatch between discrete and continuous becomes clearly important Review of Causal Discovery Methods The paper reviews several approaches to the chronological causal discovery task, categorized by their output graph structure 1) Granger Causality (GC) and Transfer Entropy (TE): GC is potentially the oldest approach to detecting causal influences TE formulates detection using information theory instead of predictive performance, measuring directed information flow 2) Constraint-based methods: These are based on conditional independence (CI) tests to recover a graph skeleton 3) Functional-based methods: These approaches assume stronger assumptions pertaining to the functional form of the data generating process, leading to identifiability guarantees 4) Gradient-based methods: NOTEARS casts the (acyclic) graph learning task into the continuous space, enabling the use of conventional optimizers 5) Cross Mapping: These methods assume that observed time series were generated by a latent deterministic dynamical systems Temporal Robustness and Hyperparameter Sensitivity One challenge of causal reasoning with statistical models is that there is an important distinction between the true data generative process (DGP) and our model of that process 1) A case study from neuroscience showed that for small values of Q, only a weak causal influence could be detected 2) Effects of sampling rate: subsampling in excess (↓ fS) makes the performance of causal methods deteriorate 3) Parameter selection: preferences for how to select Q are often method dependent, and extreme choices of Q may not yield good results Empirical Benchmarking Results The paper examines empirical evidence that proper selection of τ and Q matters for the CCD task 1) GC - Varying Q and k: based on GC show that causality cannot reliably be detected when Q < 50 TE was only able to detect causation when Q was matched to the propagation delay of the underlying causal signal 2) Benchmarking ML CCD: From both cases it is clear that varying hyperparameters Q and k has a large impact on the inferred causalities The right values for Q and k that lead to the right graph (dark red) also depend on used CCD algorithm Our observations point to challenges that CCD methods face when applied to real data The signal processing community has clear opportunities to contribute to the overcoming these challenges and developing better CCD methods There remains a question about whether a good notion of a causal Nyquist rate can be defined Acknowledgements We thank several individuals for useful discussions: Emily Stephen, Urbashi Mitra, Michael Camilleri, and Petar Djuric References

1: B.

Rosa: Scholkopf, F.

Dev: Locatello, S.

Rosa: Bauer, N.

Title and authors: Rosa: We just talked about how this paper, "Rethinking Chronological Causal Discovery with Signal Processing," investigates the sensitivity of causal discovery methods to timing mismatches in observations and the impact of sampling rate and window length.

Dev: Exactly, and they point out that we need to look at ideas from signal processing to build more robust ways to handle these discrepancies when we’re trying to find causality in time series.

Taro: It seems like a big deal because it suggests that just using standard methods might not be enough when the data collection isn't perfectly synchronized with the underlying process.

Rosa: They review several approaches, from things like Granger Causality and Transfer Entropy to constraint-based and functional-based methods, showing how each one reacts differently to these timing issues.

Dev: That’s important because it highlights a gap between modeling the data and truly understanding the underlying dynamics of a real system over time.

Taro: So, what they are suggesting is that we need to think more about signal processing concepts to bridge that gap in causal reasoning for time series.

The paper's summary: Rosa: The paper summarizes the findings by looking at specific examples, like a case study from neuroscience where only weak causal influences can be detected when the parameter Q is small.

Dev: They also point out that subsampling in excess, which is when you take too many samples or the sampling rate is too low, tends to make the performance of these causal methods deteriorate significantly.

Taro: One of their specific findings is that for Granger Causality, they found causality just couldn't be reliably detected when Q was less than fifty and Transfer Entropy only detected causation when Q matched the propagation delay of the signal.

Rosa: So, it’s not just a general sensitivity; it’s showing concrete numbers about how much performance drops based on those specific values for Q and k in different methods.

Dev: And they also showed that benchmarking causal machine learning for chronological discovery confirms that varying Q and k has a large impact on the inferred causalities, and even the right settings depend on the algorithm used.

Taro: That tells us that just picking a method isn't enough; you have to consider how well your chosen parameters align with the actual dynamics of what you are measuring.

The paper's improvements: Rosa: The paper suggests several ways to improve these methods, focusing on incorporating signal processing concepts to handle the mismatch between discrete and continuous data.

Dev: They suggest using concepts from signal processing to help us understand these phenomena better, which is a big idea because it moves beyond just tweaking parameters.

Taro: One improvement they propose is defining what they call a causal Nyquist rate, which would give us a proper way to define the lower bound on sampling rates needed for correct causal inference.

Rosa: That’s interesting because it means we could potentially use the spectral properties of the hypothesized causal mechanism to automatically select optimal sampling rates.

Dev: They also discuss how parameter selection methods, like choosing Q, can be improved by integrating information criteria such as Akaike or Bayesian criteria more deeply into the algorithm's decision-making process.

Taro: And they look at hybrid approaches, combining constraint-based methods with gradient-based techniques to get the best of both worlds—structural constraints and continuous optimization like DYNOTEARS.

Conclusion: Rosa: So, to wrap up, the paper on "Rethinking Chronological Causal Discovery with Signal Processing" really points out that when you apply these methods to real data, you run into challenges because of the mismatch between our model and the true data generating process.

Dev: They show that both classical and recent causal discovery methods are sensitive to things like sampling rate and window length, proving that we have some serious limitations when we don't account for those aspects.

Taro: The main implication is that the signal processing community has clear opportunities to contribute by developing better chronological causal discovery methods, especially by defining a good notion of a causal Nyquist rate.

Rosa: It suggests there’s a way forward where AI systems can perform more robust causal inference when data acquisition times don't perfectly match the underlying physical events.

Dev: We need to keep pushing on these ideas as we try to build systems that can reason about the world with more accuracy in dynamic situations, which sets us up for what comes next.

Kurt Butler, Damian Machlanski, Panagiotis Dimitrakopoulos, Sotirios A. Tsaftaris

School of Engineering, The University of Edinburgh

eess.SP, cs.LG, stat.ML

Submitted: 2026-02-23

Updated: 2026-02-23

Comments: 5 pages, 5 figures, Final version accepted to the 59th Asilomar Conference on Signals, Systems, and Computers (2025)

Journal ref: 2025 59th Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, 2025, pp. 940-944

DOI: 10.1109/IEEECONF67917.2025.11443432

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 86/100

The gist: Causal discovery problems use a set of observations to deduce causality between variables in the real world, typically to answer questions about biological or physical systems In this paper…

Key concepts

Chronological Causal Discovery (CCD)
This task aims to find causal influences between different signals or time series by analyzing their chronological order. It is particularly important because it seeks to understand the generative process behind a dataset over time, often modeled using differential equations.
Signal Processing Concepts
Applying ideas from signal processing helps make causal discovery methods more robust against real-world data issues like subsampling (reduced sampling rate) and window length mismatches. This allows AI systems to better handle discrepancies between the observed data and the true continuous-time dynamics.
Nyquist Rate
This concept relates to signal processing and suggests a theoretical lower bound on the sampling rate needed to perfectly reconstruct a signal from its measurements. The paper explores whether a good notion of this causal Nyquist rate can be defined for causal inference.

Terminology

Summary

Causal discovery problems use a set of observations to deduce causality between variables in the real world, typically to answer questions about biological or physical systems In this paper, we examine the sensitivity of causal discovery methods to this potential mismatch We demonstrate that both classical and recent causal discovery methods exhibit sensitivity to these hyperparameters, and we discuss how ideas from signal processing may help us understand these phenomena

Introduction to Causal Discovery Tasks

Causal information is important because it allows us to reason about the world and the effects of how we interact with the world One such task is causal discovery, a detection-theoretic task in which one attempts to perform graph topology inference of a causal system In this work, our particular interest is in the chronological causal discovery (CCD) task, where the goal is to detect causal influences between signals or time series The gold standard for modelling how natural systems evolve in time, and by extension their causal relationships, is differential equations Many recent works in the causal machine learning (causal ML) literature have focused on discrete-time models, without questioning how faithful these models are to the underlying continuous-time dynamics If we consider the CCD task to be a problem of understanding the generative process behind a data set, then the mismatch between discrete and continuous becomes clearly important

Review of Causal Discovery Methods

The paper reviews several approaches to the chronological causal discovery task, categorized by their output graph structure 1) Granger Causality (GC) and Transfer Entropy (TE): GC is potentially the oldest approach to detecting causal influences TE formulates detection using information theory instead of predictive performance, measuring directed information flow 2) Constraint-based methods: These are based on conditional independence (CI) tests to recover a graph skeleton 3) Functional-based methods: These approaches assume stronger assumptions pertaining to the functional form of the data generating process, leading to identifiability guarantees 4) Gradient-based methods: NOTEARS casts the (acyclic) graph learning task into the continuous space, enabling the use of conventional optimizers 5) Cross Mapping: These methods assume that observed time series were generated by a latent deterministic dynamical systems

Temporal Robustness and Hyperparameter Sensitivity

One challenge of causal reasoning with statistical models is that there is an important distinction between the true data generative process (DGP) and our model of that process 1) A case study from neuroscience showed that for small values of Q, only a weak causal influence could be detected 2) Effects of sampling rate: subsampling in excess (↓ fS) makes the performance of causal methods deteriorate 3) Parameter selection: preferences for how to select Q are often method dependent, and extreme choices of Q may not yield good results

Empirical Benchmarking Results

The paper examines empirical evidence that proper selection of τ and Q matters for the CCD task 1) GC - Varying Q and k: based on GC show that causality cannot reliably be detected when Q < 50 TE was only able to detect causation when Q was matched to the propagation delay of the underlying causal signal 2) Benchmarking ML CCD: From both cases it is clear that varying hyperparameters Q and k has a large impact on the inferred causalities The right values for Q and k that lead to the right graph (dark red) also depend on used CCD algorithm

Conclusion and Future Directions

Our observations point to challenges that CCD methods face when applied to real data The signal processing community has clear opportunities to contribute to the overcoming these challenges and developing better CCD methods There remains a question about whether a good notion of a causal Nyquist rate can be defined

Acknowledgements

We thank several individuals for useful discussions: Emily Stephen, Urbashi Mitra, Michael Camilleri, and Petar Djuric

References

[1] B. Scholkopf, F. p. 4

Where the paper says it

´ REFERENCES [1] B. Scholkopf, F.

Locatello, S. p. 4
Where the paper says it

Scholkopf, F. Locatello, S.

Bauer, N. R. Ke, N. Kalchbrenner, ¨ A. p. 4
Where the paper says it

Locatello, S. Kalchbrenner, ¨ A.

Goyal, and Y Bengio, “Toward causal representation learning,” Proceedings of the IEEE, vol 109 no 5 pp 612–634 2021

[2] J. Pearl, Causality. p. 4

Where the paper says it

612–634, 2021. Pearl, Causality.

Cambridge University Press, 2009

[3] S Beckers, F Eberhardt, and J Y Halpern, “Approximate causal abstractions,” in Uncertainty in Artificial Intelligence, pp 606–615 PMLR 2020

[4] C W Granger, “Investigating causal relations by econometric models and cross-spectral methods,” Econometrica: Journal of the Econometric Society, pp 424–438 1969

[5] A Shojaie and E B Fox, “Granger causality: A review and recent advances,” Annual Review of Statistics and Its Application, vol 9 no 1 pp 289–319 2022

[6] J Peters, D Janzing, and B Scholkopf, ¨ Elements of Causal Inference: Foundations and Learning Algorithms. The MIT Press, 2017

[7] S Beckers, “Causal sufficiency and actual causation,” Journal of Philosophical Logic, vol 50 no 6 pp 1341–1374 2021

[8] T Schreiber, “Measuring information transfer,” Physical Review Letters, vol 85 no 2 p 461 2000

[9] R Vicente, M Wibral, M Lindner, and G Pipa, “Transfer entropy—a model-free measure of effective connectivity for the neurosciences,” Journal of Computational Neuroscience, vol 30 no 1 pp 45–67 2011

[10] L Barnett, A B Barrett, and A K Seth, “Granger causality and transfer entropy are equivalent for Gaussian variables,” Physical Review Letters, vol 103 no 23 p 238701 2009

[11] P Spirtes, C N Glymour, and R Scheines, Causation, prediction, and search. MIT Press, 2000

[12] J Runge, P Nowack, M Kretschmer, S Flaxman, and D Sejdinovic, “Detecting and quantifying causal associations in large nonlinear time series datasets,” Science Advances, vol 5 no 11 p eaau4996 2019

[13] J Runge, “Discovering contemporaneous and lagged causal relations in autocorrelated nonlinear time series datasets,” in Conference on uncertainty in artificial intelligence, pp 1388–1397 PMLR 2020

[14] S Shimizu, P O Hoyer, A Hyvarinen, A Kerminen, and M Jordan, “A linear non-gaussian acyclic model for causal discovery.,” Journal of Machine Learning Research, vol 7 no 10 2006

[15] A Hyvarinen, K Zhang, S Shimizu, and P O Hoyer, “Estimation of a structural vector autoregression model using non-gaussianity.,” Journal of Machine Learning Research, vol 11 no 5 2010

[16] P Hoyer, D Janzing, J M Mooij, J Peters, and B Scholkopf, ¨ Nonlinear causal discovery with additive noise models,” Advances in Neural Information Processing Systems, vol 21 2008

[17] J Peters, D Janzing, and B Scholkopf, “Causal inference on time ¨ series using restricted structural equation models,” Advances in Neural Information Processing Systems, vol 26 2013

[18] X Zheng, B Aragam, P K Ravikumar, and E P Xing, “DAGs with no tears: Continuous optimization for structure learning,” Advances in Neural Information Processing Systems, vol 31 2018

[19] R Pamfil, N Sriwattanaworachai, S Desai, P Pilgerstorfer, K Georgatzis, P Beaumont, and B Aragam, “Dynotears: Structure learning from time-series data,” in International Conference on Artificial Intelligence and Statistics, pp 1595–1605 PMLR 2020

[20] G Sugihara, R May, H Ye, C-h Hsieh, E Deyle, M Fogarty, and S Munch, “Detecting causality in complex ecosystems,” Science vol 338 no 6106 pp 496–500 2012

[21] T Sauer, J A Yorke, and M Casdagli, “Embedology,” Journal of Statistical Physics, vol 65 no 3 pp 579–616 1991

[22] Z Benko˝ A Zlatniczki, M Stippinger, D Fab ´ o, A S ólyom, L Er óss, ˝ A Telcs, and Z Somogyvari, “Bayesian inference of causal relations between dynamical systems,” Chaos Solitons & Fractals vol 185 p 115142 2024

[23] K Butler, D Waxman, and P Djuric, “Tangent space causal inference: Leveraging vector fields for causal discovery in dynamical systems,” Advances in Neural Information Processing Systems, vol 37 pp 120078–120102 2024

[24] K Butler, G Feng, and P M Djuric, “On causal discovery with convergent cross mapping,” IEEE Transactions on Signal Processing, vol 71 pp 2595–2607 2023

[25] K Butler, D Cleveland, C B Mikell, S Mofakham, Y B Saalmann, and P M Djuric, “An approach to learning the hierarchical organization of the frontal lobe,” in 2023 31st European Signal Processing Conference (EUSIPCO), pp 1410–1414 IEEE 2023

[26] J Munoz-Benıtez and L E Sucar, “Synthetic time series: A dataset for causal discovery,” 2023

[27] D Danks and S Plis, “Learning causal structure from undersampled time series,” 2013

[28] L Barnett and A K Seth, “Detectability of granger causality for subsampled continuous-time neurophysiological processes,” Journal of Neuroscience Methods, vol 275 pp 93–121 2017

[29] R E Kalman, “Mathematical description of linear dynamical systems,” Journal of the Society for Industrial and Applied Mathematics, Series A: Control, vol 1 no 2 pp 152–192 1963

[30] P Stoica and Y Selen, “Model-order selection: a review of information criterion rules,” IEEE Signal Processing Magazine, vol 21 no 4 pp 36–47 2004

[31] M B Kennel, R Brown, and H D Abarbanel, “Determining embedding dimension for phase-space reconstruction using a geometrical construction,” Physical Review A, vol 45 no 6 p 3403 1992

[32] P P Sanchez, D Machlanski, S McDonagh, and S A Tsaftaris, “Causal ordering for structure learning from time series,” arXiv preprint arXiv:2510.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. improve causal discovery methods by incorporating signal processing concepts to address sensitivity to sampling rate and window length mismatches, as demonstrated in Section III.C and IV-A. This will allow AI systems to perform more robust causal inference when data acquisition times do not perfectly match underlying physical events, a key concern raised in the abstract.

  2. develop causal discovery algorithms that utilize concepts from the Nyquist-Shannon theorem to establish lower bounds on sampling rates for correct causal inference, as suggested in Section V. This improvement will enable AI systems to automatically select optimal sampling rates based on the spectral properties of the hypothesized causal mechanism.

  3. enhance parameter selection methods, such as those for window length Q, by integrating information criteria like Akaike and Bayesian criteria more deeply into the algorithm's decision-making process, as mentioned in Section III.C. This will lead to better performance when choosing Q for complex dynamics beyond simple heuristics.

  4. create a hybrid causal discovery framework that combines constraint-based methods with gradient-based techniques to leverage the strengths of both approaches, as implied by the discussion of different method categories in Section II and IV. This system could potentially learn a more complete graph structure by combining structural constraints with continuous optimization techniques like DYNOTEARS.

  5. implement cross mapping methods that are more sensitive to latent deterministic dynamical systems, moving beyond restrictive assumptions noted in Section II.E. This would allow the AI system to infer causality even when linear models (like GC) fail, providing a broader range of causal discovery capabilities for non-linear processes.

Abstract

Causal discovery problems use a set of observations to deduce causality between variables in the real world, typically to answer questions about biological or physical systems. These observations are often recorded at regular time intervals, determined by a user or a machine, depending on the experiment design. There is generally no guarantee that the timing of these recordings matches the timing of the underlying biological or physical events. In this paper, we examine the sensitivity of causal discovery methods to this potential mismatch. We consider empirical and theoretical evidence to understand how causal discovery performance is impacted by changes of sampling rate and window length. We demonstrate that both classical and recent causal discovery methods exhibit sensitivity to these hyperparameters, and we discuss how ideas from signal processing may help us understand these phenomena.

Sources

Related papers