Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environments
Kaan Gokcesu, Hakan Gokcesu

TL;DR
This paper introduces a recursive expert framework that adaptively combines multiple learning systems to achieve near-optimal performance in dynamic, non-stationary environments with minimal computational overhead.
Contribution
It proposes a novel recursive expert approach that adaptively merges learning systems to handle non-stationary environments with provable regret bounds.
Findings
Achieves minimax optimal regret bounds up to constant factors.
Computational complexity increases only logarithmically with time.
Effective in non-stationary, dynamic environments.
Abstract
Sequential learning systems are used in a wide variety of problems from decision making to optimization, where they provide a 'belief' (opinion) to nature, and then update this belief based on the feedback (result) to minimize (or maximize) some cost or loss (conversely, utility or gain). The goal is to reach an objective by exploiting the temporal relation inherent to the nature's feedback (state). By exploiting this relation, specific learning systems can be designed that perform asymptotically optimal for various applications. However, if the framework of the problem is not stationary, i.e., the nature's state sometimes changes arbitrarily, the past cumulative belief revision done by the system may become useless and the system may fail if it lacks adaptivity. While this adaptivity can be directly implemented in specific cases (e.g., convex optimization), it is mostly not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Machine Learning and Algorithms · Stochastic Gradient Optimization Techniques
