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

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

Diffusion Sparse Least-Mean Squares Over Networks

Liu, Ying, Li, Chunguang, Zhang, Zhaoyang · 2012 · IEEE Transactions on Signal Processing

Abstract

We address the problem of in-network distributed estimation for sparse vectors. In order to exploit the underlying sparsity of the vector of interest, we incorporate the ℓ1- and ℓ0-norm constraints into the cost function of the standard diffusion least-mean squares (LMS). This technique is equivalent to adding a zero-attracting term in the iteration of the LMS-based algorithm, which accelerates the convergence rates of the zero or near-zero components. The rules for selecting the intensity of the zero-attracting term are derived and verified. Simulation results show that the performances of the proposed schemes depend on the degree of sparsity. Provided that suitable intensities of the zero-attracting term are selected, they can outperform the standard diffusion LMS when the considered vector is sparse. In addition, a practical application of the proposed sparse algorithms in spectrum estimation for a narrow-band source is presented.

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/tsp.2012.2198468

Cites

1 of 1 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 1 references

Cited by

See all 170

Metadata

Authors
Liu, Y., Li, C., & Zhang, Z.
Venue
IEEE Transactions on Signal Processing
Published
2012-08
Volume
60
Issue
8
Pages
4480-4485
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W1986302543
Cited by
170
References
1
FWCI
12.07
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: Diffusion Sparse Least-Mean Squares Over Networks. https://app.cochat.ai/papers/10.1109/tsp.2012.2198468
The paper
Liu, Y., Li, C., & Zhang, Z. (2012). Diffusion Sparse Least-Mean Squares Over Networks. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2012.2198468

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.