On universal algorithms for classifying and predicting stationary processes
type: Item
instance of: scholarly article
title: On universal algorithms for classifying and predicting stationary processes
zbMATH Open document ID: 1479.60080
DOI: 10.1214/20-PS345
author: Gusztáv Morvai
author: Benjamin Weiss
published in: Probability Surveys
publication date: 2021-07-05T00:00:00Z
Mathematics Subject Classification ID: 60G25
zbMATH DE Number: 7367833
zbMATH Keywords: stationary processes
zbMATH Keywords: prediction theory
MaRDI profile type: Publication
cites work: Universal schemes for prediction, gambling and portfolio selection
cites work: The strong law of large numbers for sequential decisions under uncertainty
cites work: Universal schemes for learning the best nonlinear predictor given the infinite past and side information
cites work: On Uniformly Consistent Tests
cites work: Rate of convergence of predictive distributions for dependent data
cites work: Nonparametric sequential prediction of time series
cites work: The Individual Ergodic Theorem of Information Theory
cites work: Correction Notes: Correction to "The Individual Ergodic Theorem of Information Theory"
cites work: Variable length Markov chains
cites work: Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean
cites work: The consistency of the BIC Markov order estimator.
cites work: Large-scale typicality of Markov sample paths and consistency of MDL order estimators
cites work: Context tree estimation for not necessarily finite memory processes, via BIC and MDL
cites work: Relevant states and memory in Markov chain bootstrapping and simulation
cites work: A topological criterion for hypothesis testing
cites work: Weakly universally consistent static forecasting of stationary and ergodic time series via local averaging and least squares estimates
cites work: Stationary Processes and Prediction Theory. (AM-44)
cites work: Nonparametric statistical inference for the context tree of a stationary ergodic process
cites work: On processes which cannot be distinguished by finite observation
cites work: A distribution-free theory of nonparametric regression
cites work: A simple randomized algorithm for sequential prediction of ergodic time series
cites work: Limits to consistent on-line forecasting for ergodic time series
cites work: Sequential Prediction of Unbounded Stationary Time Series
cites work: Q3094034
cites work: An Open Problem on Strongly Consistent Learning of the Best Prediction for Gaussian Processes
cites work: On the minimal penalty for Markov order estimation
cites work: On Stochastic Processes Derived From Markov Chains
cites work: Q3136462
cites work: Distinguishability of Sets of Distributions
cites work: Weakly Universally Consistent Forecasting of Stationary and Ergodic Time Series
cites work: Random Markov processes and uniform martingales
cites work: Finitarily deterministic generators for zero entropy systems
cites work: On unstable and unoptimal prediction
cites work: Strongly mixing g-measures
cites work: Bernoulli schemes of the same entropy are finitarily isomorphic
cites work: Consistent algorithms for clustering time series
cites work: Order estimation for a special class of hidden Markov sources and binary renewal processes
cites work: Strongly consistent code-based identification and order estimation for constrained finite-state model classes
cites work: Q3258494
cites work: Nonparametric entropy estimation for stationary processes and random fields, with applications to English text
cites work: Q3226083
cites work: Neighborhood radius estimation for variable-neighborhood random fields
cites work: The ergodic theorem for a sequence of functions
cites work: Universal prediction
cites work: On the estimation of the order of a Markov chain and universal data compression
cites work: Intermittent Estimation for Gaussian Processes
cites work: Q3498016
cites work: Weakly convergent nonparametric forecasting of stationary time series
cites work: Nonparametric inference for ergodic, stationary time series
cites work: Forecasting for stationary binary time series
cites work: Intermittent estimation of stationary time series
cites work: Prediction for discrete time series
cites work: Limitations on intermittent forecasting
cites work: On classifying processes
cites work: Inferring the conditional mean
cites work: Order Estimation of Markov Chains
cites work: Forward estimation for ergodic time series
cites work: On estimating the memory for finitarily Markovian processes
cites work: ON SEQUENTIAL ESTIMATION AND PREDICTION FOR DISCRETE TIME SERIES
cites work: Estimating the Lengths of Memory Words
cites work: On universal estimates for binary renewal processes
cites work: Nonparametric sequential prediction for stationary processes
cites work: Testing stationary processes for independence
cites work: A note on prediction for discrete time series
cites work: Universal Tests for Memory Words
cites work: Q5179066

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: A versatile scheme for predicting renewal times.

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: A note on discriminating Poisson processes from other point processes with stationary inter arrival times

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Estimating the conditional expectations for continuous time stationary processes

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Universal rates for estimating the residual waiting time in an intermittent way

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Limits to classification and regression estimation from ergodic processes

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: On optimal sequential prediction for general processes

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Hypothesis testing for families of ergodic processes

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Guessing the next output of a stationary process

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Q4049307

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: How sampling reveals a process

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Entropy and data compression schemes

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Entropy is the only finitely observable invariant

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Prediction of random sequences and universal coding

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Compression-Based Methods for Nonparametric Prediction and Estimation of Some Characteristics of Time Series

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Universal codes as a basis for time series testing

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Q3093365

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Discrimination between B-processes is impossible

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Asymptotic Nonparametric Statistical Analysis of Stationary Time Series

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Q5214242

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Predicting the future of functions on flows

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Entropy and nonlinear prediction

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Conditional expectations of stationary processes

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Strongly consistent online forecasting of centered Gaussian processes

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: A Mathematical Theory of Communication

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Computational Limits to Nonparametric Estimation for Ergodic Processes

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Some remarks on filtering and prediction of stationary processes

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Q4937537

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: A universal algorithm for sequential data compression

On universal algorithms for classifying and predicting stationary processes (cites work)
cites work: Coding theorems for individual sequences