AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Finite Sample Analysis Of Dynamic Regression Parameter Learning

Mark Kozdoba, Edward Moroshko, Shie Mannor, Koby Crammer

NeurIPS 2022 · Learning theory and algorithms › Sample complexity · approach: Optimal mean estimation and subsampling · 0 citations (OpenAlex)

Read the paper

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Increase number of time steps TSTVE · Synthetic LDS (n=5, sigma^2=0.5, eta^2=2, 150 runs)variance estimation errorImproved
Use adaptive models (MLE, STVE, OG) instead of stationary regressionload forecasting · Electricity load vs temperature, train halfdaily squared prediction errorImproved
Use adaptive models instead of stationary regressionload forecasting · Electricity load vs temperature, test halfdaily squared prediction errorImproved
Learn Kalman filter variances with STVE instead of MLEKalman filter dynamic regression · Electricity load vs temperaturedaily squared prediction errorNo clear effect
Use Kalman filter methods (MLE, STVE) instead of online gradient (OG)dynamic regression forecaster · Electricity load vs temperaturedaily squared prediction errorImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy