Abstract
In this paper, we study gradient-based adaptive algorithms within parameter spaces specified by ∥w∥ = 1, where ∥ · ∥ is any vector norm. Several approximate algorithms for this task have already been developed when ∥w∥ is the L2 norm. We derive general algorithm forms for arbitrary vector norms and relate them to true gradient procedures via their geometric structures. We also give algorithms that mitigate an inherent numerical instability for tangent-vector L2-norm methods. Simulations showing the performance of the techniques for minor component analysis are provided.
Original language | English (US) |
---|---|
Pages | 144-147 |
Number of pages | 4 |
State | Published - 1998 |
Externally published | Yes |
Event | Proceedings of the 1998 9th IEEE SP Workshop on Statistical Signal and Array Processing - Portland, OR, USA Duration: Sep 14 1998 → Sep 16 1998 |
Other
Other | Proceedings of the 1998 9th IEEE SP Workshop on Statistical Signal and Array Processing |
---|---|
City | Portland, OR, USA |
Period | 9/14/98 → 9/16/98 |
All Science Journal Classification (ASJC) codes
- General Engineering