揭示梯度系统收敛性与PL不等式变体的关系，解释为何弱形式仍能保证全局最优。
Remarks on the Polyak-Lojasiewicz inequality and the convergence of gradient systems
- 提出PL不等式弱化形式，分析其对梯度流轨迹的影响
- 证明连续时间LQR优化中无法满足最强形式的PL不等式
- 适用于研究优化收敛性、尤其是带正则化的梯度方法
本文探讨了Polyak-Lojasiewicz不等式（PLI）的推广及其对优化问题中梯度流收敛行为的影响。受连续时间线性二次调节器（CT-LQR）策略优化问题的启发——该问题在文献中仅被证明满足较弱的PLI形式——本文表明，尽管较弱条件足以保证全局收敛至代价函数临界点集并达到最优，但梯度流解的“形态”会因所满足的PLI具体形式而显著变化。经过一般理论分析后，本文将该框架应用于CT-LQR策略优化问题，证明其永远无法满足最强形式的PLI。随后简要讨论了连续与离散时间LQR策略优化的差异，并给出了该框架扩展至含L1正则化、通过近端梯度流求解的优化问题的直观理解。
原文摘要 · Abstract (English)
This work explores generalizations of the Polyak-Lojasiewicz inequality (PLI) and their implications for the convergence behavior of gradient flows in optimization problems. Motivated by the continuous-time linear quadratic regulator (CT-LQR) policy optimization problem -- where only a weaker version of the PLI is characterized in the literature -- this work shows that while weaker conditions are sufficient for global convergence to, and optimality of the set of critical points of the cost function, the "profile" of the gradient flow solution can change significantly depending on which "flavor" of inequality the cost satisfies. After a general theoretical analysis, we focus on fitting the CT-LQR policy optimization problem to the proposed framework, showing that, in fact, it can never satisfy a PLI in its strongest form. We follow up our analysis with a brief discussion on the difference between continuous- and discrete-time LQR policy optimization, and end the paper with some intuition on the extension of this framework to optimization problems with L1 regularization and solved through proximal gradient flows.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。