Online Algorithm for Aggregating Experts' Predictions with Unbounded Quadratic Loss
We consider the problem of online aggregation of expert predictions with the quadratic loss function. We propose an algorithm for aggregating expert predictions which does not require a prior knowledge of the upper bound on the losses. The algorithm is based on the exponential reweighing of expert losses.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Online Aggregation of Unbounded Losses Using Shifting Experts with Confidence
We develop the setting of sequential prediction based on shifting experts and on a "smooth" version of the method of specialized experts. To aggregate experts predictions, we use the AdaHedge algorithm, which is a versio…
validNo-Regret Online Prediction with Strategic Experts
We study a generalization of the online binary prediction with expert advice framework where at each round, the learner is allowed to pick $m\geq 1$ experts from a pool of $K$ experts and the overall utility is a modular…
PredictionOnline Aggregation of Probability Forecasts with Confidence
The paper presents numerical experiments and some theoretical developments in prediction with expert advice (PEA). One experiment deals with predicting electricity consumption depending on temperature and uses real data.…
scoring ruleSoft-Bayes: Prod for Mixtures of Experts with Log-Loss
We consider prediction with expert advice under the log-loss with the goal of deriving efficient and robust algorithms. We argue that existing algorithms such as exponentiated gradient, online gradient descent and online…
Gaussian Experts Selection using Graphical Models
Local approximations are popular methods to scale Gaussian processes (GPs) to big data. Local approximations reduce time complexity by dividing the original dataset into subsets and training a local expert on each subset…
Gaussian ProcessesUncertainty Quantification