Kalman recursions aggregated online
From MaRDI portal
Publication:6549166
DOI10.1007/S00362-023-01410-7zbMATH Open1543.62536MaRDI QIDQ6549166FDOQ6549166
Eric Adjakossa, Yannig Goude, Olivier Wintenberger
Publication date: 3 June 2024
Published in: Statistical Papers (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Inference from stochastic processes and prediction (62M20)
Cites Work
- Title not available (Why is that?)
- A decision-theoretic generalization of on-line learning and an application to boosting
- Analysis of Financial Time Series
- Forecasting electricity consumption by aggregating specialized experts
- Prediction, Learning, and Games
- Optimal learning with Bernstein Online Aggregation
- Generalized Additive Models for Location, Scale and Shape
- Mixing least-squares estimators when the variance is unknown
- Forecasting with exponential smoothing. The state space approach
- Stability of Recursive Stochastic Tracking Algorithms
- The weighted majority algorithm
- Time series analysis by state space methods.
- Tracking the best expert
- A game of prediction with expert advice
- Improved second-order bounds for prediction with expert advice
- Analytical uses of Kalman filtering in econometrics — A survey
- Dynamic factors in periodic time-varying regressions with an application to hourly electricity load modelling
- Modern Strategies for Time Series Regression
This page was built for publication: Kalman recursions aggregated online
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549166)
