Those '80s-'90s analytical solutions solved nonconvex problems without convexity
caglar_ee · x · 2026-11-09
Researcher caglaree shares a research anecdote: he long tried to make sense of certain analytical solutions through the lens of convex optimization — alternating minimization? Some approximation? Nothing fit. The answer: these solutions were published back in the '80s and '90s, when hardly anyone cared about convexity, yet the underlying problems were all nonconvex — a reason to revisit older literature in optimization theory.
Related event: Researcher: Classic ML Closed-Form Solutions Don't Rely on Convexity(2 posts)→
More from Research
- New framework evaluates financial document recognition by critical-error gates, not error rates — Subodh Lonkar · 2026-11-09
- LambdaMix: one training run lets LLMs switch objective trade-offs at inference via LoRA mixtures — Constantinos Karouzos · 2026-11-09
- Toby Ord: METR's 50% Time Horizon Can Go to Infinity Without Transforming the World — tobyordoxford · 2026-11-09
- EM's M-step derivations hide nonconvex optimization problems, researcher notes — caglar_ee · 2026-11-09
- Google's ScientistTwo: autonomous multi-agent research beats baseline on 86 of 107 problems — 2C_ornot2C · 2026-11-09
- Weaviate Podcast #150: Chess-Elo-style zELO behind SOTA zerank-2 reranker — CShorten30 · 2026-11-09