An upper bound for aggregating algorithm for regression with changing dependencies

DOI10.1007/978-3-319-46379-7_16zbMATH Open1478.68290OpenAlexW2523561935MaRDI QIDQ2830280FDOQ2830280

Authors: Yuri Kalnishkan 

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

Recommendations

• Online Regression Competitive with Changing Predictors
• Aggregating Algorithm for a Space of Analytic Functions
• Theory and Applications of Models of Computation
• Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean
• Tracking the best linear predictor

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05) Asymptotic distribution theory in statistics (62E20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Tracking the best linear predictor
• A Second-Order Perceptron Algorithm
• Comments on ``A note on a three-term recurrence for a tridiagonal matrix
• A game of prediction with expert advice
• Competitive On-line Statistics
• Relative loss bounds for on-line density estimation with the exponential family of distributions
• A closer look at adaptive regret
• Online Regression Competitive with Changing Predictors
• Title not available (Why is that?)
• Second-order non-stationary online learning for regression

Cited In (1)

• Online Regression Competitive with Changing Predictors

This page was built for publication: An upper bound for aggregating algorithm for regression with changing dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830280)