Distributional Granger Causality: Identification, Sequential Inference, and Adaptive Testing

• URL: http://arxiv.org/abs/2606.22230v1
• Date: Sat, 20 Jun 2026 21:18:02 GMT
• Title: Distributional Granger Causality: Identification, Sequential Inference, and Adaptive Testing
• Abstract summary: Outside the Gaussian setting, causal content may arise through conditional scale, tail behavior, asymmetry, or other distributional features.<n>This paper develops a framework for distributional Granger causality based on a finite collection of channel-specific restrictions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Predictive dependence in time series need not be confined to the conditional mean. Outside the Gaussian setting, causal content may arise through conditional scale, tail behavior, asymmetry, or other distributional features, implying that no single Granger-type test provides a complete characterization of predictive dependence. This paper develops a framework for distributional Granger causality based on a finite collection of channel-specific restrictions. Under suitable determinacy conditions, the channel menu is shown to be complete, yielding an identification result that links distributional Granger non-causality to a finite set of testable hypotheses. Building on this representation, we develop an adaptive sequential testing procedure that allocates inferential resources across channels while maintaining familywise error control through an alpha-investing mechanism. A policy-invariant validity theorem establishes finite-sample size control under arbitrary admissible selection rules, while an asymptotic efficiency theorem shows that a confidence-bound allocation rule achieves power equivalent to that of an infeasible oracle benchmark. The theoretical guarantees are derived from primitive mixing and moment conditions together with a circular-block permutation scheme.

Related papers

• Conformal Prediction for Dyadic Regression Under Complex Missingness [2.7512870037345696]
  We develop a framework for conformal prediction in dyadic regression problems under complex missingness mechanisms.<n>We establish conditional validity results for both continuous and discrete responses.<n>This is the first formal proof of conditional validity for weighted conformal prediction under a missing-not-at-random assumption.
  arXiv  Detail & Related papers  (2026-06-09T17:28:07Z)
• Robust Conditional Conformal Prediction via Branched Normalizing Flow [20.92399096303012]
  Conformal prediction constructs with marginal coverage guarantees under the assumption that the calibration and test distributions are identical.<n>We introduce Branched Normalizing Flow (BNF), a two-branch architecture that normalizes a test input to the calibration distribution and transforms the prediction set of the normalized input back to the test distribution.<n>BNF consistently improves conditional coverage robustness on nine datasets across a wide range of confidence levels.
  arXiv  Detail & Related papers  (2026-05-03T13:29:26Z)
• Bridging Conformal Prediction and Scenario Optimization: Discarded Constraints and Modular Risk Allocation [0.0]
  This paper revisits that connection directly from a systems-and-control viewpoint.<n>We introduce a simple modular composition rule that combines several blockwise calibration certificates into a single joint guarantee.
  arXiv  Detail & Related papers  (2026-03-19T18:37:58Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• On the Theory of Conditional Feature Alignment for Unsupervised Domain-Adaptive Counting [27.44207520673983]
  Object counting models suffer when deployed across domains with differing density variety.<n>We propose a theoretical framework of conditional feature alignment and provide a straightforward implementation.
  arXiv  Detail & Related papers  (2025-06-20T16:37:48Z)
• SConU: Selective Conformal Uncertainty in Large Language Models [59.25881667640868]
  We propose a novel approach termed Selective Conformal Uncertainty (SConU)<n>We develop two conformal p-values that are instrumental in determining whether a given sample deviates from the uncertainty distribution of the calibration set at a specific manageable risk level.<n>Our approach not only facilitates rigorous management of miscoverage rates across both single-domain and interdisciplinary contexts, but also enhances the efficiency of predictions.
  arXiv  Detail & Related papers  (2025-04-19T03:01:45Z)
• Conformal Generative Modeling with Improved Sample Efficiency through Sequential Greedy Filtering [55.15192437680943]
  Generative models lack rigorous statistical guarantees for their outputs.<n>We propose a sequential conformal prediction method producing prediction sets that satisfy a rigorous statistical guarantee.<n>This guarantee states that with high probability, the prediction sets contain at least one admissible (or valid) example.
  arXiv  Detail & Related papers  (2024-10-02T15:26:52Z)
• Probabilistic Conformal Prediction with Approximate Conditional Validity [81.30551968980143]
  We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution. Our method consistently outperforms existing approaches in terms of conditional coverage.
  arXiv  Detail & Related papers  (2024-07-01T20:44:48Z)
• Likelihood Ratio Confidence Sets for Sequential Decision Making [51.66638486226482]
  We revisit the likelihood-based inference principle and propose to use likelihood ratios to construct valid confidence sequences. Our method is especially suitable for problems with well-specified likelihoods. We show how to provably choose the best sequence of estimators and shed light on connections to online convex optimization.
  arXiv  Detail & Related papers  (2023-11-08T00:10:21Z)
• When Does Confidence-Based Cascade Deferral Suffice? [69.28314307469381]
  Cascades are a classical strategy to enable inference cost to vary adaptively across samples. A deferral rule determines whether to invoke the next classifier in the sequence, or to terminate prediction. Despite being oblivious to the structure of the cascade, confidence-based deferral often works remarkably well in practice.
  arXiv  Detail & Related papers  (2023-07-06T04:13:57Z)
• Approximate Conditional Coverage via Neural Model Approximations [0.030458514384586396]
  We analyze a data-driven procedure for obtaining empirically reliable approximate conditional coverage. We demonstrate the potential for substantial (and otherwise unknowable) under-coverage with split-conformal alternatives with marginal coverage guarantees.
  arXiv  Detail & Related papers  (2022-05-28T02:59:05Z)

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.