Archives AI News

CaDrift: A Time-dependent Causal Generator of Drifting Data Streams

arXiv:2602.20329v1 Announce Type: new Abstract: This work presents Causal Drift Generator (CaDrift), a time-dependent synthetic data generator framework based on Structural Causal Models (SCMs). The framework produces a virtually infinite combination of data streams with controlled shift events and time-dependent…

Towards Attributions of Input Variables in a Coalition

arXiv:2309.13411v3 Announce Type: replace Abstract: This paper focuses on the fundamental challenge of partitioning input variables in attribution methods for Explainable AI, particularly in Shapley value-based approaches. Previous methods always compute attributions given a predefined partition but lack theoretical guidance…

Emergent Manifold Separability during Reasoning in Large Language Models

arXiv:2602.20338v1 Announce Type: new Abstract: Chain-of-Thought (CoT) prompting significantly improves reasoning in Large Language Models, yet the temporal dynamics of the underlying representation geometry remain poorly understood. We investigate these dynamics by applying Manifold Capacity Theory (MCT) to a compositional…

Momentum Guidance: Plug-and-Play Guidance for Flow Models

arXiv:2602.20360v1 Announce Type: new Abstract: Flow-based generative models have become a strong framework for high-quality generative modeling, yet pretrained models are rarely used in their vanilla conditional form: conditional samples without guidance often appear diffuse and lack fine-grained detail due…

Foundation Models for Causal Inference via Prior-Data Fitted Networks

arXiv:2506.10914v3 Announce Type: replace Abstract: Prior-data fitted networks (PFNs) have recently been proposed as a promising way to train tabular foundation models. PFNs are transformers that are pre-trained on synthetic data generated from a prespecified prior distribution and that enable…

Quantitative Approximation Rates for Group Equivariant Learning

arXiv:2602.20370v1 Announce Type: new Abstract: The universal approximation theorem establishes that neural networks can approximate any continuous function on a compact set. Later works in approximation theory provide quantitative approximation rates for ReLU networks on the class of $alpha$-H”older functions…