-
Optimality of Robust Online Learning
The dataset used in this paper is a sequence of random samples independently distributed from a probability distribution ρ. -
Efficient Algorithms for Online Decision Problems
An efficient algorithm for online decision problems. -
Minimax Regret for Online Learning with Feedback Graphs
The dataset used in the paper is a sequence of strongly observable undirected feedback graphs, where each graph has independence number α for some common value α. -
Online Nonlinear Estimation via Iterative L2-Space Projections
The proposed online learning paradigm is a significant extension of the conventional kernel adaptive filtering framework from RKHS to the space L2(RL, dµ) which has no...