Nonparametric time series prediction through adaptive model selection
From MaRDI portal
Publication:1568387
DOI10.1023/A:1007602715810zbMath0954.68124MaRDI QIDQ1568387
Publication date: 21 June 2000
Published in: Machine Learning (Search for Journal in Brave)
Related Items
Generalization bounds for non-stationary mixing processes ⋮ Least-squares regularized regression with dependent samples andq-penalty ⋮ A CONSISTENT NONPARAMETRIC TEST FOR CAUSALITY IN QUANTILE ⋮ Learning short multivariate time series models through evolutionary and sparse matrix computation ⋮ Deviation inequalities for stochastic approximation by averaging ⋮ An oracle inequality for regularized risk minimizers with strongly mixing observations ⋮ Exponential inequalities for nonstationary Markov chains ⋮ Discrepancy-based theory and algorithms for forecasting non-stationary time series ⋮ Model selection in reinforcement learning ⋮ High-dimensional VAR with low-rank transition ⋮ Estimating beta-mixing coefficients via histograms ⋮ Learning from non-irreducible Markov chains ⋮ Dynamics of Bayesian updating with dependent data and misspecified models ⋮ Model selection for weakly dependent time series forecasting ⋮ Regularized least-squares regression: learning from a sequence ⋮ Fast learning from \(\alpha\)-mixing observations ⋮ Empirical risk minimization and complexity of dynamical models ⋮ Random forests for time-dependent processes ⋮ Unsupervised slow subspace-learning from stationary processes ⋮ Learning from dependent observations ⋮ Prediction of time series by statistical learning: general losses and fast rates ⋮ VC-dimension and structural risk minimization for the analysis of nonlinear ecological models ⋮ An Open Problem on Strongly Consistent Learning of the Best Prediction for Gaussian Processes ⋮ Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path ⋮ Consistency of support vector machines for forecasting the evolution of an unknown ergodic dynamical system from observations with unknown noise ⋮ Estimation and approximation bounds for gradient-based reinforcement learning
