Answers are grounded in this paper and cite their sources.
We study gradient-based adaptive algorithms within parameter spaces specified by /spl par/w/spl par/=1, where /spl par//spl middot//spl par/ is any vector norm. Several approximate algorithms for this task have already been developed when /spl par/w/spl par/ is the L/sub 2/ 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 L/sub 2/-norm methods. Simulations showing the performance of the techniques for minor component analysis are provided.
No takes yet. Share an insight, caveat, or question.
Douglas et al. (2002) studied this question.