Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates
From MaRDI portal
(Redirected from Publication:6634799)
Cites work
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- Asymptotic Nonparametric Statistical Analysis of Stationary Time Series
- Computational Limits to Nonparametric Estimation for Ergodic Processes
- Consistency, integrability and asymptotic normality for some intermittent estimators
- Context tree estimation for not necessarily finite memory processes, via BIC and MDL
- Discrimination between B-processes is impossible
- Efficient prediction for linear and nonlinear autoregressive models
- Estimating the Lengths of Memory Words
- Forward estimation for ergodic time series
- Guessing the next output of a stationary process
- scientific article; zbMATH DE number 5280104 (Why is no real title available?)
- scientific article; zbMATH DE number 741240 (Why is no real title available?)
- scientific article; zbMATH DE number 814503 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3026522 (Why is no real title available?)
- Inequalities for the $r$th Absolute Moment of a Sum of Random Variables, $1 \leqq r \leqq 2$
- Information and complexity in statistical modeling.
- Intermittent estimation for finite alphabet finitarily Markovian processes with exponential tails
- Introduction to empirical processes and semiparametric inference
- Large-scale typicality of Markov sample paths and consistency of MDL order estimators
- Learning whenever learning is possible: universal learning under general stochastic processes
- Limitations on intermittent forecasting
- Limits to consistent on-line forecasting for ergodic time series
- Nonparametric curve estimation from time series
- Nonparametric estimation of conditional probability densities and expectations of stationary processes: Strong consistency and rates
- On classifying processes
- On estimating the memory for finitarily Markovian processes
- On optimal sequential prediction for general processes
- On prediction of individual sequences
- ON SEQUENTIAL ESTIMATION AND PREDICTION FOR DISCRETE TIME SERIES
- On universal algorithms for classifying and predicting stationary processes
- Order Estimation of Markov Chains
- Prediction for discrete time series
- Prediction of random sequences and universal coding
- Sequential Prediction of Unbounded Stationary Time Series
- Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean
- The consistency of the BIC Markov order estimator.
- The optimal error exponent for Markov order estimation
- The strong law of large numbers for sequential decisions under uncertainty
- The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
- Universal prediction
- Universal schemes for learning the best nonlinear predictor given the infinite past and side information
- Universal Tests for Memory Words
- Variable length Markov chains
- Weakly Universally Consistent Forecasting of Stationary and Ergodic Time Series
- Weakly universally consistent static forecasting of stationary and ergodic time series via local averaging and least squares estimates
This page was built for publication: Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634799)
