~/talk

Machine Learning: The Bare Math Behind Libraries

Talkat NDC Oslo 2019 · 2019-06-17..06-21· [machine-learning]
links:none on file
links:none on file
slides:none on file

Linear regression with gradient descent in Octave examples fits costume price to comic appearances and yields a concrete example: $1,000 in costume predicts ~8,000 issues after 1,000 iterations. A shallow neural net (200 hidden neurons, sigmoid) learns a Batman-like logo perfectly on 600 training points but degrades on a 25,000-point grid — signs of overfitting. Unsupervised experiments use normalized six-attribute Marvel vectors and compare Hebbian learning, winner-takes-all and winner-takes-most (100 epochs); Hebbian blows up weights, winner-takes-most and SOM stabilize clusters.

AI-written summary · about

  1. 0:00Intro
  2. 1:32Machine Learning
  3. 4:43Biological Neuron
  4. 5:48Activation function
  5. 7:02What defines a superhero?
  6. 12:19Gradient descent
  7. 20:41NN - backpropagation step
  8. 27:20Unsupervised learning
  9. 37:45Hebbian learning weaknesses
  10. 47:57Learning with concurency - weaknesses
  11. 50:21Common weaknesses of artificial neuron systems
  12. 51:26Bibliography
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.