Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This paper advances machine learning theory by addressing parameter identification under Partial Persistent Excitation (PPE), a rank-deficient condition more general than standard persistent excitation. The proposed cooperative protocol enables distributed estimators to converge optimally within their respective subspaces, offering new solutions for system identification where local data is insufficiently excited.
Sources coveringarXiv, Neo4j
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Partial Excitation in Parameter Learning

arXiv2 min read

arXiv:2503.02235v3 Announce Type: replace-cross Abstract: This paper investigates parameter learning problems under Partial Persistent Excitation (PPE). The PPE condition is a rank-deficient, and therefore, a more general evolution of the well-known Persistent Excitation (PE) condition. Under the PPE condition, a proposed online algorithm is able to calculate the PE and non-PE subspaces, and finally gives an optimal parameter estimate in the sense of least squares. In particular, the learning error within the PE subspace exponentially converges to zero in the noise-free case. The PPE condition also provides a new perspective for solving distributed parameter learning problems, where the challenge is posed by local regressors that are often insufficiently excited. To improve knowledge of the unknown parameters, a cooperative learning protocol is proposed for a group of estimators that collect measured information under complementary PPE condition. This protocol allows each local estimator to operate locally in its PE subspace, and reach a consensus with neighbors in its non-PE subspace. As a result, the task of estimating unknown parameters can be achieved in a distributed way using cooperative local estimators. Application examples in system identification are given to demonstrate the effectiveness of the theoretical results developed in this paper.

Abstract:This paper investigates parameter learning problems under Partial Persistent Excitation (PPE). The PPE condition is a rank-deficient, and therefore, a more general evolution of the well-known Persistent Excitation (PE) condition. Under the PPE condition, a proposed online algorithm is able to calculate the PE and non-PE subspaces, and finally gives an optimal parameter estimate in the sense of least squares. In particular, the learning error within the PE subspace exponentially converges to zero in the noise-free case. The PPE condition also provides a new perspective for solving distributed parameter learning problems, where the challenge is posed by local regressors that are often insufficiently excited. To improve knowledge of the unknown parameters, a cooperative learning protocol is proposed for a group of estimators that collect measured information under complementary PPE condition. This protocol allows each local estimator to operate locally in its PE subspace, and reach a consensus with neighbors in its non-PE subspace. As a result, the task of estimating unknown parameters can be achieved in a distributed way using cooperative local estimators. Application examples in system identification are given to demonstrate the effectiveness of the theoretical results developed in this paper.

Systems and Control (eess.SY); Artificial Intelligence (cs.AI); Signal Processing (eess.SP); Optimization and Control (math.OC)

arXiv:2503.02235 [eess.SY]

(or arXiv:2503.02235v3 [eess.SY] for this version)

https://doi.org/10.48550/arXiv.2503.02235 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 295 words

Related coverage