Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.11303 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912249504858112 |
|---|---|
| author | Ochoa, Daniel E. Poveda, Jorge I. |
| author_facet | Ochoa, Daniel E. Poveda, Jorge I. |
| contents | We introduce a class of concurrent learning (CL) algorithms designed to solve parameter estimation problems with convergence rates ranging from hyperexponential to prescribed-time while utilizing alternating datasets during the learning process. The proposed algorithm employs a broad class of dynamic gains, from exponentially growing to finite-time blow-up gains, enabling either enhanced convergence rates or user-prescribed convergence time independent of the dataset's richness. The CL algorithm can handle applications involving switching between multiple datasets that may have varying degrees of richness and potential corruption. The main result establishes convergence rates faster than any exponential while guaranteeing uniform global ultimate boundedness in the presence of disturbances, with an ultimate bound that shrinks to zero as the magnitude of measurement disturbances and corrupted data decreases. The stability analysis leverages tools from hybrid dynamical systems theory, along with a dilation/contraction argument on the hybrid time domains of the solutions. The algorithm and main results are illustrated via a numerical example. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_11303 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Prescribed-Time and Hyperexponential Concurrent Learning with Partially Corrupted Datasets: A Hybrid Dynamical Systems Approach Ochoa, Daniel E. Poveda, Jorge I. Optimization and Control We introduce a class of concurrent learning (CL) algorithms designed to solve parameter estimation problems with convergence rates ranging from hyperexponential to prescribed-time while utilizing alternating datasets during the learning process. The proposed algorithm employs a broad class of dynamic gains, from exponentially growing to finite-time blow-up gains, enabling either enhanced convergence rates or user-prescribed convergence time independent of the dataset's richness. The CL algorithm can handle applications involving switching between multiple datasets that may have varying degrees of richness and potential corruption. The main result establishes convergence rates faster than any exponential while guaranteeing uniform global ultimate boundedness in the presence of disturbances, with an ultimate bound that shrinks to zero as the magnitude of measurement disturbances and corrupted data decreases. The stability analysis leverages tools from hybrid dynamical systems theory, along with a dilation/contraction argument on the hybrid time domains of the solutions. The algorithm and main results are illustrated via a numerical example. |
| title | Prescribed-Time and Hyperexponential Concurrent Learning with Partially Corrupted Datasets: A Hybrid Dynamical Systems Approach |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2502.11303 |