arXiv (All)
open access
EM-Based p-norm-like Constraint RLS Algorithm with Adaptive Regularization for Sparse System Identification
In this paper, the recursive least squares (RLS) algorithm is considered in the sparse system identification setting. The cost function of RLS algorithm is regularized by a p-norm-like ($0 \leq p \leq 1$) constraint of the estimated system parameters. To minimize the regularized cost function, we tr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A linear framework for low-complexity SoC estimation in lithium-ion batteries validated with real data#243781
- Subconvexity of Short $k$-Free Exponential Sums in $\mathbb{F}_q[t]$#818984
- Subconvexity of Short $k$-Free Exponential Sums in $\mathbb{F}_q[t]$#808992
- Lower Bounds for Linear-Oracle Online Learning#1142976
- On Unbiased Parameter Estimation and Signal Reconstruction#1035484
Record · ID 1142514
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive