PL conditions let gradient descent converge linearly on highly non-convex functions
MarkSchmidtUBC · x · 2026-11-17
UBC professor Mark Schmidt shared a summary table expressing all the classical conditions for linear convergence of gradient descent (SC, ESC, SQC, WSC, QSC, RSI, EB, PL, QG) as lower bounds on particular directional derivatives — all except QG, which only lower-bounds function values.
The highlight is the PL (not RSI) 'toilet flush' function: a highly non-convex function where the negative gradient can point away from the minimizer, yet gradient descent still achieves a linear convergence rate. Schmidt argues this shows the power of the PL (and equivalent EB) conditions, since none of the other conditions allow this.
Related event: UBC's Mark Schmidt Uses AI to Map Optimization Convergence Assumptions(4 posts)→
More from Research
- Google Names 148 PhD Fellows for 2026 with $13M in Funding — ManishGuptaMG1 · 2026-11-17
- Swarms releases AgentRearrange paper: one-line multi-agent workflows benchmarked at 8–512 agents — KyeGomezB · 2026-11-17
- BrickFlow uses SE(3) flow models to reconstruct buildable LEGO assemblies from images — Peter Kulits · 2026-11-17
- Meta-model writes weight updates from one paragraph, beating LoRA on many benchmarks — gdm3000 · 2026-11-17
- SPARE preprint: 2.55x faster decoding for linear attention on a 1.3B model — krishnan · 2026-11-17
- Study estimates ~12% of philosophy published today may be AI-generated — leland_mcinnes · 2026-11-17