Multiplicative reweighting for robust neural network optimization
From MaRDI portal
Cites work
- A decision-theoretic generalization of on-line learning and an application to boosting
- Convex optimization: algorithms and complexity
- scientific article; zbMATH DE number 7626737 (Why is no real title available?)
- scientific article; zbMATH DE number 7064063 (Why is no real title available?)
- Online learning and online convex optimization
- Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension
- Stochastic bandits robust to adversarial corruptions
- Understanding machine learning. From theory to algorithms
This page was built for publication: Multiplicative reweighting for robust neural network optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894117)