Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 217

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Adaptive Learning in a World of Projections

Theodoridis, Sergios, Slavakis, Konstantinos, Yamada, Isao · 2011 · IEEE Signal Processing Magazine

Abstract

This article presents a general tool for convexly constrained parameter/function estimation both for classification and regression tasks, in a timeadaptive setting and in (infinite dimensional) reproducing kernel Hilbert spaces (RKHS). The thematical framework is that of the set theoretic estimation formulation and the classical projections onto convex sets (POCS) theory. However, in contrast to the classical POCS methodology, which assumes a finite number of convex sets, our method builds upon our recent extension of the theory, which considers an infinite number of convex sets. Such a context is necessary to cope with the adaptive setting rationale, where data arrive sequentially. This article's goal is to review the advances that have taken place in this area over the years and present them, in simple geometric arguments, as an integral part and natural evolution of the classical POCS methodology. The structure of the resulting algorithms is such that it allows extension to general RKHS. In this perspective, two very powerful techniques, convex optimization and (implicit) mapping to RKHS, are combined, which provide a framework for a unifying treatment of linear and nonlinear modeling of both classification and regression tasks. Typical signal processing problems, such as filtering, smoothing, equalization, and beamforming, fall under this common umbrella. The methodology allows for the incorporation of a set of convex constraints, which encode a priori information. Convexity, rather than differentiability, is the only prerequisite for adopting error measures that quantify the model's fit against a set of training data points. Moreover, the complexity per iteration step remains linear with respect to the number of unknown parameters. The potential of the theory is demonstrated via numerical simulations for two typical problems; adaptive equalization and adaptive robust beamforming.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/msp.2010.938752

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 217

Metadata

Authors
Theodoridis, S., Slavakis, K., & Yamada, I.
Venue
IEEE Signal Processing Magazine
Published
2011-01
Volume
28
Issue
1
Pages
97-123
ISSN
1053-5888 (ISSN-L)
OpenAlex
W2111395440
Cited by
217
References
3
FWCI
23.37
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Adaptive Learning in a World of Projections. https://app.cochat.ai/papers/10.1109/msp.2010.938752
The paper
Theodoridis, S., Slavakis, K., & Yamada, I. (2011). Adaptive Learning in a World of Projections. IEEE Signal Processing Magazine. https://doi.org/10.1109/msp.2010.938752

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.