Malicious Experts Versus the Multiplicative Weights Algorithm in Online Prediction
From MaRDI portal
Abstract: We consider a prediction problem with two experts and a forecaster. We assume that one of the experts is honest and makes correct prediction with probability at each round. The other one is malicious, who knows true outcomes at each round and makes predictions in order to maximize the loss of the forecaster. Assuming the forecaster adopts the classical multiplicative weights algorithm, we find upper and lower bounds for the value function of the malicious expert. Our results imply that the multiplicative weights algorithm cannot resist the corruption of malicious experts. We also show that an adaptive multiplicative weights algorithm is asymptotically optimal for the forecaster, and hence more resistant to the corruption of malicious experts.
Cited in
(4)- scientific article; zbMATH DE number 7370589 (Why is no real title available?)
- Comparison for semi-continuous viscosity solutions for second order PDEs on the Wasserstein space
- Numerical solution of a PDE arising from prediction with expert advice
- Comparison of viscosity solutions for a class of second-order PDEs on the Wasserstein space
This page was built for publication: Malicious Experts Versus the Multiplicative Weights Algorithm in Online Prediction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151731)