analiza aiqbench
This research introduces a novel generative sequence modeling framework capable of handling multivariate stochastic processes with infinite-range memory and long-range nonlinear interactions. By leveraging predictive states compressed into low-dimensional statistics, the method overcomes traditional nonparametric limitations while establishing theoretical convergence guarantees for deep neural network implementations. This advancement is significant for AI researchers tackling complex time-series prediction tasks where standard assumptions about sparsity or finite memory fail.
Generative sequence modeling for infinite memory processes via predictive states
arXiv:2609.38524v1 Announce Type: cross Abstract: We consider estimating the one-step-ahead conditional distribution of a multivariate stochastic process. Many existing approaches rely on assumptions such as finite-range memory, sparsity, or additivity, which can be poorly suited to processes with long-range nonlinear interactions. However, without such structural assumptions, nonparametric estimation is challenging due to the curse of dimensionality. To address this challenge, we introduce a new estimation approach based on the predictive states of a process, possibly with infinite-range memory. We show that our estimator achieves fast convergence rates when the past history can be compressed into a low-dimensional statistic that is sufficient for predicting the future. Specifically, we show that the statistical complexity of the estimation problem is determined by the intrinsic dimension of the predictive state space. We establish guarantees for an instantiation of our method based on deep neural network estimators, and we support these theoretical results with experiments.
Abstract:We consider estimating the one-step-ahead conditional distribution of a multivariate stochastic process. Many existing approaches rely on assumptions such as finite-range memory, sparsity, or additivity, which can be poorly suited to processes with long-range nonlinear interactions. However, without such structural assumptions, nonparametric estimation is challenging due to the curse of dimensionality. To address this challenge, we introduce a new estimation approach based on the predictive states of a process, possibly with infinite-range memory. We show that our estimator achieves fast convergence rates when the past history can be compressed into a low-dimensional statistic that is sufficient for predicting the future. Specifically, we show that the statistical complexity of the estimation problem is determined by the intrinsic dimension of the predictive state space. We establish guarantees for an instantiation of our method based on deep neural network estimators, and we support these theoretical results with experiments.
Machine Learning (stat.ML); Machine Learning (cs.LG); Methodology (stat.ME)
arXiv:2609.38524 [stat.ML]
(or arXiv:2609.38524v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2609.38524 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 244 cuvinte
Subiecte conexe

Runway’s WorldPrompt and the Engineering of Real-Time Worlds
Latent Space · 25 sept. 2026

Building for the Rising Complexity of Agentic Systems with Extreme Co-Design
NVIDIA · 5 mai 2026
DI Series: Serving Kimi-K3 MXFP4 Wide-EP Disaggregated on AMD Instinct MI300X and MI325X
AMD · 8 oct. 2026

A kernel-centric path to real-time video generation on Trainium
Amazon Science · 25 sept. 2026