Tracking the best linear predictor
From MaRDI portal
Recommendations
Cited in
(20)- Tracking the best hyperplane with a simple budget perceptron
- Tracking the best expert
- Learning rotations with little regret
- Context-based unsupervised ensemble learning and feature ranking
- On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
- Extracting certainty from uncertainty: regret bounded by variation in costs
- Low-dimensional tracking of association structures in categorical data
- An upper bound for aggregating algorithm for regression with changing dependencies
- Online forecast combinations of distributions: worst case bounds
- scientific article; zbMATH DE number 2089359 (Why is no real title available?)
- Online Regression Competitive with Changing Predictors
- Recursive forecast combination for dependent heterogeneous data
- Online variance minimization
- Online transfer learning
- Weighted last-step min-max algorithm with improved sub-logarithmic regret
- Kernelization of matrix updates, when and how?
- Bandit convex optimization in non-stationary environments
- Tracking the Best Hyperplane with a Simple Budget Perceptron
- Nonstationary online convex optimization with multiple predictions
- Leading strategies in competitive on-line prediction
This page was built for publication: Tracking the best linear predictor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2782263)