CAST: Causal Anchored Simplex Transport for Distribution-Valued Time Series

· Source: stat.ML updates on arXiv.org · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Data Science & Analytics · Depth: Expert, extended

Summary

CAST (Causal Anchored Simplex Transport) is a novel causal forecasting model designed for distribution-valued time series, which are common in systems like queue occupancies, mobility shares, and public-health mixtures. These systems are observed as aggregate distributions on a probability simplex, not scalar trajectories. CAST addresses the "latent transition-kernel aliasing" problem, where similar observed distributions can arise from different underlying mechanisms, leading to inaccurate forecasts by fixed-summary methods. The model operates by retrieving empirical successors from causal context, stabilizing them with a persistence anchor, and applying a bounded local stochastic transport on ordered supports, ensuring simplex preservation at each stage. Evaluated on eleven public and simulated benchmarks spanning diverse domains, CAST achieved an average rank of 1.27 on one-step KL and 1.91 on autoregressive rollout JSD, outperforming 15 baselines by winning 8/11 sections on each metric and ranking top-2 on all 11 sections for offline KL.

Key takeaway

For AI Scientists and Machine Learning Engineers working with distribution-valued time series, CAST offers a robust solution to the challenge of latent-kernel aliasing and ordered mass motion. You should consider implementing CAST, especially for applications like queueing systems or public health, where preserving the simplex and accurately modeling local mass shifts are critical for stable, long-horizon predictions. Its strong performance across diverse benchmarks suggests it can significantly improve forecast accuracy and reliability.

Key insights

CAST improves distribution-valued time series forecasting by structuring transitions around causal context, persistence, and local mass transport.

Principles

Method

CAST retrieves empirical successors, forms a persistence-retrieval anchor $a_{t}=\lambda_{t}p_{t}+(1-\lambda_{t})r_{t}$, and applies a bounded local stochastic transport $T_{t}$ to yield $\hat{p}_{t+1}=(1-\rho_{t})a_{t}+\rho_{t}T_{t}a_{t}$.

In practice

Topics

Best for: AI Scientist, Machine Learning Engineer, Research Scientist

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by stat.ML updates on arXiv.org.