An upper bound for aggregating algorithm for regression with changing dependencies

DOI10.1007/978-3-319-46379-7_16MaRDI QIDQ2830280zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

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

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)