Fetching the paper…
Reading the bibliography…
We study square loss in a realizable time-series framework with martingale difference noise.
The moments of products of quadratic forms in normal variables
Jan R. Magnus · 1978
Earlier work this paper cites.
Markov Chains and Stochastic Stability
Sean P. Meyn and Richard L. Tweedie · 1993
Earlier work this paper cites.
ϵ \epsilon -Entropy and ϵ \epsilon -Capacity of Sets In Functional Spaces , pages 86–170
Vladimir M. Tikhomirov · 1993
Earlier work this paper cites.
Rates of convergence for empirical processes of stationary mixing sequences
Bin Yu · 1994
Earlier work this paper cites.
Minimum complexity regression estimation with weakly dependent observations
Dharmendra S. Modha and Elias Masry · 1996
Earlier work this paper cites.
Concentration of measure inequalities for markov chains and ϕ \phi -mixing processes
Paul-Marie Samson · 2000
Earlier work this paper cites.
Polynomial convergence rates of markov chains
Søren F. Jarner and Gareth O. Roberts · 2002
Earlier work this paper cites.
Improving the sample complexity using global data
Shahar Mendelson · 2002
Earlier work this paper cites.
Quantitative bounds on convergence of time-inhomogeneous markov chains
Randal Douc, Eric Moulines, and Jeffrey S. Rosenthal · 2004
Earlier work this paper cites.
Rademacher complexity bounds for non-i.i.d. processes
Mehryar Mohri and Afshin Rostamizadeh · 2008
Earlier work this paper cites.
Markov Chains and Mixing Times
David A. Levin and Yuval Peres · 2008
Earlier work this paper cites.
Introduction to Nonparametric Estimation
Alexandre B. Tsybakov · 2009
Earlier work this paper cites.
Fast learning from non-i.i.d. observations
Ingo Steinwart and Andreas Christmann · 2009
Earlier work this paper cites.
The generalization performance of erm algorithm with strongly mixing observations
Bin Zou, Luoqing Li, and Zongben Xu · 2009
Earlier work this paper cites.
Robust linear least squares regression
Jean-Yves Audibert and Olivier Catoni · 2011
Earlier work this paper cites.
Online least squares estimation with self-normalized processes: An application to bandit problems
Yasin Abbasi-Yadkori, Dávid Pál, and Csaba Szepesvári · 2011
Earlier work this paper cites.
Yet another look at harris’ ergodic theorem for markov chains
Martin Hairer and Jonathan C. Mattingly · 2011
Cited alongside, same era.
The generalization ability of online algorithms for dependent data
Alekh Agarwal and John C. Duchi · 2012
Cited alongside, same era.
Ergodic mirror descent
John C. Duchi, Alekh Agarwal, Mikael Johansson, and Michael I. Jordan · 2012
Cited alongside, same era.
Learning subgaussian classes: Upper and minimax bounds
Guillaume Lecué and Shahar Mendelson · 2013
Cited alongside, same era.
Learning without concentration
Shahar Mendelson · 2014
Cited alongside, same era.
Analysis and Geometry of Markov Diffusion Operators
Dominique Bakry, Ivan Gentil, and Michel Ledoux · 2014
Cited alongside, same era.
Near optimal finite time identification of arbitrary linear dynamical systems
Tuhin Sarkar and Alexander Rakhlin · 2019
Later among the works it cites.
Learning from weakly dependent data under dobrushin’s condition
Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, and Siddhartha Jayanti · 2019
Later among the works it cites.
Least squares regression with markovian data: Fundamental limits and algorithms
Dheeraj Nagaraj, Xian Wu, Guy Bresler, Prateek Jain, and Praneeth Netrapalli · 2020
Later among the works it cites.
Finite-time identification of stable linear systems optimality of the least-squares estimator
Yassir Jedra and Alexandre Proutiere · 2020
Later among the works it cites.
Non-asymptotic and accurate learning of nonlinear dynamical systems
Yahya Sattar and Samet Oymak · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Learning with square loss: Localization through offset rademacher complexity
Tengyuan Liang, Alexander Rakhlin, and Karthik Sridharan · 2015
Cited alongside, same era.
Incremental stability properties for discrete-time systems
Duc N. Tran, Björn S. Rüffer, and Christopher M. Kellett · 2016
Cited alongside, same era.
Generalization bounds for non-stationary mixing processes
Vitaly Kuznetsov and Mehryar Mohri · 2017
Cited alongside, same era.
On aggregation for heavy-tailed classes
Shahar Mendelson · 2017
Cited alongside, same era.
Learning without mixing: Towards a sharp analysis of linear system identification
Max Simchowitz, Horia Mania, Stephen Tu, Michael I. Jordan, and Benjamin Recht · 2018
Cited alongside, same era.
Finite time identification in unstable linear systems
Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari, and George Michailidis · 2018
Cited alongside, same era.
Learning nonlinear dynamical systems from a single trajectory
Dylan Foster, Tuhin Sarkar, and Alexander Rakhlin · 2020
Later among the works it cites.
Wasserstein upper bounds of the total variation for smooth densities
Minwoo Chae and Stephen G. Walker · 2020
Later among the works it cites.
On empirical risk minimization with dependent and heavy-tailed data
Abhishek Roy, Krishnakumar Balasubramanian, and Murat A Erdogdu · 2021
Later among the works it cites.
Estimation in reproducing kernel hilbert spaces with dependent data
Alessio Sancetta · 2021
Later among the works it cites.
Near-optimal offline and streaming algorithms for learning non-linear dynamical systems
Suhas Kowshik, Dheeraj Nagaraj, Prateek Jain, and Praneeth Netrapalli · 2021
Later among the works it cites.
Yue Gao and Garvesh Raskutti · 2021
Later among the works it cites.
Statistical estimation of ergodic markov chain kernel over discrete state space
Geoffrey Wolfer and Aryeh Kontorovich · 2021
Later among the works it cites.
Linear systems can be hard to learn
Anastasios Tsiamis and George J Pappas · 2021
Later among the works it cites.
Bilinear classes: A structural framework for provable generalization in rl
Simon Du, Sham Kakade, Jason Lee, Shachar Lovett, Gaurav Mahajan, Wen Sun, and Ruosong Wang · 2021
Later among the works it cites.
Single trajectory nonparametric learning of nonlinear dynamics
Ingvar Ziemann, Henrik Sandberg, and Nikolai Matni · 2022
Closest in time.
Learning from many trajectories
Stephen Tu, Roy Frostig, and Mahdi Soltanolkotabi · 2022
Closest in time.