Non-stationary, non-asymptotic bounds please. Keywords: Ergodic, α-, β-mixing.
Mohri and Kuznetsov have done lots of work here; See, e.g. their NIPS2016 tutorial. There seem to be a lot of types of ergodic/mixing results, about which I know as yet nothing. Notably (Kuznetsov and Mohri 2016, 2015) try to go beyond this setup.
(Yu 1994) sets forth many of the uniform ergodic theorems that are needed to derive generalization error bounds for stochastic processes. (Meir 2000) is one of the first papers to construct risk bounds for time series. …
More recently, others have provided PAC results for non-IID data. (Steinwart and Christmann 2009) prove an oracle inequality for generic regularized empirical risk minimization algorithms learning from α-mixing processes, a fairly general sort of weak serial dependence, getting learning rates for least-squares support vector machines (SVMs) close to the optimal IID rates. (Mohri and Rostamizadeh 2009b) prove stability-based generalization bounds when the data are stationary and φ-mixing or β-mixing, strictly generalizing IID results and applying to all stable learning algorithms. … (Karandikar and Vidyasagar n.d.) show that if an algorithm is “subadditive” and yields a predictor whose risk can be upper bounded when the data are IID, then the same algorithm yields predictors whose risk can be bounded if data are β-mixing. They use this result to derive generalization error bounds in terms of the learning rates for IID data and the β-mixing coefficients.
Bounds that depend on mixing coefficients can be unsatisfying, since even when the mixing coefficient can be estimated from the data, it will depend on the parameters fit to the data. Which will depend on the mixing coefficient.
Time series forecasting plays a crucial role in a number of domains ranging from weather forecasting and earthquake prediction to applications in economics and finance. The classical statistical approaches to time series analysis are based on generative models such as the autoregressive moving average (ARMA) models, or their integrated versions (ARIMA) and several other extensions … . Most of these models rely on strong assumptions about the noise terms, often assumed to be i.i.d. random variables sampled from a Gaussian distribution, and the guarantees provided in their support are only asymptotic. An alternative non-parametric approach to time series analysis consists of extending the standard i.i.d. statistical learning theory framework to that of stochastic processes.
… we consider the general case of non-stationary non-mixing processes. We are not aware of any prior work providing generalization bounds in this setting. In fact, our bounds appear to be novel even when the process is stationary (but not mixing). The learning guarantees that we present hold for both bounded and unbounded memory models. … Our guarantees cover the majority of approaches used in practice, including various autoregressive and state space models. The key ingredients of our generalization bounds are a data-dependent measure of sequential complexity (expected sequential covering number or sequential Rademacher complexity [Rakhlin et al., 2010]) and a measure of discrepancy between the sample and target distributions. (Kuznetsov and Mohri 2014) also give generalization bounds in terms of discrepancy. However, unlike the result of (Kuznetsov and Mohri 2014), our analysis does not require any mixing assumptions which are hard to verify in practice. More importantly, under some additional mild assumption, the discrepancy measure that we propose can be estimated from data, which leads to data-dependent learning guarantees for non-stationary non-mixing case.
They still want their time series to have a discrete time index, which can be unsatisfying for continuous processes.
They also work with mixing coefficients (e.g. (Kuznetsov and Mohri 2016)) but last time I saw them speak, they were critical of the whole mixing coefficient setting.
Agarwal, Anish, Muhammad Jehangir Amjad, Devavrat Shah, and Dennis Shen. 2018. “Time Series Analysis via Matrix Estimation,” February. http://arxiv.org/abs/1802.09064.
Alquier, Pierre, Xiaoyin Li, and Olivier Wintenberger. 2013. “Prediction of Time Series by Statistical Learning: General Losses and Fast Rates.” Dependence Modeling 1: 65–93. https://doi.org/10.2478/demo-2013-0004.
Alquier, Pierre, and Olivier Wintenberger. 2012. “Model Selection for Weakly Dependent Time Series Forecasting.” Bernoulli. http://arxiv.org/abs/0902.2924.
Bergmeir, Christoph, Rob J. Hyndman, and Bonsoo Koo. 2015. “A Note on the Validity of Cross-Validation for Evaluating Time Series Prediction.” http://business.monash.edu/econometrics-and-business-statistics/research/publications/ebs/wp10-15.pdf.
Cortes, Corinna, Vitaly Kuznetsov, Mehryar Mohri, and Scott Yang. 2016. “Structured Prediction Theory Based on Factor Graph Complexity.” In Advances in Neural Information Processing Systems 29, edited by D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett, 2514–22. Curran Associates, Inc. http://papers.nips.cc/paper/6485-structured-prediction-theory-based-on-factor-graph-complexity.pdf.
Delft, Anne van, and Michael Eichler. 2016. “Locally Stationary Functional Time Series,” February. http://arxiv.org/abs/1602.05125.
Geer, Sara van de. 2002. “On Hoeffdoing’s Inequality for Dependent Random Variables.” In Empirical Process Techniques for Dependent Data. Birkhhäuser.
Gribonval, Rémi, Gilles Blanchard, Nicolas Keriven, and Yann Traonmilin. 2017. “Compressive Statistical Learning with Random Feature Moments,” June. http://arxiv.org/abs/1706.07180.
Hardt, Moritz, Tengyu Ma, and Benjamin Recht. 2016. “Gradient Descent Learns Linear Dynamical Systems,” September. http://arxiv.org/abs/1609.05191.
Hazan, Elad, Karan Singh, and Cyril Zhang. 2017. “Learning Linear Dynamical Systems via Spectral Filtering.” In NIPS. http://arxiv.org/abs/1711.00946.
Karandikar, R. L., and M. Vidyasagar. n.d. “Probably Approximately Correct Learning with Beta-Mixing Input Sequences.” Accessed June 14, 2017. https://www.math.ucsd.edu/~helton/MTNSHISTORY/CONTENTS/2004LEUVEN/CDROM/papers/201.pdf.
Kontorovich, Leonid (Aryeh), Corinna Cortes, and Mehryar Mohri. 2008. “Kernel Methods for Learning Languages.” Theoretical Computer Science, Algorithmic Learning Theory, 405 (3): 223–36. https://doi.org/10.1016/j.tcs.2008.06.037.
Kontorovich, Leonid, Corinna Cortes, and Mehryar Mohri. 2006. “Learning Linearly Separable Languages.” In Algorithmic Learning Theory, edited by José L. Balcázar, Philip M. Long, and Frank Stephan, 288–303. Lecture Notes in Computer Science 4264. Springer Berlin Heidelberg. http://link.springer.com/chapter/10.1007/11894841_24.
Kuznetsov, Vitaly, and Mehryar Mohri. 2014. “Forecasting Non-Stationary Time Series: From Theory to Algorithms.” http://www.cims.nyu.edu/~munoz/multitask/Paper_22_fts.pdf.
———. 2015. “Learning Theory and Algorithms for Forecasting Non-Stationary Time Series.” In Advances in Neural Information Processing Systems, 541–49. Curran Associates, Inc. http://papers.nips.cc/paper/5836-learning-theory-and-algorithms-for-forecasting-non-stationary-time-series.
———. 2016. “Generalization Bounds for Non-Stationary Mixing Processes.” In Machine Learning Journal. http://www.cs.nyu.edu/~mohri/pub/nonstatj.pdf.
McDonald, Daniel J., Cosma Rohilla Shalizi, and Mark Schervish. 2011a. “Generalization Error Bounds for Stationary Autoregressive Models,” March. http://arxiv.org/abs/1103.0942.
———. 2011b. “Risk Bounds for Time Series Without Strong Mixing,” June. http://arxiv.org/abs/1106.0730.
Meir, Ron. 2000. “Nonparametric Time Series Prediction Through Adaptive Model Selection.” Machine Learning 39 (1): 5–34. https://doi.org/10.1023/A:1007602715810.
Mohri, Mehryar, and Afshin Rostamizadeh. 2009a. “Rademacher Complexity Bounds for Non-Iid Processes.” In Advances in Neural Information Processing Systems, 1097–1104. http://papers.nips.cc/paper/3489-rademacher-complexity-bounds-for-non-iid-processes.
———. 2009b. “Stability Bounds for Stationary ϕ-Mixing and β-Mixing Processes.” Journal of Machine Learning Research 4: 1–26. http://www.jmlr.org/papers/v11/mohri10a.html.
Rakhlin, Alexander, Karthik Sridharan, and Ambuj Tewari. 2014. “Sequential Complexities and Uniform Martingale Laws of Large Numbers.” Probability Theory and Related Fields 161 (1-2): 111–53. https://doi.org/10.1007/s00440-013-0545-5.
Shalizi, Cosma, and Aryeh Kontorovich. 2013. “Predictive PAC Learning and Process Decompositions.” In Advances in Neural Information Processing Systems, 1619–27. http://papers.nips.cc/paper/5102-predictive-pac-learning-and-process-decompositions.
Simchowitz, Max, Horia Mania, Stephen Tu, Michael I. Jordan, and Benjamin Recht. 2018. “Learning Without Mixing: Towards A Sharp Analysis of Linear System Identification,” February. http://arxiv.org/abs/1802.08334.
Steinwart, Ingo, and Andreas Christmann. 2009. “Fast Learning from Non-Iid Observations.” In Advances in Neural Information Processing Systems, 1768–76. http://papers.nips.cc/paper/3736-fast-learning-from-non-iid-observations.
Xu, Aolin, and Maxim Raginsky. 2017. “Information-Theoretic Analysis of Generalization Capability of Learning Algorithms.” In Advances in Neural Information Processing Systems. http://arxiv.org/abs/1705.07809.
Yu, Bin. 1994. “Rates of Convergence for Empirical Processes of Stationary Mixing Sequences.” The Annals of Probability 22 (1): 94–116. https://doi.org/10.1214/aop/1176988849.