Verified65% confidenceFactExact time
The Sequential Minimal Optimization algorithm (SMO) was proposed by John Platt in 1998, decomposing large-scale quadratic programming problems into minimal sub-problems involving only two variables.
3
Sources
65%
Confidence
Long-term
Relevance
7/13/2026
First Seen
Sources
Do You Still Need to Hand-Code Machine Learning Algorithms in the AI Era? The Answer and the Method
redditr/learnmachinelearning7/11/2026
Related Claims
UnverifiedThe core idea of SMO is to decompose a large optimization problem into a series of minimal sub-problems, selecting only two parameters for optimization at a time and deriving an analytical solution, thereby avoiding time-consuming numerical solving.78% similarUnverifiedPrim最小生成树算法（1957年）和Dijkstra最短路径算法（1959年）是贪心思想的早期应用64% similarUnverifiedOccupancy-measure-based algorithms rewrite the policy optimization problem as convex optimization over the occupancy measure polytope, thereby globally controlling error accumulation across all state-action pairs, which is the fundamental reason their regret bound has one fewer H factor.64% similarUnverifiedThe engineer admits that every modeling problem is only skimmed, that quick data-driven methods suffice to deliver, and that there is rarely any opportunity to apply novel algorithms or conduct literature reviews and R&D.62% similarUnverifiedThe new algorithm constructs special moduli to perform exact multiplication at smaller lengths, optimizing the zero-padding step in traditional FFT multiplication.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/498455API
curl https://kongchang.com/api/v1/knowledge/claims/498455MCP
get_claim(id=498455)