Research map / Bandits and online learning / Online convex optimization and games
Online Multitask Learning with Long-Term Memory
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Reuse learned hypotheses across recurring modes instead of relearning them at each switch | Switching multitask online learning · Switching multitask online prediction | hypothesis-learning complexity | Helped |
| Use the path-tree temporal kernel to encode sporadic changes in the RKHS comparator | RKHS switching multitask algorithm · Switching multitask online prediction | expected regret | Helped |
Closest papers by meaning
- Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning (NeurIPS 2023 · similarity 0.90)
- Confidence Weighted Multitask Learning (AAAI 2019 · similarity 0.88)
- Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood (NeurIPS 2024 · similarity 0.86)
- Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously (NeurIPS 2024 · similarity 0.86)
- Online Task-Free Continual Learning via Dynamic Expansionable Memory Distribution (CVPR 2025 · similarity 0.85)
- A Statistical Theory of Regularization-Based Continual Learning (ICML 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.