scientific article; zbMATH DE number 7370642
From MaRDI portal
Publication:4999102
Guang-Hui Wang, Peng Zhao, Zhi-Hua Zhou, Li-jun Zhang
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1907.12340
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
online learningensemble methodsnon-stationary environmentsadaptive regretbandit convex optimizationdynamic regret
Cites Work
- Unnamed Item
- Soft sensors for monitoring and control of industrial processes.
- Logarithmic regret algorithms for online convex optimization
- Tracking the best expert
- Random gradient-free minimization of convex functions
- 10.1162/153244301753683726
- Non-Stationary Stochastic Optimization
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Online Learning and Online Convex Optimization
- Adaptive routing with end-to-end feedback
- How to use expert advice
- A survey on concept drift adaptation
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- Prediction, Learning, and Games
This page was built for publication:
