These two algorithms relax the constraints of ML algorithm and transform it into a convex problem which can be efficiently solved with a polynomial time.
这两类算法是在ML算法基础上放松约束条件,将问题转化为可在多项式时间内解决的凸优化问题。
These two algorithms relax the constraints of ML algorithm and transform it into a convex problem which can be efficiently solved with a polynomial time.
这两类算法是在ML算法基础上放松约束条件,将问题转化为可在多项式时间内解决的凸优化问题。
应用推荐