Online Learning
Online learning focuses on developing algorithms that adapt and improve their performance over time using sequentially arriving data, aiming to minimize cumulative errors or regret. Current research emphasizes robust methods for handling noisy, incomplete, or adversarial data streams, exploring architectures like neural networks, quasi-Newton methods, and multi-armed bandits, often incorporating techniques from online convex optimization. These advancements have significant implications for various fields, including robotics, network management, and personalized education, by enabling systems to learn and adapt efficiently in dynamic and unpredictable environments.
Papers
VAAD: Visual Attention Analysis Dashboard applied to e-Learning
Miriam Navarro, Álvaro Becerra, Roberto Daza, Ruth Cobos, Aythami Morales, Julian Fierrez
A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds
Taira Tsuchiya, Shinji Ito