<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Ideas on Haitong Lan</title><link>https://HaitongLan.github.io/categories/ideas/</link><description>Recent content in Ideas on Haitong Lan</description><generator>Hugo</generator><language>en</language><copyright>Haitong's blog</copyright><lastBuildDate>Sat, 14 Nov 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://HaitongLan.github.io/categories/ideas/index.xml" rel="self" type="application/rss+xml"/><item><title>Multiplicative Updates as Preconditioning</title><link>https://HaitongLan.github.io/p/mu-as-preconditioning/</link><pubDate>Sat, 14 Nov 2026 00:00:00 +0800</pubDate><guid>https://HaitongLan.github.io/p/mu-as-preconditioning/</guid><description>I started thinking about multiplicative updates after reading about ScaledGD. Both algorithms scale their gradients using the current factors. Rewriting MU in this form reveals how its diagonal scaling responds to coordinate units and component correlation.
Seeing the gradient inside the multiplicative update Scaled gradient descent (ScaledGD) makes a familiar promise in low-rank recovery. By adapting the gradient to the current factors, it can achieve convergence rates independent of the condition number of the target matrix under appropriate observation and initialization assumptions Tong, Ma, and Chi (2021).</description></item></channel></rss>