An Upper Bound for Aggregating Algorithm for Regression with Changing Dependencies
From MaRDI portal
Publication:2830280
DOI10.1007/978-3-319-46379-7_16zbMath1478.68290OpenAlexW2523561935MaRDI QIDQ2830280
Publication date: 9 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-46379-7_16
Asymptotic distribution theory in statistics (62E20) Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A game of prediction with expert advice
- Comments on ``A note on a three-term recurrence for a tridiagonal matrix
- 10.1162/153244301753683726
- A Closer Look at Adaptive Regret
- Online Regression Competitive with Changing Predictors
- Competitive On-line Statistics
- A Second-Order Perceptron Algorithm
- Relative loss bounds for on-line density estimation with the exponential family of distributions
This page was built for publication: An Upper Bound for Aggregating Algorithm for Regression with Changing Dependencies