{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:20:16Z","timestamp":1780384816810,"version":"3.54.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319116617","type":"print"},{"value":"9783319116624","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11662-4_19","type":"book-chapter","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T09:19:18Z","timestamp":1412155158000},"page":"260-274","source":"Crossref","is-referenced-by-count":21,"title":["Generalization Bounds for Time Series Prediction with Non-stationary Processes"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Kuznetsov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehryar","family":"Mohri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1109\/TIT.2012.2212414","volume":"59","author":"A. Agarwal","year":"2013","unstructured":"Agarwal, A., Duchi, J.C.: The Generalization Ability of Online Algorithms for Dependent Data. IEEE Transactions on Information Theory\u00a059(1), 573\u2013587 (2013)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1214\/009053605000000282","volume":"33","author":"P.L. Bartlett","year":"2005","unstructured":"Bartlett, P.L., Bousquet, O., Mendelson, S.: Local Rademacher complexities. The Annals of Statistics\u00a033, 1497\u20131537 (2005)","journal-title":"The Annals of Statistics"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0167-7152(96)00098-3","volume":"32","author":"P. Berti","year":"1997","unstructured":"Berti, P., Rigo, P.: A Glivenko-Cantelli theorem for exchangeable random variables. Statistics and Probability Letters\u00a032, 385\u2013391 (1997)","journal-title":"Statistics and Probability Letters"},{"key":"19_CR4","series-title":"Lecture Notes in Statistics","volume-title":"Mixing: Properties and Examples","author":"P. Doukhan","year":"1989","unstructured":"Doukhan, P.: Mixing: Properties and Examples. Lecture Notes in Statistics, vol.\u00a085. Springer, New York (1989)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-7152(84)90067-1","volume":"2","author":"E. Eberlein","year":"1994","unstructured":"Eberlein, E.: Weak convergence of partial sums of absolutely regular sequences. Statistics & Probability Letters\u00a02, 291\u2013293 (1994)","journal-title":"Statistics & Probability Letters"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Kifer, D., Ben-David, S., Gehrke, J.: Detecting change in data streams. In: Proceedings of the 30th International Conference on Very Large Data Bases (2004)","DOI":"10.1016\/B978-012088469-8.50019-X"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Koltchinskii, V., Panchenko, D.: Rademacher processes and bounding the risk of function learning. In: High Dimensional Probability II, pp. 443\u2013459. Birkhauser (1999)","DOI":"10.1007\/978-1-4612-1358-1_29"},{"key":"19_CR8","unstructured":"Mansour, Y., Mohri, M., Rostamizadeh, A.: Domain adaptation: learning bounds and algorithms. In: Proceedings of the Annual Conference on Learning Theory (COLT 2009). Omnipress (2009)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Surveys in Combinatorics, pp. 148\u2013188. Cambridge University Press (1989)","DOI":"10.1017\/CBO9781107359949.008"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1007602715810","volume":"39","author":"R. Meir","year":"2000","unstructured":"Meir, R.: Nonparametric time series prediction through adaptive model selection. Machine Learning\u00a039(1), 5\u201334 (2000)","journal-title":"Machine Learning"},{"key":"19_CR11","unstructured":"Mohri, M., Rostamizadeh, A.: Rademacher complexity bounds for non-i.i.d. processes. In: Advances in Neural Information Processing Systems (NIPS 2008), pp. 1097\u20131104. MIT Press (2009)"},{"key":"19_CR12","unstructured":"Mohri, M., Rostamizadeh, A.: Stability bounds for stationary \u03d5-mixing and \u03b2-mixing processes. Journal of Machine Learning 11 (2010)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-34106-9_13","volume-title":"Algorithmic Learning Theory","author":"M. Mohri","year":"2012","unstructured":"Mohri, M., Mu\u00f1oz Medina, A.: New analysis and algorithm for learning with drifting distributions. In: Bshouty, N.H., Stoltz, G., Vayatis, N., Zeugmann, T. (eds.) ALT 2012. LNCS, vol.\u00a07568, pp. 124\u2013138. Springer, Heidelberg (2012)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Pestov, V.: Predictive PAC learnability: A paradigm for learning from exchangeable input data. In: 2010 IEEE International Conference on Granular Computing (GrC 2010), Los Alamitos, California, pp. 387\u2013391 (2010)","DOI":"10.1109\/GrC.2010.102"},{"key":"19_CR15","unstructured":"Rakhlin, A., Sridharan, K., Tewari, A.: Online learning: random averages, combinatorial parameters, and learnability. In: Advances in Neural Information Processing Systems (NIPS 2010), pp. 1984\u20131992 (2010)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Rakhlin, A., Sridharan, K., Tewari, A.: Sequential complexities and uniform martingale laws of large numbers. Probability Theory and Related Fields, 1\u201343 (2014)","DOI":"10.1007\/s00440-013-0545-5"},{"key":"19_CR17","unstructured":"Shalizi, C.R., Kontorovich, A.: Predictive PAC Learning and Process Decompositions. In: Advances in Neural Information Processing Systems (NIPS 2013), pp. 1619\u20131627 (2013)"},{"key":"19_CR18","unstructured":"Steinwart, I., Christmann, A.: Fast learning from non-i.i.d. observations. In: Bengio, Y., Schuurmans, D., Lafferty, J., Williams, C.K.I., Culotta, A. (eds.) Advances in Neural Information Processing Systems (NIPS 2009), pp. 1768\u20131776. MIT Press (2009)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/1104015","volume":"4","author":"V.A. Volkonskii","year":"1959","unstructured":"Volkonskii, V.A., Rozanov, Y.A.: Some limit theorems for random functions I. Theory of Probability and Its Applications\u00a04, 178\u2013197 (1959)","journal-title":"Theory of Probability and Its Applications"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1214\/aop\/1176988849","volume":"22","author":"B. Yu","year":"1994","unstructured":"Yu, B.: Rates of convergence for empirical processes of stationary mixing sequences. Annals Probability\u00a022(1), 94\u2013116 (1994)","journal-title":"Annals Probability"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11662-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T01:12:20Z","timestamp":1559005940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11662-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319116617","9783319116624"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11662-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}