머신러닝
Convex Optimization
Algorithmus
2024. 5. 25. 10:18
- Convexity
- bowl-shapedness: function >= tangent
- ie. f(u) >= f(w) + <del f(w), u - w>
= f(w) + f'(w) (u - w)
- ie. f(u) >= f(w) + <del f(w), u - w>
- chord across bowl: chord >= function
- 2nd gradient of function is psd; ▽2f(w) or, f''(w) >= 0
- 2nd gradient > 0 : strict convexity
- bowl-shapedness: function >= tangent
- Global minimum
- convex & the critical point (ie. gradient = 0)
반응형