At some point, you can’t get any further with linked lists, selection sort, and voodoo Big O, and you have to go get a real algorithms textbook and learn all that horrible math, at least a little. But which book? There are tons of them. I haven’t read every algorithms book out there, but I…
from David Mount !
Alternate Lecture notes at:
- https://www.cs.umd.edu/users/meesh/cmsc351/mount/lectures/
- https://www.cs.umd.edu/~mount/251/Lects/251lects.pdf
An objective function is a measure of how similar a prediction of a value and the actual value are. Usually, we are looking to find the set of parameters that lead to the smallest possible cost which would imply that your algorithm will perform well.
Lectures in the 2016 Seminar on "Proofs, beliefs and algorithms through the lens of Sum of Squares" at Harvard and MIT, see http://www.boazbarak.org/sos/