Affinely constrained online learning and its application to beamforming
Lists
Only you see this
Abstract
This paper presents a novel method for incorporating a-priori affine constraints in online kernel-based learning tasks. The proposed technique elaborates the generic tool of projections to form a sequence of estimates in reproducing kernel Hilbert spaces (RKHS). The method guarantees that the whole sequence of estimates lies in the given affine constraint set. To validate the algorithm, a beamforming task is considered. The numerical results show that the proposed frame provides with solutions in cases where the classical linear approach collapses, and forms proper beam-patterns as opposed to a recent unconstrained kernel-based regression method.
BibTeX
@inproceedings{slavakis2009affinely,
author = {Konstantinos Slavakis and Sergios Theodoridis},
title = {{Affinely constrained online learning and its application to beamforming}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2009},
url = {https://openreview.net/forum?id=PDBQCS6Q4d},
}Loading related content...