Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
Not on the map. Why?
Abstract (arXiv)
We introduce a novel multi-kernel learning algorithm, VAW2, for online least squares regression in reproducing kernel Hilbert spaces (RKHS). VAW2 leverages random Fourier feature-based functional approximation and the Vovk-Azoury-Warmuth (VAW) method in a two-level procedure: VAW is used to construct expert strategies from random features generated for each kernel at the first level, and then again to combine their predictions at the second level. A theoretical analysis yields a regret bound of O(T1/2ln T) in expectation with respect to artificial randomness, when the number of random features scales as T1/2. Empirical results on some benchmark datasets demonstrate that VAW2 achieves superior performance compared to the existing online multi-kernel learning algorithms: Raker and OMKL-GF, and to other theoretically grounded method methods involving convex combination of expert predictions at the second level.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 24 references that are in the map. First posted on arXiv 25 Mar 2025.
Builds on
9 of 24 references.
References · 9
- 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 407
- 2018Online Learning: A Comprehensive Surveycited by 203
- 2014A Second-order Bound with Excess Lossescited by 91
- 2015On the Error of Random Fourier Featurescited by 76
- 2013Relative Loss Bounds for On-line Density Estimation with the Exponential Family of Distributionscited by 59
- 2014Optimal learning with Bernstein Online Aggregationcited by 35
- 2017Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamicscited by 28
- 2018Uniform regret bounds over Rd for the sequential linear regression problem with the square losscited by 14
- 2021Graph-Aided Online Multi-Kernel Learningcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.